한수진 입니다.

n = int(input()) count = n T = [] for j in range(n): s = list(input()) T.append(s[0]) for i in range(len(s)-1): if s[i] != s[i+1]: T.append(s[i + 1]) flag = True //이중 for문 탈출하기 위해 flag 사용 for k in range(len(T)-1): for l in range(k+1,len(T)): if T[k] == T[l]: count -= 1 flag = False break l += 1 k += 1 if flag == False: break del T[:] print(count)

S = {0: ['A', 'B', 'C'], 1: ['D', 'E', 'F'], 2: ['G', 'H', 'I'], 3: ['J', 'K', 'L'], 4: ['M', 'N', 'O'], 5: ['P', 'Q', 'R', 'S'], 6: ['T', 'U', 'V'], 7: ['W', 'X', 'Y', 'Z']} num = input() count = 0 for i in range(len(num)): for k in range(len(S)): for j in range(len(S[k])): if num[i] == S[k][j]: count += k+3 print(count)

S = list(input().split()) V = [] T = [] U = [] for i in range(len(S)): del T[:] del V[:] T = '#'.join(S[i]).split('#') for j in reversed(range(len(T))): V.append(T[j]) U.append(''.join(V)) print(max(U))

S = list(input().split()) print(len(S))

small = 'abcdefghijklmnopqrstuvwxyz' big = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' num = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] word = input() for i in range(len(word)): for j in range(len(small)): if word[i] == small[j]: num[j] += 1 if word[i] == big[j]: num[j] += 1 Max = 0 x = 0 for l in range(len(num)): if num[l] > Max: Max = num[l] find = big[l] x = Max count = 0..