파이톨치

n = int(input()) k = 1 numbers = [] for i in range(n): numbers.append(input()) while(True): new = [] for i in range(n): num = numbers[i][-k:] # print(num, new) if num not in new: new.append(num) else: continue if len(new) == n: break k += 1 print(k)

n = int(input()) dic = {} for i in range(n): s = input() if s in dic.keys(): dic[s] += 1 else: dic[s] = 1 dic = dict(sorted(dic.items(), reverse=False)) max = -1; for key in dic.keys(): if dic[key] > max: max = dic[key] answer = key print(answer)

n=100000 a = [False,False] + [True]*(n-1) primes=[] for i in range(2,n+1): if a[i]: primes.append(i) for j in range(2*i, n+1, i): a[j] = False cnt = 0 def sol(x:int): a = 0 k = 0 d = primes[k] while primes[k]

l = [] a, b, c = map(int, input().split()) for i in range(1, a+1): for j in range(1, b+1): for k in range(1, c+1): d = i+j+k; l.append(d) max_input = max(l) my_list = [0] * max_input for i in l: my_list[i-1] += 1 print(my_list.index(max(my_list))+1)

while(1): n = input() if n == '0': break n2 = n[::-1] if n == n2: print("yes") else: print("no")

왜 시간초과냐고..;; 아는 분은 댓글 부탁합니다. n = int(input()) avgs = [] for i in range(n): avgs.append(int(input().replace('.', ''))) k = 0 while(1): k += 1 check = 0 for avg in avgs: b = int(round(avg*k/1000)/k*1000) if b != avg: check = 1 if check == 1: break if check == 0: break print(k) n = int(input()) avgs = [] for i in range(n): avgs.append(int(input().replace(".", ""))) # 풀다가 화가 나서 질문게시판 봄;; def get_tpv..

n = '0b' + input() n = oct(int(n, 2))[2:] print(n)

n, score, p = map(int, input().split()) if n == 0: print(1) else: scores = list(map(int, input().split())) scores.append(score) scores.sort(reverse=True) idx = scores.index(score) # print(scores) if n==p and scores[-1] >= score: print(-1) else: print(idx+1)