아기개발자의 개발이야기

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()

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