Algorithm/BFS, DFS

[백준] 2675 문자열 반복

등촌동 꼬북이 2020. 9. 4. 16:06

쉬운 문제

 

x = int(input())
num = []
case = []
for i in range(x):
    n, t = map(str, input().split())
    num.append(int(n))
    case.append(t)
    
for i in range(x):
    for j in range(len(case[i])):
        for z in range(num[i]):
            print(case[i][j], end='')
    print()