대학원생이 쉽게 설명해보기

a, b = input().split()

reverse_a = int(a[::-1])
reverse_b = int(b[::-1])

print(max(reverse_a, reverse_b))

T = int(input())

words = [input() for _ in range(T)]

def check_continuous(v):
    for i in range(len(v)):
        a = ['F', 'F']
        for j in range(i+1, len(v)):
            if(v[i] == v[j] and a[0] == 'T'): #연속으로 나오지 않음 + 떨어져서 같은 문자가 나온 경우
                a[1] = 'T'
            if(v[i] != v[j]): # 글자가 연속으로 나오지 않았을 경우
                a[0] = 'T'
            if(a[0] == 'T' and a[1] == 'T'): # 위 두가지가 모두 만족하면 0
                return 0
    return 1

count = 0
for word in words:
    count += check_continuous(word)
print(count)

words = input().lower()
words_list = list(set(words))
word_count = list()

for i in words_list:
    count = words.count(i)
    word_count.append(count)

if(word_count.count(max(word_count)) >= 2):
    print('?')
else:
    print(words_list[(word_count.index(max(word_count)))].upper())

T = int(input())

S = dict()
for _ in range(T):
    repeat, words = input().split()
    output = ''
    for word in words:
        output += word * int(repeat)
    print(output)

word = input()

alphabet = {'a':-1, 'b':-1, 'c':-1,'d':-1,'e':-1,'f':-1,'g':-1,'h':-1,'i':-1,'j':-1,'k':-1,'l':-1,
           'm':-1,'n':-1,'o':-1,'p':-1,'q':-1,'r':-1,'s':-1,'t':-1,'u':-1,'v':-1,'w':-1,'x':-1,'y':-1,'z':-1}

for i in word:
    alphabet[i] = word.index(i)

output = ''
for _, value in alphabet.items():
    output += str(value)+ ' '
print(output)