짱해커가 되어보자

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

* Solved 기준 브론즈2 단순 풀이 for _ in range(int(input())): l = input().split(); l[0] = 'god' print(''.join(l))

* Solved 기준 브론즈2 단순 풀이 for _ in range(int(input())): a,b = input().split('-'); A,B = 0,0 for i in range(len(a)): A += (ord(a[i])-65)*26**(len(a)-i-1) print('nice' if abs(int(b)-A)

* Solved 기준 브론즈2 단순 풀이 l,n = int(input()),input() a,b,c = 0,0,0 for i in range(l): if(n[i] == ['A','B','C'][i%3]): a+=1 if(n[i] == ['B','A','B','C'][i%4]): b+=1 if(n[i] == ['C','C','A','A','B','B'][i%6]): c+=1 M = max(a,b,c); print(M) if(a==M): print('Adrian') if(b==M): print('Bruno') if(c==M): print('Goran')

* Solved 기준 브론즈2 단순 풀이 for _ in range(int(input())): a,b = input(),input(); l,s = len(a),0 for i in range(l): if(a[i]!=b[i]): s += 1 print('Hamming distance is {}.'.format(s))

* Solved 기준 브론즈2 단순 풀이 for _ in range(int(input())): n = input(); l = len(n) print('Do-it' if n[l//2-1]==n[l//2] else 'Do-it-Not')

* Solved 기준 브론즈2 단순 풀이 import sys while True: i = sys.stdin.readline() if not(i): break n,k = map(int, i.split()); s=n while n//k: s,n = s+n//k, n//k+n%k print(s)