짱해커가 되어보자

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

* Solved 기준 브론즈2 단순 풀이 n,m = map(int, input().split()) l = [0]*1001; s = 0 for i in map(int, input().split()): for v in range(i,n+1,i): if(l[v]): continue s+=v; l[v]=1 print(s)

* Solved 기준 브론즈2 단순 풀이 for _ in range(int(input())): a,b = map(int, input().split()); s = input() for i in s: print(chr((a*(ord(i)-65)+b)%26+65), end='') print()

* Solved 기준 브론즈2 단순 풀이 for i in range(int(input())): a = list(map(int,input().split())) b = list(map(int,input().split())) A = a[0]+a[1]*2+a[2]*3+a[3]*3+a[4]*4+a[5]*10 B = b[0]+b[1]*2+b[2]*2+b[3]*2+b[4]*3+b[5]*5+b[6]*10 print('Battle {}: {}'.format(i+1, 'Evil eradicates all trace of Good' if B>A else 'Good triumphs over Evil' if A>B else 'No victor on this battle field'))

* Solved 기준 브론즈2 단순 풀이 i=0 while True: c = input(); i+=1 if('E' in c): break print('Case {}: {}'.format(i, str(eval(c)).lower()))

* Solved 기준 브론즈2 단순 풀이 y = [31,28,31,30,31,30,31,31,30,31,30,31] w = ['Thursday','Friday','Saturday','Sunday','Monday','Tuesday','Wednesday'] d,m = map(int, input().split()); d += sum(y[0:m-1])-1 print(w[d%7])

* Solved 기준 브론즈2 단순 풀이 input(); l = list(map(int, input().split())) print(sum(l)-max(l))

* Solved 기준 브론즈2 단순 풀이 r,c = map(int, input().split()) a,b = map(int, input().split()) for i in range(r): for _ in range(a): for j in range(c): print('.'*b if (i+j)%2 else 'X'*b, end='') print()

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

* Solved 기준 브론즈2 단순 풀이 for _ in range(int(input())): print(input().lower())