아기개발자의 개발이야기

a=input().split("-") arr=[] for i in a: s=0 b=i.split("+") for j in b: s+=int(j) arr.append(s) x=arr[0] for k in range(1,len(arr)): x-=arr[k] print(x)

a=input().split("-") arr=[] for i in a: s=0 b=i.split("+") for j in b: s+=int(j) arr.append(s) x=arr[0] for k in range(1,len(arr)): x-=arr[k] print(x)

n=int(input()) a=[] b=[] dp=[] for _ in range(n): x,y=map(int,input().split()) a.append(x) b.append(y) dp.append(y) dp.append(0) for i in range(n-1,-1,-1): if i+a[i]>n: dp[i]=dp[i+1] else: dp[i]=max(dp[i+1], b[i]+dp[i+a[i]]) print(dp[0])

t = int(input()) for _ in range(t): n,k=map(int,input().split()) a=list((map(int,input().split()))) b=[x for x in range(n)] cnt=0 b[k]="*" while True: if a[0]==max(a): cnt+=1 if b[0]=="*": print(cnt) break else: a.pop(0) b.pop(0) else: a.append(a.pop(0)) b.append(b.pop(0))

n,k=map(int,input().split()) a=list(map(int,input().split())) start=1 end=max(a) while startmid: s+=i-mid if s>=k: start=mid+1 elif s

def sol(depth, total, plus,minus, multi,divide): global maximum,minimum if depth==n: maximum=max(maximum, total) minimum=min(minimum,total) return if plus: sol(depth+1,total+arr[depth],plus-1,minus,multi,divide) if minus: sol(depth+1,total-arr[depth], plus,minus-1,multi,divide) if multi: sol(depth+1,total*arr[depth],plus,minus,multi-1,divide) if divide: sol(depth+1,int(total/arr[depth]),plus,min..

dfs def dfs(v): for j in g[v]: if visited[j]: continue visited[j]=1 dfs(j) n,m = map(int,input().split()) g=[[] for _ in range(n+1)] cnt=0 visited = [0]*(n+1) for i in range(m): a,b= map(int,input().split()) g[a].append(b) g[b].append(a) for i in range(1,n+1): if not visited[i]: dfs(i) cnt+=1 print(cnt)

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

a=[1]*246913 a[0]=0 a[1]=0 for i in range(2,246913): if a[i]==0: continue for j in range(2,246912//i+1): a[i*j]=0 while True: cnt=0 n=int(input()) if n==0: break for i in range(n+1,2*n+1): if a[i]==1: cnt+=1 print(cnt)

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