아기개발자의 개발이야기

t=int(input()) for _ in range(t): x,y=map(int,input().split()) a=y-x cnt=0 m=1 s=0 while s

t=int(input()) for _ in range(t): x,y=map(int,input().split()) a=y-x cnt=0 m=1 s=0 while s

k,n=map(int,input().split()) a=[] for _ in range(k): a.append(int(input())) end=max(a) start=1 while start=n: start=mid+1 else: end = mid-1 print(end)

from collections import deque import copy def bfs(): queue=deque() gr=copy.deepcopy(g) global res for i in range(n): for j in range(m): if gr[i][j]==2: queue.append((i,j)) 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 gr[nx][ny]==0: gr[nx][ny]=2 queue.append((nx,ny)) cnt=0 for e in range(n): for f in range(m): if gr[e][f]==0: cnt+=1 re..

def prime(n): if n==1: return False for i in range(2,int(n**(1/2))+1): if n%i==0: return False return True t= int(input()) for _ in range(t): n=int(input()) a=n//2 for i in range(a,1,-1): if prime(n-i) and prime(i): print(i,n-i) break

def dis(x): for i in range(x): if row[i]==row[x] or abs(row[i]-row[x])==abs(x-i): return False return True def sol(x): global cnt if x==n: cnt+=1 return else: for i in range(n): #퀸의 위치 = (x,i) row[x]=i if dis(x): sol(x+1) n=int(input()) row=[0]*n cnt=0 sol(0) print(cnt)

while True: a=input() flag = True arr=[] if a==".": break for i in a: if i =="(" or i =="[": arr.append(i) elif i==")": if not arr or arr[-1]=="[": flag=False break elif arr[-1]=="(": arr.pop() elif i=="]": if not arr or arr[-1]=="(": flag=False break elif arr[-1]=="[": arr.pop() if not arr and flag: print("yes") else: print("no")

n1=int(input()) n=list(map(int,input().split())) n2=int(input()) m=list(map(int,input().split())) hash={} for i in n: if i in hash: hash[i]+=1 else: hash[i]=1 for i,j in enumerate(m): if j in hash: if i!=n2-1: print(str(hash[j]), end=' ') else: print(str(hash[j])) else: if i!=n2-1: print("0",end=" ") else: print("0")

def dfs(start): if len(a)==m: print(" ".join(map(str, a))) return for i in range(start,n+1): a.append(i) dfs(i) a.pop() n,m=map(int,input().split()) a=[] dfs(1)

def dfs(): if len(a)==m: print(" ".join(map(str,a))) return for i in range(n): a.append(i+1) dfs() a.pop() n,m=map(int,input().split()) a=[] dfs()