짱해커가 되어보자

* Solved 기준 브론즈2 단순 풀이 import sys while True: n = sys.stdin.readline() if not(n): break s,d,c,b = 0,0,0,0 for i in n: i = ord(i) if(i==32): b+=1 elif(i>=48 and i=65 and i=97 and i

* Solved 기준 브론즈2 단순 풀이 for _ in range(int(input())): n = int(input()) l = [False]*n for i in range(1,n+1): for t in range(i-1,n,i): l[t] = not(l[t]) print(l.count(True))

* Solved 기준 브론즈2 단순 풀이 l = ['black','brown','red','orange','yellow','green','blue','violet','grey','white'] f,s,t = l.index(input()),l.index(input()),l.index(input()) print((f*10+s)*10**t)

* Solved 기준 브론즈2 단순 풀이 l,t,s = [input() for _ in range(8)],True,0 for i in range(8): for j in range(8): if(l[i][j]=='F' and t): s+=1 t=not(t) t=not(t) print(s)

* Solved 기준 브론즈2 단순 풀이 def solve(a): ans = sum(a) return ans

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

* Solved 기준 브론즈2 단순 풀이 l = [0]*26 for i in input(): l[ord(i)-97] += 1 print(' '.join(map(str,l)))

* Solved 기준 브론즈2 단순 풀이 l,s = ['ABC','DEF','GHI','JKL','MNO','PQRS','TUV','WXYZ'],0 for i in input(): for t in range(len(l)): if(i in l[t]): s += t+3; break print(s)

* Solved 기준 브론즈3 단순 풀이 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 [i for i in range(2,m+1) if l[i]] n,k = map(int, input().split()) for i in gp(k): if(i!=k and n%i == 0): print('BAD', i); break else: print('GOOD') * 1837과 동일한 문제

* Solved 기준 브론즈3 단순 풀이 for _ in range(int(input())): d,n,s,p = map(int, input().split()); pt,st = d+n*p,n*s print('parallelize' if ptst else 'does not matter')