짱해커가 되어보자

* 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)])

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

* Solved 기준 브론즈2 단순 풀이 input(); l = map(int, input().split()) c,s = int(input()),0 for i in l: s += i//c*c + (c if i%c else 0) print(s)

* Solved 기준 브론즈2 단순 풀이 for _ in range(int(input())): n = input(); s = str(int(n) + int(n[::-1])) for i in range(0,len(s)//2): if(s[i]!=s[len(s)-i-1]): print('NO'); break else: print('YES')

* Solved 기준 브론즈2 단순 풀이 n,k,c = int(input()),1,0 while n>0: (n,k) = (n-k,k+1) if n-k>=0 else (n-1,2); c += 1 print(c)