Potato

 

- 딕셔너리를 이용하여 풀었다

 

import sys

n = int(sys.stdin.readline())

alphabet_dict = {}
answer = 0
pocket = []

for _ in range(n):
    alphabet = input()
    pocket.append(alphabet)

for alphabet in pocket:
    for i, char in enumerate(alphabet):
        num = 10 ** (len(alphabet) - i - 1)
        if char not in alphabet_dict:
            alphabet_dict[char] = 0
        alphabet_dict[char] += num

alphabet_list = [value for value in alphabet_dict.values() if value > 0]
sorted_list = sorted(alphabet_list, reverse=True)

for i, value in enumerate(sorted_list):
    answer += value * (9 - i)

print(answer)

 

 

 

'Python > 백준' 카테고리의 다른 글

[백준/Python] 1850. 최대공약수  (0) 2023.11.04
[백준/Python] 4179. 불!  (0) 2023.08.04
[백준/Python] 13241.최소공배수  (0) 2023.04.12
[백준/Python] 12761.돌다리  (0) 2023.03.03
[백준/Python] 13565. 침투  (0) 2023.03.02

+ Recent posts