짱해커가 되어보자

* 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=',')

* Solved 기준 브론즈2 단순 풀이 n,m,r = map(int, input().split()); l,i,c = [0]*n,0,0 while l[i]+1!=m: l[i] += 1; c += 1 i = (i+r)%n if l[i]%2 else (i-r)%n print(c)

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

* Solved 기준 브론즈2 단순 풀이 nm,m,n = input(),-1,'' for i in sorted([input() for _ in range(int(input()))]): l,o,v,e = nm.count('L')+i.count('L'),nm.count('O')+i.count('O'),nm.count('V')+i.count('V'),nm.count('E')+i.count('E') s = ((l+o)*(l+v)*(l+e)*(o+v)*(o+e)*(v+e))%100 if(s>m): m,n = s,i print(n)

* Solved 기준 브론즈2 단순 풀이 while True: n,s = input(),0 if(n=='#'): break for i in 'aeiouAEIOU': s += n.count(i) print(s)

* Solved 기준 브론즈2 단순 풀이 a,b,c = map(int, input().split()); l = [0]*81 for i in range(1,a+1): for j in range(1,b+1): for k in range(1,c+1): l[i+j+k]+=1 print(l.index(max(l)))

* Solved 기준 브론즈2 단순 풀이 N,m,M,T,R = map(int, input().split()); x,c=m,0 while N: c += 1 if(x+T =m else m if(x==m and x+T>M): c=-1; break print(c)

* Solved 기준 브론즈2 단순 풀이 n,m = map(int, input().split()) print(str(n)*n if n

* Solved 기준 브론즈2 단순 풀이 a,b = map(int, input().split()) (a,b) = (b,a) if a>b else (a,b) print(b-a-1 if a!=b else 0); print(*[i for i in range(a+1,b)])