백준 [ALGORITHM] - 이름 궁합 (15312)

import string

def dp(null_lst):
    while len(null_lst) > 2:
        for i in range(len(null_lst) - 1):
            null_lst[i] = int(null_lst[i]) + int(null_lst[i+1])
            null_lst[i] = str(null_lst[i])[-1]
            
        null_lst.pop()    
       
    return null_lst

   

lst = list(string.ascii_uppercase)
num = [3, 2, 1, 2, 3, 3, 2, 3, 3, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 1, 1, 1, 2, 2, 1]

lst = dict(zip(lst,num))

first_input = list(input().upper())
second_input = list(input().upper())
null_lst = []

for i, j in zip(first_input, second_input):
    i = lst[i]
    j = lst[j]
    null_lst.append(i)
    null_lst.append(j)

result = dp(null_lst)

result = ''.join(result)
print(result)