아기개발자의 개발이야기

n= int(input()) a=list(map(int,input().split())) dp=[0]*(n) for i in range(n): for j in range(i): if dp[i]a[j]: dp[i]=dp[j] dp[i]+=1 print(max(dp))

from collections import deque def bfs(): queue=deque() queue.append(n) while queue: a=queue.popleft() if a==k: print(arr[a]) break for na in (a-1,a+1,a*2): if 0

n=int(input()) a=[] for _ in range(n): a.append(list(map(int,input().split()))) a.sort(key=lambda x:(x[1],x[0])) end=a[0][1] cnt=1 for i in range(1,n): if a[i][0]>=end: end = a[i][1] cnt+=1 print(cnt)

from collections import deque t=int(input()) dx=[1,-1,0,0] dy=[0,0,1,-1] def bfs(graph,x,y): graph[x][y]=0 queue=deque() queue.append((x,y)) while queue: x,y = queue.popleft() for i in range(4): nx=x+dx[i] ny=y+dy[i] if nx>=n or nx

n=int(input()) arr=[] for _ in range(n): arr.append(list(map(int,input().split()))) for i in range(1,n): arr[i][0]+=min(arr[i-1][1],arr[i-1][2]) arr[i][1]+=min(arr[i-1][0], arr[i-1][2]) arr[i][2]+=min(arr[i-1][1],arr[i-1][0]) print(min(arr[n-1][0],arr[n-1][1],arr[n-1][2])) 규칙 찾아서 점화식 만들고 그대로 코드로

from collections import deque n,k,s=map(int,input().split()) arr=[[] for t in range(n+1)] for _ in range(k): a,b=map(int,input().split()) arr[a].append(b) arr[b].append(a) visited=[0]*(n+1) visited2=[0]*(n+1) def dfs(st): visited[st]=1 print(st,end=" ") arr[st].sort() for i in arr[st]: if visited[i]==0: dfs(i) def bfs(sta): visited2[sta]=1 queue = deque() queue.append(sta) while queue: w=queue.p..

bfs from collections import deque n= int(input()) board= [] cnt=0 cntarr=[] for i in range(n): board.append(list(map(int, input()))) def bfs(graph,x,y): global cnt dx=[-1,1,0,0] dy=[0,0,-1,1] queue=deque() queue.append((x,y)) cnt=1 while queue: x,y=queue.popleft() graph[x][y]=0 for j in range(4): nx=x+dx[j] ny=y+dy[j] if nx=n or ny=n: continue if graph[nx][ny]==1: graph[nx][ny]=0 queue.append((n..

from collections import deque n=int(input()) e=int(input()) arr=[[] for x in range(n+1)] for _ in range(e): a,b=map(int,input().split()) arr[a].append(b) arr[b].append(a) cnt=0 visited=[0]*(n+1) def bfs(s): global cnt visited[s]=1 queue=deque() queue.append(s) while queue: for i in arr[queue.pop()]: if visited[i]==0: queue.appendleft(i) visited[i]=1 cnt+=1 bfs(1) print(cnt)

from collections import deque n,m=map(int,input().split()) graph=[] for _ in range(n): graph.append(list(map(int,input()))) def bfs(x,y): dx =[-1,1,0,0 ] dy=[0,0,1,-1] queue = deque() queue.append((x,y)) while queue: x,y=queue.popleft() for i in range(4): nx=x+dx[i] ny=y+dy[i] if nx=n or ny=m: continue if graph[nx][ny]==1: graph[nx][ny]=graph[x][y]+1 queue.append((nx,ny)) return graph[n-1][m-1] ..

t=int(input()) dp=[0]*11 dp[1]=1 dp[2]=2 dp[3]=4 for i in range(4,11): dp[i] = dp[i-1]+dp[i-2]+dp[i-3] for _ in range(t): n=int(input()) print(dp[n]) 직접 구해봐서 점화식을 찾는다