아기개발자의 개발이야기

t=int(input()) for _ in range(t): n=int(input()) a=[1,0,1] b=[0,1,1] for i in range(3,41): a.append(a[i-1]+a[i-2]) b.append(b[i-1]+b[i-2]) print(a[n], b[n])

n,k = map(int, input().split()) a=[] cnt=0 for _ in range(n): a.append(int(input())) a.sort(reverse=True) for i in range(n): cnt+= k//a[i] k%=a[i] print(cnt)

n,m=map(int, input().split()) a=[1]*(m+1) a[0]=0 a[1]=0 for i in range(2,m+1): for j in range(2,m//i+1): if a[i]==1: a[i*j]=0 for k in range(1,m+1): if a[k]==1 and k>=n: print(k)

n=int(input()) a= list(map(int,input().split())) a.sort() sum=0 for i in range(n): sum+=a[i]*(n-i) print(sum)

n=int(input()) dp=[0]*(n+1) for i in range(2,n+1): dp[i]=dp[i-1]+1 if i%2==0: dp[i]=min(dp[i],dp[i//2]+1) if i%3==0: dp[i]=min(dp[i],dp[i//3]+1) print(dp[n])

n = int(input()) for _ in range(n): a=input() sum=0 for i in range(len(a)): if a[i]=="(": sum+=1 else: sum-=1 if sum0: print("NO") elif sum==0: print("YES")

a=[] n,k=map(int,input().split()) for p in range(n): a.append(list(map(int,input().split()))) a.sort(key=lambda x:(-x[1],-x[2],-x[3])) for j in range(n): if a[j][0]==k: index=j for i in range(n): if a[i][1:]== a[index][1:]: print(i+1) break 자꾸만 실수 했던 문제.... sort는 역순으로 해야하며 k와 같은index를 찾아서 index와 금은동개수가 같은 것을 순차적으로 탐색해서 출력

n=int(input()) if n%2==0: print("SK") else: print("CY")

from collections import deque n= int(input()) a=deque() b=[] for i in range(1,n+1): a.append(i) while len(a)>1: b.append(a.popleft()) a.append(a.popleft()) for j in range(len(b)): print(b[j],end=" ") print(a[0])

n= int(input()) arr=[] for i in range(n): a,b=map(str,input().split()) if b=="enter": arr.append(a) else: del arr[arr.index(a)] arr.sort(reverse=True) for j in range(len(arr)): print(arr[j])