[BOJ] 이름 궁합 테스트/ 실버 5 / 35분

https://www.acmicpc.net/problem/17269

Author: YoonYn9915

YoonYn9915/implementation/2025-07-12-[백준]-#17269-이름궁합 테스트.py

@@ -0,0 +1,29 @@
+import copy
+dic = {'A':3,'B':2,'C':1,'D':2,'E':4,'F':3,'G':1,'H':3,'I':1,'J':1,'K':3,'L':1,'M':3,'N':2,'O':1,'P':2,'Q':2,'R':2,'S':1,'T':2,'U':1,'V':1,'W':1,'X':2,'Y':2,'Z':1}
+N, M = map(int, input().split())
+A, B = input().split()
+
+min_len = min(N,M)
+new = []
+for i in range(min_len):
+    new += A[i] + B[i]
+
+if N > M:
+    new += A[min_len:]
+elif N < M:
+    new += B[min_len:]
+
+new_num = []
+for j in new:
+    new_num.append(dic[j])
+
+while len(new_num) > 2:
+    temp = []
+    for k in range(1, len(new_num)):
+        temp_num = new_num[k-1] + new_num[k]
+        if temp_num >= 10:
+            temp_num -= 10
+        temp.append(temp_num)
+    new_num = copy.deepcopy(temp)
+
+print("{}%".format(new_num[0]*10 + new_num[1]))