s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s046969740 | p02271 | u255317651 | 1525342426 | Python | Python3 | py | Runtime Error | 0 | 0 | 921 |
# -*- coding: utf-8 -*-
"""
Created on Wed May 2 21:28:06 2018
ALDS1_5a_r2 Time Limit Exceeded
@author: maezawa
"""
n = int(input())
a = list(map(int, input().split()))
q = int(input())
m_array = list(map(int, input().split()))
can_c_array = [[None for _ in range(q)] for _ in range(n)]
def can_comp(i, m): #i番目以降の数列をつかってmを作れるか？
if m == 0:
return True
elif i == n:
return False
else:
if can_c_array[i+1][m] == None:
c1 = can_comp(i+1, m)
can_c_array[i+1][m] = c1
else:
c1 = can_c_array[i+1][m]
if can_c_array[i+1][m-a[i]] == None:
c2 = can_comp(i+1, m-a[i])
can_c_array[i+1][m-a[i]] = c2
else:
c2 = can_c_array[i+1][m-a[i]]
return c1 or c2
for m in m_array:
if can_comp(0, m):
print('yes')
else:
print('no')
|
s105386352 | p02271 | u126478680 | 1525348371 | Python | Python3 | py | Runtime Error | 7980 | 5612 | 426 | n = int(input())
A = list(map(int, input().split(' ')))
q = int(input())
M = list(map(int, input().split(' ')))
def rec(i, sum, m):
if i == n:
if sum == m:
return True
else:
return False
if sum > m:
return False
rst = rec(i+1, sum, m) or rec(i+1, sum + A[i], m)
return rst
for m in M:
if rec(0, 0, m):
print('yes')
else:
print('no')
|
s520652891 | p02271 | u126478680 | 1525356541 | Python | Python3 | py | Runtime Error | 10000 | 5608 | 401 | n = int(input())
A = list(map(int, input().split(' ')))
q = int(input())
M = list(map(int, input().split(' ')))
def rec(i, sum, m):
if sum == m:
return True
elif sum > m:
return False
if i >= n:
return False
rst = rec(i+1, sum, m) or rec(i+1, sum + A[i], m)
return rst
for m in M:
if rec(0, 0, m):
print('yes')
else:
print('no')
|
s661483592 | p02271 | u126478680 | 1525357165 | Python | Python3 | py | Runtime Error | 9570 | 5612 | 403 | n = int(input())
A = sorted(map(int, input().split(' ')))
q = int(input())
M = list(map(int, input().split(' ')))
def rec(i, sum, m):
if sum == m:
return True
elif sum > m:
return False
if i >= n:
return False
rst = rec(i+1, sum, m) or rec(i+1, sum + A[i], m)
return rst
for m in M:
if rec(0, 0, m):
print('yes')
else:
print('no')
|
s683892189 | p02271 | u126478680 | 1525357669 | Python | Python3 | py | Runtime Error | 8070 | 5612 | 341 | n = int(input())
A = list(map(int, input().split(' ')))
q = int(input())
M = list(map(int, input().split(' ')))
def rec(i, m):
if m == 0:
return True
if i >= n:
return False
rst = rec(i+1, m - A[i]) or rec(i+1, m)
return rst
for m in M:
if rec(0, m):
print('yes')
else:
print('no')
|
s579889343 | p02271 | u255317651 | 1525432279 | Python | Python3 | py | Runtime Error | 13910 | 5916 | 987 |
# -*- coding: utf-8 -*-
"""
Created on Wed May 2 21:28:06 2018
ALDS1_5a_r2 Time Limit Exceeded
@author: maezawa
"""
n = int(input())
a = list(map(int, input().split()))
q = int(input())
m_array = list(map(int, input().split()))
m_max = max(m_array)
can_c_array = [[None for _ in range(m_max+1)] for _ in range(n+1)]
def can_comp(i, m): #i番目以降の数列をつかってmを作れるか？
#print(i,m)
global n
global a
global can_c_array
if m == 0:
can_c_array[i][m] = True
return True
if i >= n:
can_c_array[i][m] = False
return False
if can_c_array[i][m] != None:
return can_c_array[i][m]
elif can_comp(i+1,m):
can_c_array[i][m] = True
elif m-a[i] >= 0:
if can_comp(i+1,m-a[i]):
can_c_array[i][m] = True
else:
can_c_array[i][m] = False
return can_c_array[i][m]
for m in m_array:
if can_comp(0, m):
print('yes')
else:
print('no')
|
s645133288 | p02271 | u011621222 | 1525965307 | Python | Python3 | py | Runtime Error | 20 | 5596 | 451 | n=int(input())
A=[int(x) for x in input().split()]
q=int(input())
M=[int(x) for x in input().split()]
def solve(m,AA):
if len(AA)==0:
return False
if m in AA:
return True
else:
for i in range(len(AA)):
if solve(m-AA[i],AA[:i]+AA[i+1:]):
return True
break
return False
for m in M:
if solve(m,A):
print('yes')
else:
print('no')
|
s285677990 | p02271 | u011621222 | 1525966807 | Python | Python3 | py | Runtime Error | 7220 | 5620 | 437 | import sys
sys.setrecursionlimit(100000) # set the maximum depth as 10000
n=int(input())
A=[int(x) for x in input().split()]
q=int(input())
M=[int(x) for x in input().split()]
def solve(i,m):
global n
global A
if m==0:
return True
if i>=n:
return False
return solve(i+1,m) or solve(i+1,m-A[i])
for m in M:
if solve(0,m):
print('yes')
else:
print('no')
|
s499022099 | p02271 | u088372268 | 1526197920 | Python | Python3 | py | Runtime Error | 8500 | 5612 | 442 | N = int(input())
A = list(map(int, input().split()))
def make_m(i, m):
if m == 0:
return True
if i >= N or m < 0:
return False
return make_m(i+1, m) or make_m(i+1, m-A[i])
def main():
q = int(input())
m_lst = list(map(int, input().split()))
for i in range(q):
if make_m(0, m_lst[i]):
print("yes")
else:
print("no")
if __name__ == '__main__':
main()
|
s636725703 | p02271 | u113295414 | 1526910929 | Python | Python3 | py | Runtime Error | 7510 | 5612 | 453 | n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
# リストi番目以降の数字を足して、jが作れるかどうかを判定する関数を定義
def judge(i, j):
if j == 0:
return True
elif i >= n:
return False
else:
return judge(i + 1, j) or judge(i + 1, j - A[i])
for m in M:
if judge(0, m):
print('yes')
else:
print('no')
|
s868898467 | p02271 | u408444038 | 1527062396 | Python | Python3 | py | Runtime Error | 10590 | 5656 | 349 | import itertools as it
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
A.sort()
for h in range(q):
cnt=0
for i in range(n):
for j in it.combinations(A,i):
if sum(j)==m[h]:
cnt = 1
if cnt==1:
print("yes")
else:
print("no")
|
s080817728 | p02271 | u408444038 | 1527062496 | Python | Python3 | py | Runtime Error | 11260 | 5656 | 340 | import itertools as it
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
for h in range(q):
cnt=0
for i in range(n):
for j in it.combinations(A,i):
if sum(j)==m[h]:
cnt = 1
if cnt==1:
print("yes")
else:
print("no")
|
s937917453 | p02271 | u408444038 | 1527062672 | Python | Python3 | py | Runtime Error | 10780 | 5652 | 349 | import itertools as it
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
A.sort()
for h in range(q):
cnt=0
for i in range(n):
for j in it.combinations(A,i):
if sum(j)==m[h]:
cnt = 1
if cnt==1:
print("yes")
else:
print("no")
|
s111005309 | p02271 | u848218390 | 1527062822 | Python | Python3 | py | Runtime Error | 8020 | 5656 | 369 | import itertools as itl
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
for mi in M:
flg = False
for i in range(len(A)):
C = itl.combinations(A, i)
for j in C:
if sum(j) == mi:
flg = True
break
if flg: print("yes")
else: print("no")
|
s905758796 | p02271 | u848218390 | 1527063025 | Python | Python3 | py | Runtime Error | 0 | 0 | 386 | import itertools as itl
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
for mi in M:
flg = False
for i in range(len(A)):
C = itl.combinations_with_replacemant(A, i)
for j in C:
if sum(j) == mi:
flg = True
break
if flg: print("yes")
else: print("no")
|
s799042271 | p02271 | u408444038 | 1527063027 | Python | Python3 | py | Runtime Error | 9210 | 5652 | 384 | import itertools as it
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
A.sort()
for h in range(q):
cnt=0
for i in range(n):
for j in it.combinations(A,i):
if sum(j)==m[h]:
cnt = 1
break
if cnt==1:
print("yes")
else:
print("no")
|
s220367170 | p02271 | u408444038 | 1527063099 | Python | Python3 | py | Runtime Error | 8130 | 5652 | 421 | import itertools as it
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
A.sort()
for h in range(q):
cnt=0
for i in range(n):
if cnt==1:
break
for j in it.combinations(A,i):
if sum(j)==m[h]:
cnt = 1
break
if cnt==1:
print("yes")
else:
print("no")
|
s023749328 | p02271 | u408444038 | 1527063212 | Python | Python3 | py | Runtime Error | 8240 | 5660 | 412 | import itertools as it
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
for h in range(q):
cnt=0
for i in range(n):
if cnt==1:
break
for j in it.combinations(A,i):
if sum(j)==m[h]:
cnt = 1
break
if cnt==1:
print("yes")
else:
print("no")
|
s858384987 | p02271 | u848218390 | 1527063293 | Python | Python3 | py | Runtime Error | 7770 | 5652 | 369 | import itertools as itl
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
for mi in M:
flg = False
for i in range(len(A)):
C = itl.combinations(A, i)
for j in C:
if sum(j) == mi:
flg = True
break
if flg: print("yes")
else: print("no")
|
s383646427 | p02271 | u848218390 | 1527063751 | Python | Python3 | py | Runtime Error | 7840 | 5652 | 387 | import itertools as itl
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
for mi in M:
flg = False
for i in range(len(A)):
C = itl.combinations(A, i)
#print(C)
for j in C:
if sum(j) == mi:
flg = True
break
if flg: print("yes")
else: print("no")
|
s069220070 | p02271 | u408444038 | 1527063919 | Python | Python3 | py | Runtime Error | 7710 | 5656 | 415 | import itertools as it
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
A.sort()
for h in range(q):
cnt=0
for i in range(n-1,0,-1):
if cnt==1:
break
for j in it.combinations(A,i):
if sum(j)==m[h]:
cnt = 1
break
if cnt==1:
print("yes")
else:
print("no")
|
s401584859 | p02271 | u408444038 | 1527064266 | Python | Python3 | py | Runtime Error | 0 | 0 | 456 | import itertools as it
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
A.sort()
for h in range(q):
cnt=0
if m[q] > sum(A):
break
for i in range(n-1,0,-1):
if cnt==1:
break
for j in it.combinations(A,i):
if sum(j)==m[h]:
cnt = 1
break
if cnt==1:
print("yes")
else:
print("no")
|
s718945856 | p02271 | u408444038 | 1527064787 | Python | Python3 | py | Runtime Error | 10690 | 5656 | 349 | import itertools as it
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
A.sort()
for h in range(q):
cnt=0
for i in range(n):
for j in it.combinations(A,i):
if sum(j)==m[h]:
cnt = 1
if cnt==1:
print("yes")
else:
print("no")
|
s073282318 | p02271 | u408444038 | 1527064829 | Python | Python3 | py | Runtime Error | 10720 | 5652 | 351 | import itertools as it
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
A.sort()
for h in range(q):
cnt=0
for i in range(n+1):
for j in it.combinations(A,i):
if sum(j)==m[h]:
cnt = 1
if cnt==1:
print("yes")
else:
print("no")
|
s067221397 | p02271 | u564464686 | 1527065499 | Python | Python3 | py | Runtime Error | 5790 | 13540 | 579 | import itertools
n=int(input())
A=[0 for i in range(n)]
A=input().split()
for i in range(n):
A[i]=int(A[i])
q=int(input())
B=[0 for i in range(q)]
B=input().split()
C=[]
for i in range(q):
B[i]=int(B[i])
l=[0,1]
p=[]
k=0
D=[]
for v in itertools.product(l,repeat=n):
sum=0
for i in range(n):
if v[i]==1:
sum=sum+A[i]
D.append(sum)
k+=1
for i in range(q):
c=0
for j in range(k):
if B[i]==D[j] and c==0:
C.append("yes")
c+=1
if c==0:
C.append("no")
for i in range(q):
print(C[i])
|
s811018096 | p02271 | u564464686 | 1527065685 | Python | Python3 | py | Runtime Error | 6000 | 13540 | 578 | import itertools
n=int(input())
A=[0 for i in range(n)]
A=input().split()
for i in range(n):
A[i]=int(A[i])
q=int(input())
B=[0 for i in range(q)]
B=input().split()
C=[]
for i in range(q):
B[i]=int(B[i])
l=[0,1]
p=[]
k=0
D=[]
for v in itertools.product(l,repeat=n):
sum=0
for i in range(n):
if v[i]==1:
sum=sum+A[i]
D.append(sum)
k+=1
for i in range(q):
c=0
for j in range(k):
if B[i]==D[j] and c==0:
C.append("yes")
c+=1
if c==0:
C.append("no")
for i in range(q):
print(C[i])
|
s781530870 | p02271 | u564464686 | 1527065907 | Python | Python3 | py | Runtime Error | 6760 | 13548 | 600 | import itertools
n=int(input())
A=[0 for i in range(n)]
A=input().split()
for i in range(n):
A[i]=int(A[i])
q=int(input())
B=[0 for i in range(q)]
B=input().split()
C=[]
for i in range(q):
B[i]=int(B[i])
l=[0,1]
p=[]
k=0
D=[]
for v in itertools.product(l,repeat=n):
sum=0
for i in range(n):
if v[i]==1:
sum=sum+A[i]
D.append(sum)
k+=1
for i in range(q):
c=0
j=0
while c==0 and j<k:
if B[i]==D[j] and c==0:
C.append("yes")
c+=1
j+=1
if c==0:
C.append("no")
for i in range(q):
print(C[i])
|
s283010129 | p02271 | u564464686 | 1527066255 | Python | Python3 | py | Runtime Error | 7060 | 13544 | 600 | import itertools
n=int(input())
A=[0 for i in range(n)]
A=input().split()
for i in range(n):
A[i]=int(A[i])
q=int(input())
B=[0 for i in range(q)]
B=input().split()
C=[]
for i in range(q):
B[i]=int(B[i])
l=[0,1]
p=[]
k=0
D=[]
for v in itertools.product(l,repeat=n):
sum=0
for i in range(n):
if v[i]==1:
sum=sum+A[i]
D.append(sum)
k+=1
for i in range(q):
c=0
j=0
while c==0 and j<k:
if B[i]==D[j] and c==0:
C.append("yes")
c+=1
j+=1
if c==0:
C.append("no")
for i in range(q):
print(C[i])
|
s598836421 | p02271 | u564464686 | 1527066443 | Python | Python3 | py | Runtime Error | 7060 | 13548 | 600 | import itertools
n=int(input())
A=[0 for i in range(n)]
A=input().split()
for i in range(n):
A[i]=int(A[i])
q=int(input())
B=[0 for i in range(q)]
B=input().split()
C=[]
for i in range(q):
B[i]=int(B[i])
l=[0,1]
p=[]
k=0
D=[]
for v in itertools.product(l,repeat=n):
sum=0
for i in range(n):
if v[i]==1:
sum=sum+A[i]
D.append(sum)
k+=1
for i in range(q):
c=0
j=0
while c==0 and j<k:
if B[i]==D[j] and c==0:
C.append("yes")
c+=1
j+=1
if c==0:
C.append("no")
for i in range(q):
print(C[i])
|
s665953244 | p02271 | u848218390 | 1527067432 | Python | Python3 | py | Runtime Error | 8610 | 5652 | 385 | import itertools as itl
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
for mi in M:
flg = False
for i in range(n):
C = itl.combinations(A, i+1)
#print(C)
for j in C:
if sum(j) == mi:
flg = True
break
if flg: print("yes")
else: print("no")
|
s921109654 | p02271 | u848218390 | 1527067577 | Python | Python3 | py | Runtime Error | 8930 | 5652 | 406 | import itertools as itl
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
for mi in M:
flg = False
for i in range(n):
C = itl.combinations(A, i+1)
#print(C)
for j in C:
if sum(j) == mi:
flg = True
break
if flg: break
if flg: print("yes")
else: print("no")
|
s046373020 | p02271 | u848218390 | 1527068422 | Python | Python3 | py | Runtime Error | 6880 | 5656 | 389 | import itertools as itl
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
for mi in M:
flg = False
for i in range(n):
C = itl.combinations(A, i+1)
for j in C:
if sum(j) == mi:
flg = True
break
if flg: break
if flg: print("yes")
else: print("no")
|
s220299271 | p02271 | u398978447 | 1527069444 | Python | Python3 | py | Runtime Error | 0 | 0 | 374 | n=int(input())
A=[int(j) for j in input().split()]
m=int(input())
B=[int(j) for j in input().split()]
ans=[0 for i in range(n)]
C=[0 for i in range(n)]
for i in range(0,m+1):
for j in range(i+1,m+1):
if i==j:
break
ans=A[i]+A[j]
C.append(ans)
for i in range(m):
if B[i] in C:
print("yes")
else:
print("no")
|
s240640507 | p02271 | u848218390 | 1527071100 | Python | Python3 | py | Runtime Error | 9680 | 5660 | 387 | import itertools as itl
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
C = [False for i in range(q)]
for i in range(1, n+1):
for j in itl.combinations(A, i):
for mi in range(q):
if sum(j) == M[mi]:
C[mi] = True
for c in C:
if c: print("yes")
else: print("no")
|
s219354005 | p02271 | u843517396 | 1527099297 | Python | Python3 | py | Runtime Error | 3630 | 18500 | 455 | #coading Shift_JIS
import itertools
n=int(input())
str=input().split()
A=[0 for i in range(n)]
for i in range(n):
A[i]=int(str[i])
q=int(input())
m=[0 for i in range(q)]
str=input().split()
for i in range(q):
m[i]=int(str[i])
cn=n
while cn>0:
l=list(itertools.combinations(A,cn))
for j in l:
sum=0
for k in j:
sum+=k
for cnt in range(q):
if sum==m[cnt]:
m[cnt]=-1
cn-=1
for i in range(q):
if m[i]>0: print("no")
else: print("yes")
|
s034045137 | p02271 | u843517396 | 1527101077 | Python | Python3 | py | Runtime Error | 0 | 0 | 365 | #coading Shift_JIS
import numpy as np
n=int(input())
str=input().split()
A=np.zeros(n)
for i in range(n):
A[i]=int(str[i])
q=int(input())
m=np.zeros(q)
str=input().split()
def solve(i,m):
if m==0: return 1
if i>=n: return 0
res=solve(i+1,m) or solve(i+1,m-A[i])
return res
for i in range(q):
m=int(str[i])
if solve(0,m)==1: print("yes")
else: print("no")
|
s261444500 | p02271 | u843517396 | 1527101138 | Python | Python3 | py | Runtime Error | 7570 | 5612 | 366 | #coading Shift_JIS
n=int(input())
str=input().split()
A=[0 for i in range(n)]
for i in range(n):
A[i]=int(str[i])
q=int(input())
m=[0 for i in range(q)]
str=input().split()
def solve(i,m):
if m==0: return 1
if i>=n: return 0
res=solve(i+1,m) or solve(i+1,m-A[i])
return res
for i in range(q):
m=int(str[i])
if solve(0,m)==1: print("yes")
else: print("no")
|
s669680245 | p02271 | u063056051 | 1527159452 | Python | Python3 | py | Runtime Error | 0 | 0 | 398 |
n=int(input())
list1=map(int,input().split())
q=int(input())
list2=map(int,input().split())
for i in range(len(list2)):
list3=[]
ok=0
for j in range(len(list1)):
if list2[i]<list1[j]:
list3.append(list1[j])
for k in range(len(list3)-1):
if ok==1:
break
for l in range(1,len(list3)):
if list3[k]+list3[l]==list2[i]:
print("yes")
ok=1
break
if ok==0:
print("no")
|
s075674058 | p02271 | u063056051 | 1527161990 | Python | Python3 | py | Runtime Error | 12980 | 21000 | 408 |
import itertools
n=int(input())
list1=[int(x) for x in input().split()]
q=int(input())
list2=[int(x) for x in input().split()]
for i in range(len(list2)):
ok=0
for j in range(1,len(list1)):
if ok==1:
break
list3=list(itertools.combinations(list1,j))
for k in range(len(list3)):
if ok==1:
break
if sum(list3[k])==list2[i]:
print("yes")
ok=1
break
if ok==0:
print("no")
|
s016216421 | p02271 | u217703215 | 1527217942 | Python | Python3 | py | Runtime Error | 8560 | 5612 | 400 | def solve(i,m):
if m==0:
return True
if i>=n:
return False
res=solve(i+1,m) or solve(i+1,m-A[i])
return res
n=int(input())
A=[]*n
A=list(input().split())
for i in range(n):
A[i]=int(A[i])
m=int(input())
B=list(input().split())
ans=[]
for i in range(m):
B[i]=int(B[i])
ans=solve(0,B[i])
if ans==True:
print("yes")
else:
print("no")
|
s924935408 | p02271 | u217703215 | 1527218329 | Python | Python3 | py | Runtime Error | 7690 | 5612 | 400 | def solve(i,m):
if m==0:
return True
if i>=n:
return False
res=solve(i+1,m) or solve(i+1,m-A[i])
return res
n=int(input())
A=[]*n
A=list(input().split())
for i in range(n):
A[i]=int(A[i])
m=int(input())
B=list(input().split())
ans=[]
for i in range(m):
B[i]=int(B[i])
ans=solve(0,B[i])
if ans==True:
print("yes")
else:
print("no")
|
s194928832 | p02271 | u217703215 | 1527301872 | Python | Python3 | py | Runtime Error | 8230 | 5612 | 401 | def solve(i,m):
if m==0:
return True
if i>=n:
return False
res=solve(i+1,m) or solve(i+1,m-A[i])
return res
n=int(input())
A=[]*n
A=list(input().split())
for i in range(n):
A[i]=int(A[i])
m=int(input())
B=list(input().split())
ans=[]
for i in range(m):
B[i]=int(B[i])
ans=solve(0,B[i])
if ans==True:
print("yes")
else:
print("no")
|
s297390120 | p02271 | u848218390 | 1527308335 | Python | Python3 | py | Runtime Error | 7150 | 5652 | 374 | import itertools as itl
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
for mi in M:
flg = False
for i in range(n):
for j in itl.combinations(A, i+1):
if sum(j) == mi:
flg = True
break
if flg: break
if flg: print("yes")
else: print("no")
|
s345491173 | p02271 | u848218390 | 1527310042 | Python | Python3 | py | Runtime Error | 6970 | 5612 | 369 | def solve(A, n, i, m):
if m == 0:
return True
if i >= n:
return False
res = solve(A, n, i+1, m) or solve(A, n, i+1, m-A[i])
return res
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
for m in M:
if solve(A, len(A), 0, m):
print("yes")
else:
print("no")
|
s952538629 | p02271 | u848218390 | 1527311508 | Python | Python3 | py | Runtime Error | 9330 | 14928 | 381 | import itertools as itl
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
for mi in M:
flg = False
for i in range(n):
for j in list(itl.combinations(A, i+1)):
if sum(j) == mi:
flg = True
break
if flg: break
if flg: print("yes")
else: print("no")
|
s388028671 | p02271 | u848218390 | 1527314672 | Python | Python3 | py | Runtime Error | 8960 | 14944 | 679 | import itertools as itl
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
S = []
"""通る(ko)
for i in range(n):
cmb = list(itl.combinations(A, i+1))
for j in cmb:
S.append(sum(j))
for m in M:
flg = False
for s in S:
if s == m:
flg = True
break
if flg:
print("yes")
else:
print("no")
"""
for mi in M:
flg = False
for i in range(n):
for j in list(itl.combinations(A, i+1)):
if sum(j) == mi:
flg = True
break
if flg: break
if flg: print("yes")
else: print("no")
|
s153853625 | p02271 | u938045879 | 1527323157 | Python | Python3 | py | Runtime Error | 7580 | 5616 | 370 | n = int(input())
a = list(map(int, input().split(' ')))
q = int(input())
M = list(map(int, input().split(' ')))
S = [0 for i in range(n)]
def solve(i, m):
if m==0 :
return True
if i>=n:
return False
res = solve(i+1, m) or solve(i+1, m-a[i])
return res
for j in M:
if solve(0, j):
print('yes')
else:
print('no')
|
s795743862 | p02271 | u938045879 | 1527323295 | Python | Python3 | py | Runtime Error | 7480 | 5608 | 343 | n = int(input())
a = list(map(int, input().split(' ')))
q = int(input())
M = list(map(int, input().split(' ')))
def solve(i, m):
if m==0 :
return True
if i>=n:
return False
res = solve(i+1, m) or solve(i+1, m-a[i])
return res
for j in M:
if solve(0, j):
print('yes')
else:
print('no')
|
s997333763 | p02271 | u938045879 | 1527323469 | Python | Python3 | py | Runtime Error | 0 | 0 | 419 | n = int(input())
a = list(map(int, input().split(' ')))
q = int(input())
M = list(map(int, input().split(' ')))
minA = min(a)
sumA = sum(a)
def solve(i, m):
if m==0 :
return True
if i>=n:
return False
res = solve(i+1, m) or solve(i+1, m-a[i])
return res
for j in M:
if j < minA or m>sumA:
print('no')
if solve(0, j):
print('yes')
else:
print('no')
|
s352297429 | p02271 | u938045879 | 1527323498 | Python | Python3 | py | Runtime Error | 0 | 0 | 445 | n = int(input())
a = list(map(int, input().split(' ')))
q = int(input())
M = list(map(int, input().split(' ')))
minA = min(a)
sumA = sum(a)
def solve(i, m):
if m==0 :
return True
if i>=n:
return False
res = solve(i+1, m) or solve(i+1, m-a[i])
return res
for j in M:
if j < minA or m>sumA:
print('no')
else:
if solve(0, j):
print('yes')
else:
print('no')
|
s784631266 | p02271 | u217703215 | 1527485125 | Python | Python3 | py | Runtime Error | 8130 | 5612 | 401 | def solve(i,m):
if m==0:
return True
if i>=n:
return False
res=solve(i+1,m) or solve(i+1,m-A[i])
return res
n=int(input())
A=[]*n
A=list(input().split())
for i in range(n):
A[i]=int(A[i])
m=int(input())
B=list(input().split())
ans=[]
for i in range(m):
B[i]=int(B[i])
ans=solve(0,B[i])
if ans==True:
print("yes")
else:
print("no")
|
s557998406 | p02271 | u405027099 | 1527489747 | Python | Python3 | py | Runtime Error | 7470 | 5612 | 381 | def solve(i,m):
if m==0:
return True
if i>=n:
return False
res=solve(i+1,m) or solve(i+1,m-A[i])
return res
n=int(input())
A=input().split()
q=int(input())
M=input().split()
ans=[]
for i in range(n):
A[i]=int(A[i])
for i in range(q):
M[i]=int(M[i])
ans=solve(0,M[i])
if ans==True:
print("yes")
else:
print("no")
|
s998095461 | p02271 | u733945366 | 1527491286 | Python | Python3 | py | Runtime Error | 7880 | 5612 | 376 | def solve(i,m):
if m==0:
return True;
if i>=n:
return False;
res=solve(i+1,m) or solve(i+1,m-a[i]);
return res;
n=int(input())
a=input().split()
q=int(input())
m=input().split()
ans=[]
for i in range(n):
a[i]=int(a[i])
for i in range(q):
m[i]=int(m[i])
ans=solve(0,m[i]);
if ans==True:
print("yes")
else:
print("no")
|
s010454582 | p02271 | u165447384 | 1527519170 | Python | Python3 | py | Runtime Error | 8100 | 5608 | 401 | def solve(i,m):
if m==0:
return True
if i>=n:
return False
res=solve(i+1,m) or solve(i+1,m-A[i])
return res
n=int(input())
A=[]*n
A=list(input().split())
for i in range(n):
A[i]=int(A[i])
m=int(input())
B=list(input().split())
ans=[]
for i in range(m):
B[i]=int(B[i])
ans=solve(0,B[i])
if ans==True:
print("yes")
else:
print("no")
|
s491479870 | p02271 | u165447384 | 1527519456 | Python | Python3 | py | Runtime Error | 0 | 0 | 431 | sys.setrecursionlimit(20000)
def solve(i,m):
if m==0:
return True
if i>=n:
return False
res=solve(i+1,m) or solve(i+1,m-A[i])
return res
n=int(input())
A=[]*n
A=list(input().split())
for i in range(n):
A[i]=int(A[i])
m=int(input())
B=list(input().split())
ans=[]
for i in range(m):
B[i]=int(B[i])
ans=solve(0,B[i])
if ans==True:
print("yes")
else:
print("no")
|
s873060896 | p02271 | u165447384 | 1527519604 | Python | Python3 | py | Runtime Error | 7840 | 5612 | 442 | import sys
sys.setrecursionlimit(20000)
def solve(i,m):
if m==0:
return True
if i>=n:
return False
res=solve(i+1,m) or solve(i+1,m-A[i])
return res
n=int(input())
A=[]*n
A=list(input().split())
for i in range(n):
A[i]=int(A[i])
m=int(input())
B=list(input().split())
ans=[]
for i in range(m):
B[i]=int(B[i])
ans=solve(0,B[i])
if ans==True:
print("yes")
else:
print("no")
|
s250315644 | p02271 | u165447384 | 1527519787 | Python | Python3 | py | Runtime Error | 9270 | 5612 | 477 | #import sys
#sys.setrecursionlimit(20000)
def solve(i,m):
if m==0:
return True
if m<0:
return False
if i>=n:
return False
res=solve(i+1,m) or solve(i+1,m-A[i])
return res
n=int(input())
A=[]*n
A=list(input().split())
for i in range(n):
A[i]=int(A[i])
m=int(input())
B=list(input().split())
ans=[]
for i in range(m):
B[i]=int(B[i])
ans=solve(0,B[i])
if ans==True:
print("yes")
else:
print("no")
|
s835725684 | p02271 | u165447384 | 1527520260 | Python | Python3 | py | Runtime Error | 0 | 0 | 440 | #import sys
#sys.setrecursionlimit(20000)
def solve(i,sum):
if i==n:
ans[sum] = 1
ans[sum+A[i]] = 1
solve(i+1,sum)
if sum+A[i] <=2000:
solve(i+1,sum+A[i])
n=int(input())
A=[]*n
A=list(input().split())
for i in range(n):
A[i]=int(A[i])
ans=[0]*2001
solve(0,0)
m=int(input())
B=list(input().split())
for i in range(m):
if ans[B[i]]==1:
print("yes")
else:
print("no")
|
s635624954 | p02271 | u165447384 | 1527520426 | Python | Python3 | py | Runtime Error | 0 | 0 | 436 | def solve(i,sum):
if i==n:
ans[sum] = 1
ans[sum+A[i]] = 1
solve(i+1,sum)
if sum+A[i] <= 2000:
solve(i+1,sum+A[i])
n=int(input())
A=[]*n
A=list(input().split())
for i in range(n):
A[i]=int(A[i])
ans=[0]*2001
solve(0,0)
m=int(input())
B=list(input().split())
for i in range(m):
B[i]=int(B[i])
for i in range(m):
if ans[B[i]]==1:
print("yes")
else:
print("no")
|
s916094183 | p02271 | u165447384 | 1527520495 | Python | Python3 | py | Runtime Error | 0 | 0 | 469 | def solve(i,sum):
if i==n:
ans[sum] = 1
if sum+A[i] <= 2000:
ans[sum+A[i]] = 1
solve(i+1,sum)
if sum+A[i] <= 2000:
solve(i+1,sum+A[i])
n=int(input())
A=[]*n
A=list(input().split())
for i in range(n):
A[i]=int(A[i])
ans=[0]*2001
solve(0,0)
m=int(input())
B=list(input().split())
for i in range(m):
B[i]=int(B[i])
for i in range(m):
if ans[B[i]]==1:
print("yes")
else:
print("no")
|
s405905992 | p02271 | u165447384 | 1527520563 | Python | Python3 | py | Runtime Error | 0 | 0 | 471 | def solve(i,sum):
if i==n-1:
ans[sum] = 1
if sum+A[i] <= 2000:
ans[sum+A[i]] = 1
solve(i+1,sum)
if sum+A[i] <= 2000:
solve(i+1,sum+A[i])
n=int(input())
A=[]*n
A=list(input().split())
for i in range(n):
A[i]=int(A[i])
ans=[0]*2001
solve(0,0)
m=int(input())
B=list(input().split())
for i in range(m):
B[i]=int(B[i])
for i in range(m):
if ans[B[i]]==1:
print("yes")
else:
print("no")
|
s053474554 | p02271 | u165447384 | 1527520787 | Python | Python3 | py | Runtime Error | 0 | 0 | 470 | def solve(j,sum):
if j==n-1:
ans[sum] = 1
if sum+A[j] <= 2000:
ans[sum+A[j]] = 1
solve(j+1,sum)
if sum+A[j] <= 2000:
solve(j+1,sum+A[j])
n=int(input())
A=[]*n
A=list(input().split())
for i in range(n):
A[i]=int(A[i])
ans=[0]*2001
solve(0,0)
m=int(input())
B=list(input().split())
for i in range(m):
B[i]=int(B[i])
for i in range(m):
if ans[B[i]]==1:
print("yes")
else:
print("no")
|
s766084197 | p02271 | u165447384 | 1527520888 | Python | Python3 | py | Runtime Error | 0 | 0 | 487 | def solve(j,sum):
print j, sum
if j==n-1:
ans[sum] = 1
if sum+A[j] <= 2000:
ans[sum+A[j]] = 1
solve(j+1,sum)
if sum+A[j] <= 2000:
solve(j+1,sum+A[j])
n=int(input())
A=[]*n
A=list(input().split())
for i in range(n):
A[i]=int(A[i])
ans=[0]*2001
solve(0,0)
m=int(input())
B=list(input().split())
for i in range(m):
B[i]=int(B[i])
for i in range(m):
if ans[B[i]]==1:
print("yes")
else:
print("no")
|
s520974890 | p02271 | u826549974 | 1527522378 | Python | Python3 | py | Runtime Error | 11870 | 5612 | 431 | def solve(i,m,n,A):
if(m == 0):
return 1
elif(i >= n):
return 0
res1 = solve(i+1,m,n,A)
res2 = solve(i+1,m-A[i],n,A)
if(res1 == 1 or res2 == 1):
return 1
else:
return 0
n = int(input())
A = list(map(int,input().split()))
q = int(input())
M = list(map(int,input().split()))
for i in range(q):
if(solve(0,M[i],n,A)):
print("yes")
else:
print("no")
|
s941736955 | p02271 | u826549974 | 1527522523 | Python | Python3 | py | Runtime Error | 15050 | 5616 | 348 | def solve(i,m,n,A):
if(m == 0):
return 1
elif(i >= n):
return 0
return max(solve(i+1,m,n,A),solve(i+1,m-A[i],n,A))
n = int(input())
A = list(map(int,input().split()))
q = int(input())
M = list(map(int,input().split()))
for i in range(q):
if(solve(0,M[i],n,A)):
print("yes")
else:
print("no")
|
s313189254 | p02271 | u165447384 | 1527558777 | Python | Python3 | py | Runtime Error | 9120 | 5612 | 444 | n = int(input())
A = list(input().split())
for i in range(n):
A[i] = int(A[i])
m = int(input())
B = list(input().split())
for i in range(m):
B[i] = int(B[i])
def solve(x,y):
if y<0:
return False
elif y==0:
return True
elif x==n:
return False
else:
return solve(x+1,y) or solve(x+1,y-A[x])
for i in range(m):
if solve(0,B[i]):
print("yes")
else:
print("no")
|
s894048403 | p02271 | u165447384 | 1527559172 | Python | Python3 | py | Runtime Error | 0 | 0 | 434 | n = int(input())
A = list(input().split())
for i in range(n):
A[i] = int(A[i])
m = int(input())
B = list(input().split())
for i in range(m):
B[i] = int(B[i])
def solve(x,y):
if x==n:
S[y] = 1
else:
solve(x+1,y)
if y+A[x] < 2001:
solve(x+1,y+A[x]
S = [0]*2001
solve(0,0)
for i in range(m):
if S[B[i]] == 1:
print("yes")
else:
print("no")
|
s381702926 | p02271 | u165447384 | 1527559215 | Python | Python3 | py | Runtime Error | 0 | 0 | 451 | n = int(input())
A = list(input().split())
for i in range(n):
A[i] = int(A[i])
m = int(input())
B = list(input().split())
for i in range(m):
B[i] = int(B[i])
def solve(x,y):
if x==n:
S[y] = 1
else:
solve(x+1,y)
if y+A[x] < 2001:
solve(x+1,y+A[x]
S = [0 for i in range(2001)]
solve(0,0)
for i in range(m):
if S[B[i]] == 1:
print("yes")
else:
print("no")
|
s651573128 | p02271 | u165447384 | 1527561981 | Python | Python3 | py | Runtime Error | 9470 | 5612 | 381 | n = int(input())
A = list(map(int,input().split()))
m = int(input())
B = list(map(int,input().split()))
def solve(x,y):
if y<0:
return False
elif y==0:
return True
elif x==n:
return False
else:
return solve(x+1,y) or solve(x+1,y-A[x])
for i in range(m):
if solve(0,B[i]):
print("yes")
else:
print("no")
|
s505532515 | p02271 | u165447384 | 1527562347 | Python | Python3 | py | Runtime Error | 8170 | 5632 | 710 | n = int(input())
A = list(map(int,input().split()))
m = int(input())
B = list(map(int,input().split()))
def solve2(x,y):
if x==n:
S[y] = 1
else:
solve2(x+1,y)
if y+A[x] < 2001:
solve2(x+1,y+A[x])
S = [0 for i in range(2001)]
solve2(0,0)
def solve(x,y):
if y<0:
return False
elif y==0:
return True
elif x==n:
return False
else:
return solve(x+1,y) or solve(x+1,y-A[x])
for i in range(m):
if (i>80 and (S[B[i]] == 1)):
print("yes")
elif (i>80 and (S[B[i]] == 0)):
print("no")
else:
if solve(0,B[i]):
print("yes")
else:
print("no")
|
s986683226 | p02271 | u055885332 | 1527575593 | Python | Python3 | py | Runtime Error | 0 | 0 | 331 | n=int (input())
A=list(map(int,input().split()))
q=int (input())
m=list(map(int,input().split()))
box=[]
for i in range(2**n):
b = '{0:0{1}b}'.format(i,n)
tmp=[]
for j in rangee(n):
if b[j]=='1':
if b[j]=='1':
tmp.append(A[j])
sum_list.append(box(tmp))
for k in m:
if k in box:
print("yes")
else:
print("no")
|
s301948881 | p02271 | u165447384 | 1527578090 | Python | Python3 | py | Runtime Error | 0 | 0 | 420 | n = int(input())
A = list(map(int,input().split()))
m = int(input())
B = list(map(int,input().split()))
T = [[0]*2001 for i in range(n)]
T[0][0] = 1
T[0][A[0]] = 1
for i in range(1:n):
for j in range(2001):
T[i][j] = T[i-1][j]
if (j - B[i] >=0) and (T[i-1][j-B[i]] == 1):
T[i][j] = 1
for i in range(m):
if T[n-1][B[i]] == 1:
print("yes")
else:
print("no")
|
s990367634 | p02271 | u810922275 | 1527588459 | Python | Python3 | py | Runtime Error | 0 | 0 | 384 | import numpy as np
def rec(x,y):
x.sort()
for i in range(len(x)):
if x[i]>y:
return "no"
for j in range(len(x)):
if i!=j:
if x[i]+x[j]==y:
return "yes"
n=int(input())
A=list(map(int,input().split(' ')))
p=int(input())
m=list(map(int,input().split(' ')))
for i in range(len(m)):
print(rec(A,m[i])
|
s244889579 | p02271 | u684241248 | 1527589393 | Python | Python3 | py | Runtime Error | 8670 | 5616 | 437 | n = int(input())
ary = [int(_) for _ in input().split()]
q = int(input())
qs = [int(_) for _ in input().split()]
def search(ary, s, q):
if not ary:
return False
else:
tmp = ary[0]
if s + tmp == q:
return True
else:
return search(ary[1:], s, q) or search(ary[1:], s + tmp, q)
for q in qs:
if search(ary, 0, q):
print('yes')
else:
print('no')
|
s525052591 | p02271 | u684241248 | 1527589540 | Python | Python3 | py | Runtime Error | 8870 | 5620 | 480 | import sys
sys.setrecursionlimit(2 ** 20)
n = int(input())
ary = [int(_) for _ in input().split()]
q = int(input())
qs = [int(_) for _ in input().split()]
def search(ary, s, q):
if not ary:
return False
else:
tmp = ary[0]
if s + tmp == q:
return True
else:
return search(ary[1:], s, q) or search(ary[1:], s + tmp, q)
for q in qs:
if search(ary, 0, q):
print('yes')
else:
print('no')
|
s912077493 | p02271 | u684241248 | 1527589890 | Python | Python3 | py | Runtime Error | 8070 | 5616 | 438 | n = int(input())
ary = [int(_) for _ in input().split()]
q = int(input())
qs = [int(_) for _ in input().split()]
def search(ind, s, q):
if ind == n:
return False
else:
tmp = ary[ind]
if s + tmp == q:
return True
else:
return search(ind + 1, s, q) or search(ind + 1, s + tmp, q)
for q in qs:
if search(0, 0, q):
print('yes')
else:
print('no')
|
s402521505 | p02271 | u398978447 | 1527599319 | Python | Python3 | py | Runtime Error | 7730 | 5616 | 458 |
class ES:
def solve(self, A, M):
for m in M:
if self.search(0, m):
print("yes")
else:
print("no")
def search(self, i, m):
if m == 0:
return True
elif i >= n:
return False
return self.search(i + 1, m) or self.search(i + 1, m - A[i])
if __name__ == '__main__':
n = int(input())
A = [int(i) for i in input().rstrip().split(" ")]
q = int(input())
M = [int(i) for i in input().rstrip().split(" ")]
x = ES()
x.solve(A, M)
|
s297880846 | p02271 | u573915636 | 1527600144 | Python | Python3 | py | Runtime Error | 0 | 0 | 321 | def solve(i,m):
if m==0:
return true
elif i>=n:
return false
else:
res=any(solve(i+1,m),solve(i+1,m-a[i]))
return res
n=int(input())
a=input().split()
q=int(input())
m=input().split()
for j in range(n):
a[j]=int(a[j])
for i in range(q):
m[i]=int(m[i])
if solve(i,m[i]):
print("yes")
else:
print("no")
|
s643084821 | p02271 | u165447384 | 1527646479 | Python | Python3 | py | Runtime Error | 8770 | 5612 | 348 | n = int(input())
A = list(map(int,input().split()))
m = int(input())
B = list(map(int,input().split()))
def solve(x,y):
if y<0: return False
elif y==0: return True
elif x==n: return False
else:
return solve(x+1,y) or solve(x+1,y-A[x])
for i in range(m):
if solve(0,B[i]): print("yes")
else: print("no")
|
s930976135 | p02271 | u165447384 | 1527646534 | Python | Python3 | py | Runtime Error | 8690 | 5608 | 348 | n = int(input())
A = list(map(int,input().split()))
m = int(input())
B = list(map(int,input().split()))
def solve(x,y):
if y<0: return False
elif y==0: return True
elif x==n: return False
else:
return solve(x+1,y-A[x]) or solve(x+1,y)
for i in range(m):
if solve(0,B[i]): print("yes")
else: print("no")
|
s387956466 | p02271 | u165447384 | 1527646647 | Python | Python3 | py | Runtime Error | 9110 | 5612 | 360 | n = int(input())
A = list(map(int,input().split()))
m = int(input())
B = list(map(int,input().split()))
def solve(x,y):
if y<0: return False
elif y==0: return True
elif x==n: return False
elif solve(x+1,y-A[x]): return True
else: return solve(x+1,y)
for i in range(m):
if solve(0,B[i]): print("yes")
else: print("no")
|
s226586095 | p02271 | u165447384 | 1527646690 | Python | Python3 | py | Runtime Error | 8860 | 5608 | 360 | n = int(input())
A = list(map(int,input().split()))
m = int(input())
B = list(map(int,input().split()))
def solve(x,y):
if y<0: return False
elif y==0: return True
elif x==n: return False
elif solve(x+1,y-A[x]): return True
else: return solve(x+1,y)
for i in range(m):
if solve(0,B[i]): print("yes")
else: print("no")
|
s641143176 | p02271 | u404682284 | 1527913029 | Python | Python3 | py | Runtime Error | 8220 | 5612 | 349 | n = int(input())
A = [int(i) for i in input().split()]
input()
M = [int(i) for i in input().split()]
def solve(i, m):
if m == 0:
res = True
elif i >= n:
res = False
else:
res = solve(i+1, m) or solve(i+1, m-A[i])
return res
for m in M:
if solve(0, m):
print('yes')
else:
print('no')
|
s244912962 | p02271 | u404682284 | 1527913423 | Python | Python3 | py | Runtime Error | 7930 | 5616 | 335 | n = int(input())
A = [int(i) for i in input().split()]
input()
M = [int(i) for i in input().split()]
def solve(i, m):
if m == 0:
return True
if i >= n:
return False
res = solve(i+1, m) or solve(i+1, m-A[i])
return res
for m in M:
if solve(0, m):
print('yes')
else:
print('no')
|
s550733725 | p02271 | u404682284 | 1527914174 | Python | Python3 | py | Runtime Error | 8380 | 5616 | 344 | n = int(input())
A = [int(i) for i in input().split()]
input()
M = [int(i) for i in input().split()]
def solve(i, m):
if m == 0:
return True
if i >= n or m < 0:
return False
res = solve(i+1, m) or solve(i+1, m-A[i])
return res
for m in M:
if solve(0, m):
print('yes')
else:
print('no')
|
s816910248 | p02271 | u007270338 | 1527968184 | Python | Python3 | py | Runtime Error | 13460 | 22224 | 437 | #coding:utf-8
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def solve(i, num):
if num == 0:
global sw
sw = 1
return 1
if i >= n or num < 0:
return ""
return solve(i+1, num), solve(i+1, num-A[i])
for num in m:
i = 0
sw = 0
solve(i,num)
if sw == 0:
print("no")
if sw == 1:
print("yes")
|
s617844474 | p02271 | u007270338 | 1527968804 | Python | Python3 | py | Runtime Error | 13520 | 22228 | 438 | #coding:utf-8
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def solve(i, num):
if num == 0:
global sw
sw = 1
return 1
if i >= n or num < 0:
return ""
return solve(i+1, num), solve(i+1, num-A[i])
for num in m:
i = 0
sw = 0
solve(i,num)
if sw == 0:
print("no")
if sw == 1:
print("yes")
|
s664117379 | p02271 | u007270338 | 1527968955 | Python | Python3 | py | Runtime Error | 14080 | 22228 | 428 | #coding:utf-8
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def solve(i, num):
if num == 0:
global sw
sw = 1
return
if i >= n or num < 0:
return
return solve(i+1, num), solve(i+1, num-A[i])
for num in m:
i = 0
sw = 0
solve(i,num)
if sw == 0:
print("no")
else:
print("yes")
|
s780399114 | p02271 | u007270338 | 1527969048 | Python | Python3 | py | Runtime Error | 13740 | 22228 | 434 | #coding:utf-8
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def solve(i, num):
if num == 0:
global sw
sw = 1
return
if i >= n or num < 0:
return
return solve(i+1, num), solve(i+1, num-A[i])
for num in m:
i = 0
sw = 0
solve(i,num)
if sw == 0:
print("no")
if sw == 1:
print("yes")
|
s090556696 | p02271 | u007270338 | 1527969407 | Python | Python3 | py | Runtime Error | 3690 | 7660 | 468 | #coding:utf-8
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def solve(i, num):
num = int(num)
i = int(i)
if num == 0:
global sw
sw = 1
return 0
if i >= n or num < 0:
return 0
return solve(i+1, num), solve(i+1, num-A[i])
for num in m:
i = 0
sw = 0
solve(i,num)
if sw == 0:
print("no")
if sw == 1:
print("yes")
|
s606925227 | p02271 | u007270338 | 1527969469 | Python | Python3 | py | Runtime Error | 13450 | 22224 | 434 | #coding:utf-8
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def solve(i, num):
if num == 0:
global sw
sw = 1
return 0
if i >= n or num < 0:
return 0
return solve(i+1, num), solve(i+1, num-A[i])
for num in m:
i = 0
sw = 0
solve(i,num)
if sw == 0:
print("no")
if sw == 1:
print("yes")
|
s410044624 | p02271 | u007270338 | 1527970108 | Python | Python3 | py | Runtime Error | 0 | 0 | 458 | #coding:utf-8
import numpy as np
n = int(input())
A = np.array(map(int, input().split()))
q = int(input())
m = np.array(map(int, input().split()))
def solve(i, num):
if num == 0:
global sw
sw = 1
return 0
if i >= n or num < 0:
return 0
return solve(i+1, num), solve(i+1, num-A[i])
for num in m:
i = 0
sw = 0
solve(i,num)
if sw == 0:
print("no")
if sw == 1:
print("yes")
|
s715158630 | p02271 | u007270338 | 1527998918 | Python | Python3 | py | Runtime Error | 12690 | 22220 | 460 | #coding:utf-8
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def solve(i, num):
global sw
if sw == 1:
return 1
if num == 0:
sw = 1
return 0
if i >= n or num < 0:
return 0
return solve(i+1, num), solve(i+1, num-A[i])
for num in m:
i = 0
sw = 0
solve(i,num)
if sw == 0:
print("no")
if sw == 1:
print("yes")
|
s669498827 | p02271 | u007270338 | 1527999980 | Python | Python3 | py | Runtime Error | 14430 | 22216 | 509 | #coding:utf-8
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def solve(i, num):
global sw
if sw == 1:
return 1
if num == 0:
sw = 1
return 0
if i >= n or num < 0:
return 0
if num < A[i]:
return solve(i+1,num)
return solve(i+1, num), solve(i+1, num-A[i])
for num in m:
i = 0
sw = 0
solve(i,num)
if sw == 0:
print("no")
if sw == 1:
print("yes")
|
s613154360 | p02271 | u007270338 | 1528000099 | Python | Python3 | py | Runtime Error | 12750 | 22220 | 460 | #coding:utf-8
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def solve(i, num):
global sw
if sw == 1:
return 1
if num == 0:
sw = 1
return 0
if i >= n or num < 0:
return 0
return solve(i+1, num), solve(i+1, num-A[i])
for num in m:
i = 0
sw = 0
solve(i,num)
if sw == 0:
print("no")
if sw == 1:
print("yes")
|
s773607726 | p02271 | u007270338 | 1528008293 | Python | Python3 | py | Runtime Error | 16490 | 22208 | 563 | #coding:utf-8
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
imList = []
def solve(i, m):
global sw
if sw == 1:
return 0
elif m == 0:
sw = 1
return 1
elif [i,m] in imList:
print("NN")
imList.append([i,m])
return 0
elif m < 0 or i >= n:
return 0
else:
return solve(i+1, m), solve(i+1, m-A[i])
for m in M:
i = 0
sw = 0
solve(i,m)
if sw == 0:
print("no")
if sw == 1:
print("yes")
|
s545313906 | p02271 | u007270338 | 1528012336 | Python | Python3 | py | Runtime Error | 4680 | 5812 | 581 | #coding:utf-8
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
def solve(i, m):
global sw
if sw == 1:
return 0
if m == 0:
sw = 1
return 1
if m < 0:
return 0
if [i,m] in imList:
return 0
else:
imList.append([i,m])
if i >= n:
return 0
else:
return solve(i+1, m), solve(i+1, m-A[i])
for m in M:
i = 0
sw = 0
imList = []
solve(i,m)
if sw == 0:
print("no")
if sw == 1:
print("yes")
|
s003438998 | p02271 | u007270338 | 1528012481 | Python | Python3 | py | Runtime Error | 12920 | 22220 | 493 | #coding:utf-8
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))
def solve(i, m):
global sw
if sw == 1:
return 0
if m == 0:
sw = 1
return 1
if m < 0:
return 0
if i >= n:
return 0
else:
return solve(i+1, m), solve(i+1, m-A[i])
for m in M:
i = 0
sw = 0
imList = []
solve(i,m)
if sw == 0:
print("no")
if sw == 1:
print("yes")
|
s992400677 | p02271 | u007270338 | 1528024931 | Python | Python3 | py | Runtime Error | 0 | 0 | 916 | #coding:utf-8
import numpy as np
import math
pi = math.pi
cos = math.cos
sin = math.sin
n = int(input())
if n == 0:
n = int(input())
A, B = np.array([0,0]), np.array([100,0])
def inc(A, B):
AB = B - A
rot = np.array([[cos(pi/2), -sin(pi/2)],[sin(pi/2), cos(pi/2)]])
convertedAB = np.dot(rot, AB)
normAB = np.linalg.norm(AB)
D = AB / 2 + (3**(1/2)/6) * convertedAB
return D
def koch(A, B, i):
AB = B - A
if i >= n:
return 1
C = A + AB/3
koch(A,C,i+1)
print(" ".join([str(num) for num in C]))
D = inc(A, B)
koch(C,D,i+1)
print(" ".join([str(num) for num in D]))
E = A + 2*AB/3
koch(D,E,i+1)
print(" ".join([str(num) for num in E]))
koch(E,B,i+1)
koch(A, C, i+1),koch(C, D, i+1), koch(D, E, i+1), koch(E,B,i+1)
print(" ".join([str(float(num)) for num in A]))
i = 0
koch(A,B,i)
print(" ".join([str(float(num)) for num in B]))
|
s733781592 | p02271 | u256748051 | 1528540798 | Python | Python | py | Runtime Error | 4610 | 4656 | 301 | n = int(input())
arr = map(int,raw_input().split())
m = int(input())
arr_m = map(int,raw_input().split())
def rec(m,i,s):
if s == m:
return True
elif i >= n:
return False
else :
return rec(m,i+1,s) or rec(m,i+1,s+arr[i])
for i in range(m):
print 'yes' if rec(arr_m[i],0,0) else 'no'
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.