짱해커가 되어보자

* Solved 기준 브론즈2 단순 풀이 n,m = map(int, input().split()); l = [i+1 for i in range(n)] for _ in range(m): i,j = map(int, input().split()) l[i-1:j] = l[i-1:j][::-1] print(*l)

* Solved 기준 브론즈2 단순 풀이 def gp(m): l = [True]*(m+1) for i in range(2,int(m**0.5)+1): if l[i]: for j in range(i*2,m+1,i): l[j] = False return l p = gp(1040); n,s = input(),0 for i in n: s += ord(i)-96 if i>='a' and i

* Solved 기준 브론즈2 단순 풀이 n,k = map(int, input().split()) l = list(map(int, input().split(','))) for _ in range(k): l = [l[i+1]-l[i] for i in range(len(l)-1)] print(*l, sep=',')