출처 | https://www.acmicpc.net/step/7

10809 - 알파벳 찾기(1)

a = list(input())
c = 'abcdefghijklmnopqrstuvwxyz'

for i in c:
    if i in a:
        print(a.index(i), end=' ')
    else:
        print(-1, end = ' ')
        

10809 - 알파벳 찾기(2)

S = input()

for x in 'abcdefghijklmnopqrstuvwxyz':
    print(S.index(x), end = ' ')

2675 - 문자열 반복(O(n^2))

n = int(input())

for _ in range(n):
    cnt, word = input().split()
    for i in word:
        print(i*int(cnt), end ='')
    print()

1152 - 단어의 개수

word = input().split()
print(len(word))

2908 - 상수

num1, num2 = input().split()
num1 = int(num1[::-1])  # [::-1] : 역순
num2 = int(num2[::-1])

if num1 > num2:
    print(num1)
else :
    print(num2)