짱해커가 되어보자

* Solved 기준 브론즈2 단순 풀이 from collections import Counter m = 0 for _ in range(int(input())): l,s = Counter(map(int, input().split())),0 c = list(l.values()).count(2) for key,val in l.items(): if(val==4): s += 50000+key*5000 elif(val==3): s += 10000+key*1000 elif(val==2): s += key*(500 if c==2 else 100) s += 2000 if c==2 else 1000 if c==1 else max(l.keys())*100 if len(l)==4 else 0 m = max(m,s) prin..

* Solved 기준 브론즈2 단순 풀이 n = int(input()) if not(n%2): print('I LOVE CBNU') else: print('*'*n) for i in range(n//2+1): print('{}*{}'.format(' '*(n//2-i), ' '*(i*2-1)+'*' if i else ''))

* Solved 기준 브론즈2 단순 풀이 n = int(input())%2; a,b = input(),input() if(n): a = ''.join(['1' if a[i]=='0' else '0' for i in range(len(a))]) print('Deletion succeeded' if a==b else 'Deletion failed')

* Solved 기준 브론즈2 단순 풀이 while True: n,l = input().replace(' ',''), [0]*26 if(n=='*'): break for i in n: l[ord(i)-97] = 1 print('N' if l.count(0) else 'Y')

* Solved 기준 브론즈2 단순 풀이 for _ in range(int(input())): p,m = map(int, input().split()) l,s = [0]*(m+1),0 for _ in range(p): a = int(input()) if not(l[a]): l[a]=1 else: s += 1 print(s)

* Solved 기준 브론즈2 단순 풀이 l = [0,1] + [0]*99 for i in range(2,101): l[i] = l[i-1] + i**2 while True: n = int(input()) if not(n): break print(l[n])

* Solved 기준 브론즈2 단순 풀이 from collections import Counter for _ in range(int(input())): a,b = Counter(input().split()[1:]), Counter(input().split()[1:]) for i in '4321': if(a[i] != b[i]): print('A' if a[i] > b[i] else 'B'); break else: print('D')

* Solved 기준 브론즈2 단순 풀이 while True: n,r = int(input()),0 if not(n): break for _ in range(n): s = input() if(r > len(s)): continue for i in s[r:]: if(i==' '): break r += 1 print(r+1)

* Solved 기준 브론즈2 단순 풀이 n,k,r = input(),input(),'' nl,kl = len(n),len(k) for i in range(nl): if(n[i] == ' '): r += ' '; continue c = ord(n[i])-ord(k[i%kl]) r += chr(c + (26 if c

* Solved 기준 브론즈2 단순 풀이 for i in range(int(input())): print('{}. {}'.format(i+1, input()))