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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s656033487 | p04013 | u411203878 | 1586630226 | Python | PyPy3 (2.4.0) | py | Runtime Error | 187 | 39280 | 683 | import math
def combination(n, k):
return math.factorial(n) // math.factorial(k) // math.factorial(n - k)
import collections
n,a = map(int,input().split())
t = list(map(int,input().split()))
memo = [0]*51
for i in t:
memo[i] += 1
typecount = []
ans = 0
for i in t:
if i != a:
typecount.append(i)
for i in range(1,len(typecount)):
for j in itertools.combinations(typecount,i):
if int((sum(j)/len(j))*10) == int(sum(j)/len(j))*10:
if int(sum(j)/len(j))==a:
#print(j)
ans += 2**(memo[a])
if 0 < memo[a]:
for i in range(1,memo[a]+1):
ans += combination(memo[a], i)
print(ans) |
s689929381 | p04013 | u411203878 | 1586629363 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38640 | 583 | import math
def combination(n, k):
return math.factorial(n) // math.factorial(k) // math.factorial(n - k)
import collections
n,a = map(int,input().split())
t = list(map(int,input().split()))
memo = [0]*51
for i in t:
memo[i] += 1
typecount = []
ans = 0
for i in t:
if i != a:
typecount.append(i)
for i in range(1,len(typecount)):
for j in itertools.combinations(typecount,i):
if sum(j)/len(j)==a:
ans += 2**(memo[a])
if 0 < memo[a]:
for i in range(1,memo[a]+1):
ans += combination(memo[a], i)
print(ans) |
s481297557 | p04013 | u372144784 | 1586384993 | Python | Python (3.4.3) | py | Runtime Error | 177 | 14944 | 398 | import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n,a = map(int,readline().split())
lst1 = list(map(int,readline().split()))
import numpy as np
dp = np.zeros((n+1,3000),dtype=np.int64) # 枚数、目標数ごとに場合の数
dp[0,0] = 1
for x in lst1:
dp[1:,x:] += dp[:-1,:-x].copy()
ans = 0
for i in range(1,n+1):
ans += dp[i,i*lst1]
print(ans)
|
s192456293 | p04013 | u372144784 | 1586384975 | Python | PyPy3 (2.4.0) | py | Runtime Error | 176 | 38256 | 398 | import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n,a = map(int,readline().split())
lst1 = list(map(int,readline().split()))
import numpy as np
dp = np.zeros((n+1,3000),dtype=np.int64) # 枚数、目標数ごとに場合の数
dp[0,0] = 1
for x in lst1:
dp[1:,x:] += dp[:-1,:-x].copy()
ans = 0
for i in range(1,n+1):
ans += dp[i,i*lst1]
print(ans)
|
s573252466 | p04013 | u939198091 | 1586312521 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38640 | 791 | import numpy as np
def solve(n, a, lst):
m = max(max(lst), a)
ans = np.zeros((n+1, n+1, n*m+1))
#ans[i][j][k] : lst[:i]までの中からj枚選んで合計kにする選び方
for i in range(n+1):
for j in range(n+1):
for k in range(n*m+1):
if i == 0 and j == 0 and k == 0:
ans[i][j][k] = 1
elif i >= 1 and k < lst[i-1]:
ans[i][j][k] = ans[i-1][j][k]
elif i >= 1 and lst[i-1] <= k and j >= 1:
ans[i][j][k] = ans[i-1][j-1][k-lst[i-1]] + ans[i-1][j][k]
else:
ans[i][j][k] = 0
ret = 0
for i in range(1,n+1):
ret += ans[-1][i][i*a]
return int(ret)
if __name__ == "__main__":
n, a = map(int,input().split())
x_list = [int(i) for i in input().split()]
ans = solve(n,a,x_list)
print(ans)
|
s141927007 | p04013 | u485319545 | 1586224489 | Python | Python (3.4.3) | py | Runtime Error | 2114 | 80712 | 460 | N,A=map(int,input().split())
cards=list(map(int,input().split()))
result=0
lists=[]
import numpy as np
for i in range(2**N):
list2 =[]
for j in range(N):
if (i >> j) &1 == 1:
list2.append(cards[j])
lists.append(list2)
lists=np.array(lists)
unique_array = np.unique(lists)
lists=unique_array.tolist()
for j in range(len(lists)):
ave = sum(lists[j])/len(lists[j])
if ave ==A:
result+=1
print(result) |
s066294981 | p04013 | u485319545 | 1586224442 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38640 | 473 | N,A=map(int,input().split())
cards=list(map(int,input().split()))
result=0
lists=[]
import numpy as np
for i in range(2**N):
list2 =[]
for j in range(N):
if (i >> j) &1 == 1:
list2.append(cards[j])
lists.append(list2)
lists=np.array(lists)
unique_array = np.unique(lists)
lists=unique_array.tolist()
print(lists)
for j in range(len(lists)):
ave = sum(lists[j])/len(lists[j])
if ave ==A:
result+=1
print(result) |
s950391602 | p04013 | u787449825 | 1585884952 | Python | PyPy3 (2.4.0) | py | Runtime Error | 469 | 96476 | 481 | N, A = map(int, input().split())
a = list(map(int, input().split()))
X = max(a)
ans = 0
dp = [[[0 for i in range(N*X+1)]for j in range(N+1)]for k in range(N+1)]
dp[0][0][0] = 1
for j in range(N):
for k in range(N+1):
for s in range(N*X+1):
if a[j]>s:
dp[j+1][k][s] = dp[j][k][s]
elif a[j]<=s and 1<=k:
dp[j+1][k][s] = dp[j][k][s] + dp[j][k-1][s-a[j]]
for k in range(1,N+1):
ans += dp[N][k][k*A]
print(ans)
|
s546837015 | p04013 | u787449825 | 1585884831 | Python | Python (3.4.3) | py | Runtime Error | 2107 | 56564 | 481 | N, A = map(int, input().split())
a = list(map(int, input().split()))
X = max(a)
ans = 0
dp = [[[0 for i in range(N*X+1)]for j in range(N+1)]for k in range(N+1)]
dp[0][0][0] = 1
for j in range(N):
for k in range(N+1):
for s in range(N*X+1):
if a[j]>s:
dp[j+1][k][s] = dp[j][k][s]
elif a[j]<=s and 1<=k:
dp[j+1][k][s] = dp[j][k][s] + dp[j][k-1][s-a[j]]
for k in range(1,N+1):
ans += dp[N][k][k*A]
print(ans)
|
s301787784 | p04013 | u787449825 | 1585779876 | Python | PyPy3 (2.4.0) | py | Runtime Error | 449 | 95836 | 541 | import sys
sys.setrecursionlimit(10**6)
N, A = map(int, input().split())
a = [0]+list(map(int, input().split()))
X = max(a)
dp = [[[0 for i in range(N*X+1)] for j in range(N+1)] for k in range(N+1)]
dp[0][0][0] = 1
for i in range(N+1):
for j in range(N+1):
for k in range(N*X+1):
if i>=1 and k<a[i]:
dp[i][j][k]=dp[i-1][j][k]
elif i>=1 and j>=1 and k>=a[i]:
dp[i][j][k]=dp[i-1][j][k]+dp[i-1][j-1][k-a[i]]
ans = 0
for j in range(1,N+1):
ans += dp[N][j][j*A]
print(ans)
|
s518841519 | p04013 | u787449825 | 1585779664 | Python | PyPy3 (2.4.0) | py | Runtime Error | 457 | 95836 | 500 | N, A = map(int, input().split())
a = [0]+list(map(int, input().split()))
X = max(a)
dp = [[[0 for i in range(N*X+1)] for j in range(N+1)] for k in range(N+1)]
dp[0][0][0] = 1
for i in range(N+1):
for j in range(N+1):
for k in range(N*X+1):
if i>=1 and k<a[i]:
dp[i][j][k]=dp[i-1][j][k]
elif i>=1 and j>=1 and k>=a[i]:
dp[i][j][k]=dp[i-1][j][k]+dp[i-1][j-1][k-a[i]]
ans = 0
for j in range(1,N+1):
ans += dp[N][j][j*A]
print(ans)
|
s210137128 | p04013 | u787449825 | 1585779136 | Python | PyPy3 (2.4.0) | py | Runtime Error | 452 | 95836 | 502 | N, A = map(int, input().split())
a = [0]+list(map(int, input().split()))
X = max(a)
dp = [[[0 for i in range(N*X+1)] for j in range(N+1)] for k in range(N+1)]
dp[0][0][0] = 1
for i in range(N+1):
for j in range(N+1):
for k in range(N*X+1):
if i>=1 and k<a[i]:
dp[i][j][k]=dp[i-1][j][k]
elif i>=1 and j>=1 and k>=a[i]:
dp[i][j][k]=dp[i-1][j][k]+dp[i-1][j-1][k-a[i]]
ans = 0
for j in range(1,N+1):
ans += dp[N][j][j*A]
print(ans)
|
s750847035 | p04013 | u787449825 | 1585778880 | Python | Python (3.4.3) | py | Runtime Error | 2107 | 58484 | 501 | N, A = map(int, input().split())
a = [0]+list(map(int, input().split()))
X = max(a)
dp = [[[0 for i in range(N*X+1)] for j in range(N+1)] for k in range(N+1)]
dp[0][0][0] = 1
for i in range(N+1):
for j in range(N+1):
for k in range(N*X+1):
if i>=1 and k<a[i]:
dp[i][j][k]=dp[i-1][j][k]
elif i>=1 and j>=1 and k>=a[i]:
dp[i][j][k]=dp[i-1][j][k]+dp[i-1][j-1][k-a[i]]
ans = 0
for j in range(1,N+1):
ans += dp[N][j][j*A]
print(ans) |
s215240186 | p04013 | u930705402 | 1585594488 | Python | PyPy3 (2.4.0) | py | Runtime Error | 336 | 114652 | 389 | N,A=map(int,input().split())
x=list(map(int,input().split()))
dp=[[[0]*(N*N+100) for j in range(N+10)] for i in range(N+10)]
dp[0][0][0]=1
for i in range(N):
for j in range(N+1):
for k in range(sum(x)+1):
if(dp[i][j][k]!=0):
dp[i+1][j][k]+=dp[i][j][k]
dp[i+1][j+1][k+x[i]]+=dp[i][j][k]
print(sum(dp[N][i][i*A] for i in range(1,N+1))) |
s943412833 | p04013 | u179169725 | 1585515759 | Python | PyPy3 (2.4.0) | py | Runtime Error | 367 | 92124 | 1805 | # https://atcoder.jp/contests/abc044/tasks/arc060_a
# ソートしてからごちゃごちゃやればどうにかなりそう(無理でした)
'''
解説満点解法1
もしもk枚選んだとき、合計がsになる通りの数がわかったら？→s=k*Aとなる場合の数の合計をすれば良い
k枚選んだとき、合計がsになる通りの数は典型的なDP！
dp(j,k,s)... X[0:j]からk枚選んで、その合計をsにするような選び方の総数
と定義すると、
dp(j+1,k,s) = X[j]を選んだ結果sになったときの通りの数 + X[j]を選ばずにsになっている通りの数 なので
dp(j+1,k,s) = dp(j,k-1,s-X[j]) + dp(j,k,s)
あとは初期条件と境界条件と伝播条件を付け加える。
境界条件 dp(j,k,0)=0 (数枚選んで合計が0になるのはありえない)
初期条件 dp(j,0,0)=1 (ただし、0枚選んだときは1通りとなる)(s-X[j]=0のときに1通りとなってほしいという気持ちもある)
伝播条件 s-X[j]<0に関しては dp(j-1,k-1,s-X[j])が必ず0通りとなる(ありえないので)
'''
import sys
read = sys.stdin.readline
from itertools import product
def read_ints():
return list(map(int, read().split()))
N, A = read_ints()
X = read_ints()
S = sum(X)
# 満点解法1
dp = [[[0] * (S + 1) for _ in range(N + 1)] for _ in range(N + 1)]
for j in range(N + 1): # 初期条件
dp[j][0][0] = 1 # 1枚も選ばずに0になるのは1通り
for j, k, s in product(range(N), range(1, N + 1), range(S + 1)):
dp[j + 1][k][s] = dp[j][k][s] + \
(0 if s - X[j] < 0 else dp[j][k - 1][s - X[j]])
# s=k*Aとなるような通りの数の総数
ans = 0
for k in range(1, N + 1): # 0個はとる通りの数はいらない
ans += dp[N][k][k * A]
# print(dp)
print(ans)
|
s876011991 | p04013 | u179169725 | 1585515654 | Python | Python (3.4.3) | py | Runtime Error | 2107 | 56180 | 1828 | # https://atcoder.jp/contests/abc044/tasks/arc060_a
# ソートしてからごちゃごちゃやればどうにかなりそう(無理でした)
'''
解説満点解法1
もしもk枚選んだとき、合計がsになる通りの数がわかったら？→s=k*Aとなる場合の数の合計をすれば良い
k枚選んだとき、合計がsになる通りの数は典型的なDP！
dp(j,k,s)... X[0:j]からk枚選んで、その合計をsにするような選び方の総数
と定義すると、
dp(j+1,k,s) = X[j]を選んだ結果sになったときの通りの数 + X[j]を選ばずにsになっている通りの数 なので
dp(j+1,k,s) = dp(j,k-1,s-X[j]) + dp(j,k,s)
あとは初期条件と境界条件と伝播条件を付け加える。
境界条件 dp(j,k,0)=0 (数枚選んで合計が0になるのはありえない)
初期条件 dp(j,0,0)=1 (ただし、0枚選んだときは1通りとなる)(s-X[j]=0のときに1通りとなってほしいという気持ちもある)
伝播条件 s-X[j]<0に関しては dp(j-1,k-1,s-X[j])が必ず0通りとなる(ありえないので)
'''
import sys
read = sys.stdin.readline
from itertools import product
def read_ints():
return list(map(int, read().split()))
N, A = read_ints()
X = read_ints()
S = sum(X)
# 満点解法1
dp = [[[0] * (S + 1) for _ in range(N + 1)] for _ in range(N + 1)]
for j in range(N + 1): # 初期条件
dp[j][0][0] = 1 # 1枚も選ばずに0になるのは1通り
for j, k, s in product(range(N), range(1, N + 1), range(S + 1)):
dp[j + 1][k][s] = dp[j][k][s] + \
(0 if s - X[j] < 0 else dp[j][k - 1][s - X[j]])
# s=k*Aとなるような通りの数の総数
ans = 0
for k in range(1, N + 1): # 0個はとる通りの数はいらない
ans += dp[N][k][k * A]
# print(dp)
print(ans)
'''
満点解法2
'''
|
s687996656 | p04013 | u964299793 | 1585380477 | Python | Python (3.4.3) | py | Runtime Error | 1096 | 56564 | 558 | import sys
input=sys.stdin.readline
n,a=map(int,input().split())
x=[0]+list(map(int,input().split()))
su=sum(x)
maxi=max(x)
dp=[[[0 for k in range(su+1)] for j in range(51)] for i in range(51)]
dp[0][0][0]=1
for i in range(1,n+1):
for j in range(i+1):
for k in range(maxi*j+1):
if k<x[i]:
dp[i][j][k]=dp[i-1][j][k]
if k>=x[i] and j>=1:
dp[i][j][k]=dp[i-1][j][k]+dp[i-1][j-1][k-x[i]]
ans=0
for t in range(1,n+1):
if a*t<=su:
ans+=dp[n][t][a*t]
else:
break
print(ans)
|
s991718078 | p04013 | u498487134 | 1584670597 | Python | PyPy3 (2.4.0) | py | Runtime Error | 234 | 91356 | 762 | import sys
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N,A=MI()
x=LI()
M=max(x)
#dp[i][j][k]はi番目まで，j枚で，和がkにできるか
dp=[[[0]*(N*M+1) for j in range(N+1)] for _ in range(N+1)]
dp[0][0][0]=1
for i in range(N):
for j in range(i+1):
for k in range(N*M+1-x[i]):
if dp[i][j][k]:
dp[i+1][j][k]+=dp[i][j][k]
dp[i+1][j+1][k+x[i]]+=dp[i][j][k]
ans=0
for j in range(1,N+1):
ans+=dp[-1][j][j*A]
print(ans)
main()
|
s533641089 | p04013 | u721970149 | 1584575143 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4084 | 497 | N, A = map(int, input().split())
x = [0] + [int(i) for i in input().split()]
dp = [[[0]*(N*max(x)+1)]*(N+1) for _ in range(N+1)]
dp[0][0][0] = 1
for i in range(N+1):
for j in range(N+1) :
for k in range(N*max(x)+1) :
if i >= 1 and k < x[i] :
dp[i][j][k] = dp[i-1][j][k]
if i >= 1 and j >= 1 and k >= x[i] :
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k-x[i]]
ans = 0
for j in range(N+1) :
ans += dp[N][j][j*A]
print(ans-1)
|
s672715681 | p04013 | u380772254 | 1583980498 | Python | PyPy3 (2.4.0) | py | Runtime Error | 279 | 90972 | 777 | import sys
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
N, A = MI()
X = LMI()
# dp[i][j][s] := i番目までのカードからj枚を選んで合計がsになる組み合わせの数
dp = [[[0] * (A * N + 1) for _ in range(N + 1)] for _ in range(N)]
for i in range(N):
dp[i][0][0] = 1
dp[0][1][X[0]] = 1
for i in range(1, N):
for j in range(1, i + 2):
for s in range(A * N + 1):
if s - X[i] < 0:
dp[i][j][s] = dp[i - 1][j][s]
else:
dp[i][j][s] = dp[i - 1][j][s] + dp[i - 1][j - 1][s - X[i]]
ans = 0
for i in range(1, N + 1):
ans += dp[N - 1][i][A * i]
print(ans)
|
s390667961 | p04013 | u380772254 | 1583980294 | Python | PyPy3 (2.4.0) | py | Runtime Error | 293 | 91484 | 691 | import sys
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
N, A = MI()
X = LMI()
mx = max(X)
# dp[i][j][s] := i番目までのカードからj枚を選んで合計がsになる組み合わせの数
dp = [[[0] * (N * mx + 1) for _ in range(N + 1)] for _ in range(N)]
for i in range(N):
dp[i][0][0] = 1
dp[0][1][X[0]] = 1
for i in range(N):
for j in range(1, i + 2):
for s in range(N * mx + 1):
dp[i][j][s] = dp[i - 1][j][s] + dp[i - 1][j - 1][s - X[i]]
ans = 0
for i in range(1, N + 1):
ans += dp[N - 1][i][A * i]
print(ans)
|
s069869811 | p04013 | u144913062 | 1582753708 | Python | PyPy3 (2.4.0) | py | Runtime Error | 249 | 42348 | 339 | N, A = map(int, input().split())
x = list(map(int, input().split()))
MAX_J = sum(x)
dp = [[0] * (MAX_J+1) for i in range(N+1)]
dp[0][0] = 1
for n in range(N):
for i in range(N)[::-1]:
for j in range(MAX_J-x[n]+1)[::-1]:
dp[i+1][j+x[n]] += dp[i][j]
ans = 0
for i in range(1, N+1):
ans += dp[i][A * i]
print(ans)
|
s162240291 | p04013 | u620157187 | 1582548381 | Python | Python (3.4.3) | py | Runtime Error | 152 | 12520 | 730 | import numpy as np
N, A = map(int,input().split())
x = np.array(list(map(int,input().split())))
x_diff = np.sort(x - A)
posi_list = []
posi = 0
for posi_i in x_diff[x_diff>0]:
posi_list.append(posi_i)
posi += posi_i
posi_list.append(posi)
nega_list = []
nega = 0
for nega_i in x_diff[x_diff<0]:
nega_list.append(nega_i)
nega += nega_i
nega_list.append(nega)
posi_list.pop(0)
nega_list.pop(0)
posi_nega = 0
posi_new = []
nega_new = []
for posi in posi_list:
for nega in nega_list:
if posi+nega==0:
posi_nega += 1
posi_new.append(posi)
nega_new.append(nega)
zeros = len(x_diff[x_diff==0])
posi_nega = zeros+posi_nega*2
print(posi_nega) |
s637896366 | p04013 | u068584789 | 1582511747 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 423 | import itertools
n, a = map(int, input().split())
cards = list(map(int, input().split()))
combi = []
for i in range(2, len(cards) + 1):
cm = []
c = itertools.combinations(cards, i)
for i in range(len(c)):
if min(c[i]) <= a:
cm += c
combi += cm
r = 0
for i in range(len(cards)):
if cards[i] == a:
r += 1
for i in range(len(combi)):
if sum(combi[i]) / len(combi[i]) == a:
r += 1
print(r)
|
s085741480 | p04013 | u020390084 | 1581823891 | Python | PyPy3 (2.4.0) | py | Runtime Error | 335 | 91868 | 1023 | #!/usr/bin/env python3
import sys
def solve(N: int, A: int, x: "List[int]"):
## dp[i][j][k] = i番目までのカードからjマイ選んで合計kにする選び方の総数
dp = [[[0]*2500 for _ in range(N+1)] for _ in range(N+1)]
for i in range(N):
dp[i][0][0] = 1
for i in range(N):
for j in range(N):
for k in range(2500):
if k-x[i] >= 0:
dp[i+1][j+1][k] = dp[i][j][k-x[i]]+dp[i][j+1][k]
else:
dp[i+1][j+1][k] = dp[i][j+1][k]
answer = 0
for j in range(1,N+1):
answer += dp[N][j][A*j]
print(answer)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
A = int(next(tokens)) # type: int
x = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, A, x)
if __name__ == '__main__':
main()
|
s701289681 | p04013 | u736729525 | 1581735538 | Python | PyPy3 (2.4.0) | py | Runtime Error | 178 | 38384 | 796 | from functools import lru_cache
N, A = map(int, input().split())
X = [int(x) for x in input().split()]
@lru_cache(1000000000, False)
def solve(i, n, s):
if s < 0:
return -1
if N-i+1 < n:
return -1
if n == 0:
if s == 0:
return 1
else:
return -1
if i == N:
return -1
s1 = solve(i+1, n-1,s-X[i])
s2 = solve(i+1, n, s)
if s1 == -1 and s2 == -1:
return -1
if s1 == -1:
return s2
if s2 == -1:
return s1
return s1 + s2
answer = 0
for n in range(1, N+1):
s = solve(0, n, n*A)
if s != -1:
#print(n, s)
answer += s
print(answer)
def test():
import itertools
for a in itertools.combinations(X,3):
if sum(a) == A*3:
print(a) |
s613216627 | p04013 | u187516587 | 1581549014 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38384 | 225 | N,A=map(int, input().split())
x=tuple(map(lambda i:int(i)-A,input().split()))
l=[0]*5001
l[0]=1
for i in x:
f=l.copy()
for j in range(-2500,2501):
if l[j]:
f[i+j]+=l[j]
l=f.copy()
print(l[0]-1) |
s116794649 | p04013 | u379959788 | 1579713315 | Python | PyPy3 (2.4.0) | py | Runtime Error | 319 | 93532 | 658 | # ABC044
N, A = map(int, input().split())
X = list(map(int, input().split()))
# 2 ** 50 -> 全探索は厳しい -> DP
# dp[i][k][wa] = i枚まで見て、k枚選んだ時の合計値がwaとなるときの選び方の合計
# max wa = max(X) * N
max_wa = max(X) * N
dp = [[[0] * (max(X) * (N+1)) for _ in range(N+1)] for __ in range(N+1)]
dp[0][0][0] = 1
for i in range(N):
for k in range(i+1):
for wa in range(max_wa):
# 選ぶとき
dp[i+1][k+1][wa+X[i]] += dp[i][k][wa]
# 選ばないとき
dp[i+1][k][wa] += dp[i][k][wa]
ans = 0
for k in range(1, N+1):
ans += dp[-1][k][k*A]
print(ans)
|
s933618098 | p04013 | u379959788 | 1579712672 | Python | Python (3.4.3) | py | Runtime Error | 2107 | 57080 | 642 | # ABC044
N, A = map(int, input().split())
X = list(map(int, input().split()))
# 2 ** 50 -> 全探索は厳しい -> DP
# dp[i][k][wa] = i枚まで見て、k枚選んだ時の合計値がwaとなるときの選び方の合計
# max wa = max(X) * N
max_wa = max(X) * N
dp = [[[0] * 2550 for _ in range(N+1)] for __ in range(N+1)]
dp[0][0][0] = 1
for i in range(N):
for k in range(N):
for wa in range(2501):
# 選ぶとき
dp[i+1][k+1][wa+X[i]] += dp[i][k][wa]
# 選ばないとき
dp[i+1][k][wa] += dp[i][k][wa]
ans = 0
for k in range(1, N+1):
ans += dp[-1][k][k*A]
print(ans) |
s148634723 | p04013 | u379959788 | 1579712465 | Python | Python (3.4.3) | py | Runtime Error | 207 | 54132 | 647 | # ABC044
N, A = map(int, input().split())
X = list(map(int, input().split()))
# 2 ** 50 -> 全探索は厳しい -> DP
# dp[i][k][wa] = i枚まで見て、k枚選んだ時の合計値がwaとなるときの選び方の合計
# max wa = max(X) * N
max_wa = max(X) * N
dp = [[[0] * (N*A+5) for _ in range(N+1)] for __ in range(N+1)]
dp[0][0][0] = 1
for i in range(N):
for k in range(N):
for wa in range(max_wa):
# 選ぶとき
dp[i+1][k+1][wa+X[i]] += dp[i][k][wa]
# 選ばないとき
dp[i+1][k][wa] += dp[i][k][wa]
ans = 0
for k in range(1, N+1):
ans += dp[-1][k][k*A]
print(ans) |
s710801011 | p04013 | u379959788 | 1579712047 | Python | Python (3.4.3) | py | Runtime Error | 2107 | 62704 | 691 | # ABC044
N, A = map(int, input().split())
X = list(map(int, input().split()))
# 2 ** 50 -> 全探索は厳しい -> DP
# dp[i][k][wa] = i枚まで見て、k枚選んだ時の合計値がwaとなるときの選び方の合計
# max wa = max(X) * N
max_wa = max(X) * N
if max_wa < A:
print(0)
exit()
dp = [[[0] * (max_wa+50) for _ in range(N+1)] for __ in range(N+1)]
dp[0][0][0] = 1
for i in range(N):
for k in range(i+1):
for wa in range(max_wa):
# 選ぶとき
dp[i+1][k+1][wa+X[i]] += dp[i][k][wa]
# 選ばないとき
dp[i+1][k][wa] += dp[i][k][wa]
ans = 0
for k in range(1, N+1):
ans += dp[-1][k][k*A]
print(ans) |
s155926503 | p04013 | u379959788 | 1579711723 | Python | Python (3.4.3) | py | Runtime Error | 2107 | 63472 | 652 | # ABC044
N, A = map(int, input().split())
X = list(map(int, input().split()))
# 2 ** 50 -> 全探索は厳しい -> DP
# dp[i][k][wa] = i枚まで見て、k枚選んだ時の合計値がwaとなるときの選び方の合計
# max wa = max(X) * N
max_wa = max(X) * N
dp = [[[0] * (max_wa+50) for _ in range(N+1)] for __ in range(N+1)]
dp[0][0][0] = 1
for i in range(N):
for k in range(i+1):
for wa in range(max_wa):
# 選ぶとき
dp[i+1][k+1][wa+X[i]] += dp[i][k][wa]
# 選ばないとき
dp[i+1][k][wa] += dp[i][k][wa]
ans = 0
for k in range(1, N+1):
ans += dp[-1][k][k*A]
print(ans) |
s772451086 | p04013 | u379959788 | 1579711591 | Python | Python (3.4.3) | py | Runtime Error | 127 | 54132 | 653 | # ABC044
N, A = map(int, input().split())
X = list(map(int, input().split()))
# 2 ** 50 -> 全探索は厳しい -> DP
# dp[i][k][wa] = i枚まで見て、k枚選んだ時の合計値がwaとなるときの選び方の合計
# max wa = max(X) * N
max_wa = max(X) * N
dp = [[[0] * (max_wa + 5) for _ in range(N+1)] for __ in range(N+1)]
dp[0][0][0] = 1
for i in range(N):
for k in range(i+1):
for wa in range(max_wa):
# 選ぶとき
dp[i+1][k+1][wa+X[i]] += dp[i][k][wa]
# 選ばないとき
dp[i+1][k][wa] += dp[i][k][wa]
ans = 0
for k in range(1, N+1):
ans += dp[-1][k][k*A]
print(ans) |
s981484266 | p04013 | u379959788 | 1579711542 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 654 | # ABC044
N, A = map(int, input().split())
X = list(map(int, input().split()))
# 2 ** 50 -> 全探索は厳しい -> DP
# dp[i][k][wa] = i枚まで見て、k枚選んだ時の合計値がwaとなるときの選び方の合計
# max wa = max(X) * N
max_wa = max(X) * N
dp = [[[0] * (max_wa + 5)) for _ in range(N+1)] for __ in range(N+1)]
dp[0][0][0] = 1
for i in range(N):
for k in range(i+1):
for wa in range(max_wa):
# 選ぶとき
dp[i+1][k+1][wa+X[i]] += dp[i][k][wa]
# 選ばないとき
dp[i+1][k][wa] += dp[i][k][wa]
ans = 0
for k in range(1, N+1):
ans += dp[-1][k][k*A]
print(ans) |
s265817219 | p04013 | u379959788 | 1579711341 | Python | Python (3.4.3) | py | Runtime Error | 2107 | 62708 | 657 | # ABC044
N, A = map(int, input().split())
X = list(map(int, input().split()))
# 2 ** 50 -> 全探索は厳しい -> DP
# dp[i][k][wa] = i枚まで見て、k枚選んだ時の合計値がwaとなるときの選び方の合計
# max wa = max(X) * N
max_wa = max(X) * N
dp = [[[0] * (max(X) * (N+1)) for _ in range(N+1)] for __ in range(N+1)]
dp[0][0][0] = 1
for i in range(N):
for k in range(i+1):
for wa in range(max_wa):
# 選ぶとき
dp[i+1][k+1][wa+X[i]] += dp[i][k][wa]
# 選ばないとき
dp[i+1][k][wa] += dp[i][k][wa]
ans = 0
for k in range(1, N+1):
ans += dp[-1][k][k*A]
print(ans) |
s172210918 | p04013 | u484229314 | 1577652099 | Python | Python (3.4.3) | py | Runtime Error | 54 | 4340 | 453 | N, A = [int(_) for _ in input().split()]
MAX_I = 2000
memo = [[0] * MAX_I for _ in range(N + 2)]
def cnv(v):
return v - A + (MAX_I // 2)
X = [int(_) for _ in input().split()]
for i in range(N):
offset = X[i] - A
# print('x', offset)
mm = memo[i]
for j in range(MAX_I):
if mm[j] > 0:
memo[i + 1][j + offset] += mm[j]
memo[i + 1][j] += mm[j]
memo[i + 1][cnv(X[i])] += 1
print(memo[N][MAX_I//2])
|
s450343813 | p04013 | u484229314 | 1577652051 | Python | Python (3.4.3) | py | Runtime Error | 37 | 3828 | 453 | N, A = [int(_) for _ in input().split()]
MAX_I = 1000
memo = [[0] * MAX_I for _ in range(N + 2)]
def cnv(v):
return v - A + (MAX_I // 2)
X = [int(_) for _ in input().split()]
for i in range(N):
offset = X[i] - A
# print('x', offset)
mm = memo[i]
for j in range(MAX_I):
if mm[j] > 0:
memo[i + 1][j + offset] += mm[j]
memo[i + 1][j] += mm[j]
memo[i + 1][cnv(X[i])] += 1
print(memo[N][MAX_I//2])
|
s633178198 | p04013 | u484229314 | 1577651953 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3064 | 523 | N, A = [int(_) for _ in input().split()]
MAX_I = 200
memo = [[0] * MAX_I for _ in range(N + 2)]
def cnv(v):
return v - A + (MAX_I // 2)
X = [int(_) for _ in input().split()]
for i in range(N):
offset = X[i] - A
# print('x', offset)
mm = memo[i]
for j in range(MAX_I):
if mm[j] > 0:
# print('j+x', j + offset)
memo[i + 1][j + offset] += mm[j]
memo[i + 1][j] += mm[j]
memo[i + 1][cnv(X[i])] += 1
# print(memo[i + 1][90:110])
print(memo[i + 1][100])
|
s574776278 | p04013 | u581187895 | 1577482111 | Python | Python (3.4.3) | py | Runtime Error | 2108 | 24780 | 441 | import numpy as np
N, A = map(int, input().split())
X = list(map(int, input().split()))
sum_X = sum(X)
dp = np.zeros((N+1, N+1, sum_X+1), np.int64)
dp[0][0][0] = 1
for i in range(N):
for j in range(N):
for k in range(sum_X):
if dp[i][j][k] == 0: continue
# not used
dp[i+1][j][k] += dp[i][j][k]
# used
dp[i+1][j+1][k+X[i]] += dp[i][j][k]
ans = 0
for i in range(1, N+1):
ans += dp[N][i][i*A]
print(ans) |
s417902322 | p04013 | u141786930 | 1576448981 | Python | Python (3.4.3) | py | Runtime Error | 166 | 14496 | 265 | import numpy as np
N, A = map(int,input().split())
X = [int(x) for x in input().split()]
dp = np.zeros((N+1,sum(X)+1),dtype=np.int64)
dp[0,0] = 1
for x in X:
dp[1:,x:] += dp[:-1,:-x].copy()
ans = 0
for n in range(1,N+1):
ans += dp[n,n*A]
print(ans) |
s881678869 | p04013 | u677523557 | 1575684505 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4724 | 376 | N, K = map(int, input().split())
A = list(map(int, input().split()))
L = max(A)*N
dp = [[0 for _ in range(L+1)] for _ in range(N+1)]
dp[0][0] = 1
for i in range(N):
a = A[i]
for j in reversed(range(N)):
for l in range(L+1):
if l < a: continue
dp[j+1][l] += dp[j][l-a]
ans = 0
for j in range(N):
ans += dp[j+1][(j+1)*K]
print(ans) |
s266705956 | p04013 | u135847648 | 1575214043 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 565 | n, a = map(int, input().split())
x = list(map(int, input().split()))
#aとの差を記録してリストに入れなおす
x = list(map(lambda i: i-a, x))
#print(x)
#dp初期値
dp = {0: 1}
#dpにぶち込む値をxから取り出す
for num in x:
#dpにあるすべてのkey,valueに対して、すでにdpにkeyがi+kのデータがあればそのvalueなければ,0を返し、それ+vをdpとする。
for k,v in list(dp.items()):
dp[i+k]=dp.get(i+k,0)+v
#print(dp)
#全部使わない選択肢だけ引いておく
print(dp[0]-1)
#print(dp) |
s202194852 | p04013 | u457554982 | 1574697757 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 309 | [n,a]=list(map(int,input().split()))
xlist=list(map(int,input().split()))
xlist.sort()
for i in range(n):
ave=a*i
dp=[-1 for j in range(ave+1)]
dp[0]=1
for k in xlist:
for l in range(len(xlist)):
if dp[l]!=-1 and l+k<=ave:
if dp[l+k]==-1:
dp[l+k]=0
dp[l+k]+=dp[l]
ans+=dp[-1]
print(ans) |
s440582717 | p04013 | u836737505 | 1574400826 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 338 | def main()
N,A = map(int, input().split())
x = list(map(int, input().split()))
for i in range(1,1 << len(x)):
total = []
for j in range(len(x)):
if ((i >> j) & 1):
total.append(x[j])
if len(total):
if (sum(total)/len(total)) == A:
count += 1
print(count)
main() |
s211143496 | p04013 | u836737505 | 1574352891 | Python | Python (3.4.3) | py | Runtime Error | 2103 | 3060 | 305 | N,A = map(int, input().split())
x = list(map(int, input().split()))
for i in range(1,1 << len(x)):
total = []
for j in range(len(x)):
if ((i >> j) & 1):
total.append(x[j])
if len(total):
if (sum(total)/len(total)) == A:
count += 1
print(count) |
s954403417 | p04013 | u256031597 | 1573874930 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 259 | N, A = map(int, input().split())
X = list(map(int, input().split()))
X2 = [0]*N
for i in range(N):
X2[i] = X[i] - A
C = Counter([0, X2[0]])
for x in X2[1:]:
C2 = Counter()
for s, c in C.items():
C2[s+x] += c
C += C2
print(C[0]-1)
|
s848949993 | p04013 | u256031597 | 1573874869 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3316 | 289 | from collections import Counter
N, A = map(int, input().split())
X = list(map(int, input().split))
X2 = [0]*N
for i in range(N):
X2[i] = X[i] - A
C = Counter([0, X2[0]])
for x in X2[1:]:
C2 = Counter()
for s, c in C.items():
C2[s+x] += c
C += C2
print(C[0]-1) |
s487928686 | p04013 | u779728630 | 1573675361 | Python | Python (3.4.3) | py | Runtime Error | 26 | 4340 | 352 | N, A = map(int, input().split())
X = list(map(int, input().split()))
dp = [[0 for i in range(N + 1)] for j in range(50 * N + 1)] #[Sum, #Cards]
dp[0][0]=1
for i in range(N):#Focus Card [x_i]
#Use x_i
for j in range(N):
for k in range(50 * N + 1):
dp[k + X[i]][j+1] = dp[k][j]
res = 0
for i in range(N+1):
res += dp[i*A][i]
print(res) |
s705781064 | p04013 | u557494880 | 1573430402 | Python | Python (3.4.3) | py | Runtime Error | 332 | 56436 | 531 | N, A = map(int,input().split())
X = list(map(int,input().split()))
dp = [[[0 for i in range(N*A+1)] for j in range(N+1)] for k in range(N+1)]
dp[0][0][0] = 1
for i in range(1,N+1):
x = X[i-1]
for j in range(N):
for k in range(N*M+1):
if k < x:
dp[i][j][k] += dp[i-1][j][k]
elif j > i:
dp[i][j][k] = 0
else:
dp[i][j][k] += dp[i-1][j][k] + dp[i-1][j-1][k-x]
for i in range(1,N+1):
ans += dp[N][i][N*i]
print(ans)
|
s827298586 | p04013 | u755616667 | 1573117777 | Python | PyPy3 (2.4.0) | py | Runtime Error | 397 | 92636 | 712 | N, A = map(int, input().split())
x = list(map(int, input().split()))
total = sum(x)
# dp[i][j][k] := i枚目までからj枚取って、合計をkにする通り数
dp = [[[0] * (total+1) for _ in range(N+1)] for _ in range(N+1)]
dp[0][0][0] = 1
for i in range(N+1):
for j in range(N+1):
for k in range(total+1):
if i >= 1 and x[i-1] > k:
dp[i][j][k] = dp[i-1][j][k]
elif i >= 1 and j >= 1 and x[i-1] <= k:
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k - x[i-1]]
ans = 0
for j in range(1, N+1):
# N枚(カード総数)の中から1枚以上取った時の、j枚取って合計がj*Aの所 の合計
ans += dp[N][j][j*A]
print(ans) |
s781221735 | p04013 | u073852194 | 1573011744 | Python | PyPy3 (2.4.0) | py | Runtime Error | 341 | 94044 | 540 | N,A = map(int,input().split())
x = list(map(int,input().split()))
X = sum(x)
dp = [[[0 for k in range(X+1)] for j in range(N+1)] for i in range(N)]
for i in range(N):
for j in range(i+1):
dp[i][1][x[j]] += 1
for i in range(N-1):
for j in range(1,i+2):
for k in range(X+1):
if 1 <= k-x[i+1] <= X:
dp[i+1][j+1][k] = dp[i][j+1][k] + dp[i][j][k-x[i+1]]
else:
dp[i+1][j+1][k] = dp[i][j+1][k]
ans = 0
for j in range(1,N+1):
ans += dp[N-1][j][A*j]
print(ans) |
s006307615 | p04013 | u223133214 | 1569999657 | Python | PyPy3 (2.4.0) | py | Runtime Error | 390 | 95068 | 572 | n, a = map(int, input().split())
X = list(map(int, input().split()))
# dp[i][j][k] i枚までj枚えらんで合計k
# 答えはdp[n][1..n][a..ak]
dp = [[[0] * 2502 for _ in range(52)]
for __ in range(52)]
dp[0][0][0] = 1
for i in range(0, n):
for j in range(0, n + 1):
for k in range(n * max(X) + 1):
dp[i + 1][j][k] += dp[i][j][k] # 選ぶ
dp[i + 1][j + 1][k + X[i]] += dp[i][j][k] # 選ばない
ans = 0
for i in range(1, n+1):
for j in range(a, 2501):
if i * a == j:
ans += dp[n][i][j]
print(ans)
|
s213127453 | p04013 | u223133214 | 1569999535 | Python | PyPy3 (2.4.0) | py | Runtime Error | 391 | 113244 | 572 | n, a = map(int, input().split())
X = list(map(int, input().split()))
# dp[i][j][k] i枚までj枚えらんで合計k
# 答えはdp[n][1..n][a..ak]
dp = [[[0] * 3500 for _ in range(51)]
for __ in range(51)]
dp[0][0][0] = 1
for i in range(0, n):
for j in range(0, n + 1):
for k in range(n * max(X) + 1):
dp[i + 1][j][k] += dp[i][j][k] # 選ぶ
dp[i + 1][j + 1][k + X[i]] += dp[i][j][k] # 選ばない
ans = 0
for i in range(1, n+1):
for j in range(a, 2501):
if i * a == j:
ans += dp[n][i][j]
print(ans)
|
s900890975 | p04013 | u520276780 | 1569869065 | Python | PyPy3 (2.4.0) | py | Runtime Error | 192 | 43740 | 359 | n, a = map(int,input().split( ))
x = list(map(int,input().split( )))
for i in range(n):
x[i] -= a
mx = max(x)*n+1
dp = [[0 for i in range(3*mx)] for j in range(n)]
dp[0][0] += 1
dp[0][x[0]] += 1
for i in range(1,n) :
for j in range(-mx,mx):
dp[i][j] += dp[i-1][j-x[i]]
dp[i][j] += dp[i-1][j]
#print(*dp[i])
print(dp[n-1][0]-1)
|
s203782518 | p04013 | u701199820 | 1569769479 | Python | PyPy3 (2.4.0) | py | Runtime Error | 528 | 96348 | 594 | n, a = map(int, input().split())
x = [0] + list(map(int, input().split()))
nx = n*max(x)
# DP: x1からxjまでの間でk枚を選んで合計がsになる組み合わせの数
dp = [ [ [0 for s in range(nx+1)] for k in range(n+1)] for j in range(n+1)]
dp[0][0][0] = 1
for j in range(1, n+1):
for k in range(n+1):
for s in range(nx+1):
if x[j] > s:
dp[j][k][s] = dp[j-1][k][s]
elif k >= 1:
dp[j][k][s] = dp[j-1][k][s] + dp[j-1][k-1][s-x[j]]
#print(dp)
ans = 0
for k in range(1, n+1):
ans += dp[-1][k][a * k]
print(ans)
|
s919654031 | p04013 | u920543723 | 1569531723 | Python | Python (3.4.3) | py | Runtime Error | 2156 | 705040 | 560 | import itertools
import numpy as np
from math import factorial
n = list(map(int, input().split()))
x = np.array(list(map(int, input().split())))
x = x - n[1]
b = len(x) - np.count_nonzero(x)
x = [i for i in x if i != 0]
x = np.sort(x)
c = 0
for i in range(1, b + 1):
c += factorial(b) / factorial(i) / factorial(b - i)
cnt = c
for i in range(2, n[0] + 1):
a = np.array(list(itertools.combinations(x, i)))
if sum(a[0]) > 0:
break
a = np.sum(a, axis = 1)
cnt += (c + 1) * (len(a) - np.count_nonzero(a))
print(int(cnt)) |
s717593615 | p04013 | u404794295 | 1569245439 | Python | Python (3.4.3) | py | Runtime Error | 2107 | 56436 | 569 | inp=input().split(" ")
N=int(inp[0])
A=int(inp[1])
x=list(map(int, input().split(" ")))
x=[0]+x
X=max(x)
dp=[[[0 for i in range(N*X+1)] for j in range(N+1)] for k in range(N+1)]
for j in range(N+1):
for k in range(N+1):
for s in range(N*X+1):
if j==0 and k==0 and s==0:
dp[j][k][s]=1
elif j>=1 and s<x[j]:
dp[j][k][s]=dp[j-1][k][s]
elif j>=1 and k>=1 and s>=x[j]:
dp[j][k][s]=dp[j-1][k][s]+dp[j-1][k-1][s-x[j]]
else:
dp[j][k][s]=0
print(sum(dp[N][k][k*A] for k in range(1,N+1)))
|
s821130802 | p04013 | u670180528 | 1568948210 | Python | Python (3.4.3) | py | Runtime Error | 325 | 5216 | 610 | from collections import Counter
from operator import mul
from functools import reduce
def cmb(n,r):
if n < r:return 0
if r == 0 or n-r == 0:return 1
r = min(n-r,r)
u = reduce(mul, range(n, n-r, -1))
d = reduce(mul, range(1,r+1))
return u//d
n,a,*x = map(int,open(0).read().split())
dp = [[0]*(n*max(x)+1)for _ in range(n+1)]
dp[0][0] = 1
lim1 = lim2 = 1
for k,v in Counter(x).items():
for i in range(1,v+1):
c = cmb(v,i)
for j in range(lim1)[::-1]:
for s in range(lim2)[::-1]:
dp[j+i][s+k*i] += dp[j][s]*c
lim1 += v
lim2 += k*v
cnt = 0
for i in range(1,n+1):
cnt += dp[i][i*a]
print(cnt) |
s839883183 | p04013 | u572002343 | 1568231872 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 839 | from collections import defaultdict
pair_memo = {}
def pair_pattern(a, b=None):
if 0 in [a, b]:
return 0
if b in [None, 1]:
return a
if a == 1:
return b
key = f"{a},{b}"
if key in pair_memo:
return pair_memo[key]
pair_memo[key] = pair_pattern(a - 1, b) * pair_pattern(a, b - 1) - 1
return pair_memo[key]
def sign_special(x):
if x >= 0:
return 0
else:
return 1
if __name__ == "__main__":
n, a = map(int, input().split())
list_x = list(map(int, input().split()))
elem = lambda : [0, 0]
x_group_by_abs = defaultdict(elem)
x_group_by_abs[0] = [0]
for x in list_x:
x_group_by_abs[abs(x - a)][sign_special(x - a)] += 1
ans = 1
for x_g in x_group_by_abs.values():
p = pair_pattern(*x_g)
print(f"{x_g}: {p}")
ans *= p + 1
ans -= 1
print(ans)
|
s550243845 | p04013 | u408620326 | 1567199762 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3088 | 401 | N, A = [int(x) for x in input().split()]
X = [int(x) for x in input().split()]
# mat = {}
def dp(i, x):
if i == N:
if len(x) and sum(x) == A * len(x):
return 1
else:
return 0
elif len(x) and (i, sum(x)/len(x)) in mat:
return mat[(i, sum(x)/len(x))]
ret = dp(i + 1, x) + dp(i + 1, x + [X[i]])
# if len(x):
# mat[i, sum(x)/len(x)] = ret
return ret
print(dp(0, [])) |
s032037360 | p04013 | u652057333 | 1566991551 | Python | PyPy3 (2.4.0) | py | Runtime Error | 490 | 95964 | 645 | n, a = map(int, input().split())
x = list(map(int, input().split()))
x_max = max(x)
dp = [[[0 for _ in range(n*x_max+1)] for _ in range(n+1)] for _ in range(n+1)]
for i in range(n+1):
for j in range(n+1):
for k in range(n*x_max+1):
if i == 0 and j == 0 and k == 0:
dp[i][j][k] = 1
elif i >= 1 and k < x[i-1]:
dp[i][j][k] = dp[i-1][j][k]
elif i >= 1 and j >= 1 and k >= x[i-1]:
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k - x[i-1]]
else:
dp[i][j][k] = 0
ans = 0
for k in range(n+1):
ans += dp[n][k][k*a]
print(ans-1) |
s309382612 | p04013 | u594956556 | 1566780991 | Python | Python (3.4.3) | py | Runtime Error | 202 | 4980 | 489 | n,a=map(int,input().split())
x=list(map(int,input().split()))
y=[i-a for i in x]
y.sort()
minus=[-i for i in y if i<0]
minus.sort()
plus=[i for i in y if i>0]
zero=len([i for i in y if i==0])
ma=max(y)*n
ny=ma*2
dp=[[0]*(ny+1) for _ in range(n+1)]
for i in range(n+1):
for j in range(ny+1):
if i==0 and j==ma:
dp[i][j]=1
elif i>=1:
sa=j-y[i-1]
if sa<0 or sa>ny:
dp[i][j]=dp[i-1][j]
else:
dp[i][j]=dp[i-1][j]+dp[i-1][sa]
print(dp[n][ma]-1) |
s135223788 | p04013 | u970308980 | 1566767869 | Python | PyPy3 (2.4.0) | py | Runtime Error | 176 | 38384 | 416 | # 配るDP
N, A = map(int, input().split())
X = list(map(int, input().split()))
dp = [[[0 for _ in range(2500+１０)] for __ in range(N+1)] for ___ in range(N+1)]
dp[0][0][0] = 1
for i in range(N):
for j in range(N):
for k in range(2500+1):
dp[i+1][j][k] += dp[i][j][k]
dp[i+1][j+1][k+X[i]] += dp[i][j][k]
ans = 0
for n in range(1, N+1):
ans += dp[N][n][n*A]
print(ans)
|
s876652613 | p04013 | u970308980 | 1566767788 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 417 | # 配るDP
N, A = map(int, input().split())
X = list(map(int, input().split()))
dp = [[[0 for _ in range(３０１０)] for __ in range(N+1)] for ___ in range(N+1)]
dp[0][0][0] = 1
for i in range(N):
for j in range(N):
for k in range(2500+1):
dp[i+1][j][k] += dp[i][j][k]
dp[i+1][j+1][k+X[i]] += dp[i][j][k]
ans = 0
for n in range(1, N+1):
ans += dp[N][n][n*A]
print(ans)
|
s100310417 | p04013 | u970308980 | 1566767695 | Python | Python (3.4.3) | py | Runtime Error | 2107 | 56436 | 412 | # 配るDP
N, A = map(int, input().split())
X = list(map(int, input().split()))
dp = [[[0 for _ in range(2500+10)] for __ in range(N+1)] for ___ in range(N+1)]
dp[0][0][0] = 1
for i in range(N):
for j in range(N):
for k in range(2500+1):
dp[i+1][j][k] += dp[i][j][k]
dp[i+1][j+1][k+X[i]] += dp[i][j][k]
ans = 0
for n in range(1, N+1):
ans += dp[N][n][n*A]
print(ans)
|
s664274479 | p04013 | u350248178 | 1566635490 | Python | Python (3.4.3) | py | Runtime Error | 158 | 5108 | 357 | n,a=[int(i) for i in input().split()]
x=[int(i) for i in input().split()]
y=[i-a for i in x]
m=sum(x)+1
dp=[[0 for j in range(m*2+1)] for i in range(n+1)]
dp[0][0]=1
for i in range(1,n+1):
for j in range(-m,1+m):
if j-y[i-1]>=-m:
dp[i][j]=dp[i-1][j]+dp[i-1][j-y[i-1]]
else:
dp[i][j]=dp[i-1][j]
print(dp[n][0]-1)
|
s167167537 | p04013 | u842689614 | 1566077627 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3264 | 1543 | N,A=map(int,input().split())
x=sorted(list(map(int,input().split())))
xn=[x[i]-A for i in range(len(x)) if x[i]<A]
xn.reverse()
x0=[0 for i in range(len(xn),len(x)) if x[i]==A]
xp=[x[i]-A for i in range(len(xn)+len(x0),len(x)) if x[i]>A]
sxn=[0]
sxn_n=[1]
for x in xn:
sxn_add=[]
sxn_n_i=[]
for j in range(len(sxn)):
sxn_tmp=sxn[j]+x
for k in range(j,len(sxn)):
if sxn[k]<=sxn_tmp or k==len(sxn)-1:
if sxn[k]==sxn_tmp:
sxn_n_i.append([k,sxn_n[j]])
elif sxn[k]<sxn_tmp:
sxn_add.append([k,sxn_tmp,sxn_n[j]])
else:
sxn_add.append([k+1,sxn_tmp,sxn_n[j]])
break
for k in range(len(sxn_add)):
sxn.insert(k+sxn_add[k][0],sxn_add[k][1])
sxn_n.insert(k+sxn_add[k][0],1)
for l in sxn_n_i:
sxp_n[l[0]]+=l[1]
sxp=[0]
sxp_n=[1]
for x in xp:
sxp_add=[]
sxp_n_i=[]
for j in range(len(sxp)):
sxp_tmp=sxp[j]+x
for k in range(j,len(sxp)):
if sxp[k]>=sxp_tmp or k==len(sxp)-1:
if sxp[k]==sxp_tmp:
sxp_n_i.append([k,sxp_n[j]])
elif sxp[k]>sxp_tmp:
sxp_add.append([k,sxp_tmp,sxp_n[j]])
else:
sxp_add.append([k+1,sxp_tmp,sxp_n[j]])
break
for k in range(len(sxp_add)):
sxp.insert(k+sxp_add[k][0],sxp_add[k][1])
sxp_n.insert(k+sxp_add[k][0],sxp_add[k][2])
for l in sxp_n_i:
sxp_n[l[0]]+=l[1]
an=0
for i in range(1,len(sxp)):
for j in range(1,len(sxn)):
if sxp[i]==-sxn[j]:
an+=sxp_n[i]*sxn_n[j]
break
print(2**len(x0)-1+an*2**(len(x0))) |
s387980180 | p04013 | u672475305 | 1565832371 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 528 | num,ave = map(int,input().split())
numx = list(map(int,input().split()))
L = len(numx)
numy = [0] * L
for i in range(L):
numy[i] = numx[i] - ave
if abs(min(numy)) < abs(max(numy)):
maxX = max(numy)
else:
maxX = abs(min(numy))
dp = [[0]*(2*maxX*L+1) for _ in range(L+1)]
dp[0][maxX*L] = 1
for i in range(L):
for j in range(2*maxX*L+1):
if (j-numy[i]) < 0 or (j - numy[i]) > 2*maxX*L:
dp[i+1][j] = dp[i][j]
else
dp[i+1][j] = dp[i][j] + dp[i][j-numy[i]]
print(dp[L][maxX*L]-1) |
s156508334 | p04013 | u457554982 | 1565717870 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 299 | [n,a]=list(map(int,input().split()))
xlist=list(map(int,input().split()))
counter=0
wa=0
for kazu in range(1,2**(n+1))
keisu=[]
for i in reversed(range(0,n)):
keisu.append(kazu//(2**i))
for i in range(n):
wa+=keisu[i]*xlist[i]
kosu=keisu.count(1)
if wa==kosu*a:
counter+=1
print(counter) |
s141304431 | p04013 | u333190709 | 1565268235 | Python | Python (3.4.3) | py | Runtime Error | 2109 | 60500 | 1155 | #!/usr/bin/env python3
import sys, math, fractions, itertools
def solve(N: int, A: int, x: "List[int]"):
X = max(x)
dp = [[[0 for _ in range(N*X+1)] for _ in range(N+1) ] for _ in range(N+1)]
dp[0][0][0] = 1
for n in range(N+1):
for m in range(N+1):
for k in range(N*X+1):
if n >= 1 and k < x[n-1]:
dp[n][m][k] = dp[n-1][m][k]
elif n >= 1 and m >= 1 and k >= x[n-1]:
dp[n][m][k] = dp[n-1][m][k] + dp[n-1][m-1][k-x[n-1]]
s = 0
for i in range(1, N+1):
s += dp[N][i][i*A]
print(s)
return
# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
A = int(next(tokens)) # type: int
x = [ int(next(tokens)) for _ in range(N) ] # type: "List[int]"
solve(N, A, x)
if __name__ == '__main__':
main()
|
s105738759 | p04013 | u687044304 | 1565143629 | Python | Python (3.4.3) | py | Runtime Error | 470 | 73588 | 830 | # -*- coding:utf-8 -*-
def solve():
N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
# dp[i][j] := 左からi+1枚目までにj枚を選んで、選んだカードの総和がkになるカードの選び方
dp = [[[0 for _ in range(N+1)] for __ in range(N+1)] for ___ in range(50*51+1)]
dp[0][0][0] = 1 # 何も選んでない初期値
for i in range(0, N):
for j in range(0, N):
for k in range(50*50+1):
if dp[i][j][k] != 0:
dp[i+1][j][k] += dp[i][j][k] # i枚目を選ばない
dp[i+1][j+1][k] += dp[i][j][k-X[i]] # i枚目を選んだ
ans = 0
for j in range(1, N+1): # 1枚以上選ぶ必要がある
ans += dp[N][j][j*A]
print(ans)
if __name__ == "__main__":
solve()
|
s554087731 | p04013 | u584174687 | 1564780262 | Python | PyPy3 (2.4.0) | py | Runtime Error | 528 | 95708 | 781 | from collections import Counter
def main():
num, avg = map(int, input().split())
data = list(map(int, input().split()))
dp = [[[0 for i in range(max(num, avg) * max(data) + 1)] for j in range(num + 1)] for k in range(num + 1)]
dp[0][0][0] = 1
for i in range(1, num + 1):
now_card = data[i - 1]
for j in range(num + 1):
for k in range(max(num, avg) * max(data) + 1):
# print(i, j, k)
dp[i][j][k] += dp[i - 1][j][k]
if k - now_card >= 0 and j - 1 >= 0:
dp[i][j][k] += dp[i - 1][j - 1][k - now_card]
# print(dp[i][j])
ans = 0
for i in range(1, num + 1):
ans += dp[num][i][i * avg]
print(ans)
if __name__ == '__main__':
main()
|
s027771450 | p04013 | u584174687 | 1564779277 | Python | PyPy3 (2.4.0) | py | Runtime Error | 538 | 95836 | 761 |
from collections import Counter
def main():
num, avg = map(int, input().split())
data = list(map(int, input().split()))
dp = [[[0 for i in range(num * max(data) + 1)] for j in range(num + 1)] for k in range(num + 1)]
dp[0][0][0] = 1
for i in range(1, num + 1):
now_card = data[i - 1]
for j in range(num + 1):
for k in range(num * max(data) + 1):
# print(i, j, k)
dp[i][j][k] += dp[i - 1][j][k]
if k - now_card >= 0 and j - 1 >= 0:
dp[i][j][k] += dp[i - 1][j - 1][k - now_card]
# print(dp[i][j])
ans = 0
for i in range(1, num + 1):
ans += dp[num][i][i * avg]
print(ans)
if __name__ == '__main__':
main() |
s410374112 | p04013 | u687044304 | 1564616903 | Python | Python (3.4.3) | py | Runtime Error | 1046 | 65392 | 924 | # -*- coding:utf-8 -*-
"""解説
dp[j][k][s] := x1,...,xjから k枚選んで xiの合計をsにするような選び方の総数
[@lilium氏]
https://atcoder.jp/contests/abc044/submissions/5887235
"""
def solve():
N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
max_x = max(X)
dp = [[[0 for _ in range(N*max_x+1)] for __ in range(N+1)] for ___ in range(N+1)]
dp[0][0][0] = 1
# dp[i][j][k] := i枚のうちj枚を選んで、和がkになる組み合わせ
for i in range(N):
for j in range(N):
for k in range(N*max_x+1):
if dp[i][j][k] != 0:
dp[i+1][j][k] += dp[i][j][k] # i枚目を選ばなかった
dp[i+1][j+1][k+X[i]] += dp[i][j][k] # i枚目を選んだ
ans = 0
for j in range(1, N+1):
ans += dp[N][j][j*A]
print(ans)
if __name__ == "__main__":
solve()
|
s934291001 | p04013 | u800258529 | 1564115828 | Python | Python (3.4.3) | py | Runtime Error | 91 | 4468 | 330 | n,a=map(int,input().split())
x=list(map(lambda x:int(x)-a,input().split()))
m=min(x)*n;M=max(x)*n+1
if max(x)<0 or min(x)>0:print(0);exit()
dp=[[0]*(M-m) for _ in range(n)]
dp[0][x[0]]+=1
dp[0][0]+=1
for i in range(n-1):
for j in range(m,M):
dp[i+1][j+x[i+1]]+=dp[i][j]
dp[i+1][j]+=dp[i][j]
print(dp[n-1][0]-1) |
s519726723 | p04013 | u800258529 | 1564115613 | Python | Python (3.4.3) | py | Runtime Error | 91 | 4468 | 320 | n,a=map(int,input().split())
x=list(map(lambda x:int(x)-a,input().split()))
m=min(x)*n;M=max(x)*n+1
if M<0 or m>0:print(0);exit()
dp=[[0]*(M-m) for _ in range(n)]
dp[0][x[0]]+=1
dp[0][0]+=1
for i in range(n-1):
for j in range(m,M):
dp[i+1][j+x[i+1]]+=dp[i][j]
dp[i+1][j]+=dp[i][j]
print(dp[n-1][0]-1) |
s853257223 | p04013 | u800258529 | 1564113898 | Python | Python (3.4.3) | py | Runtime Error | 56 | 4580 | 348 | n,a=map(int,input().split())
x=list(map(lambda x:int(x)-a,input().split()))
m=min(x)*n;M=max(x)*n+1
dp=[[0]*(M-m) for _ in range(n)]
dp[0][x[0]]+=1
dp[0][0]+=1
for i in range(n-1):
for j in range(m,M):
if dp[i][j]!=0:
if j+x[i+1] in range(m,M):dp[i+1][j+x[i+1]]+=dp[i][j]
dp[i+1][j]+=dp[i][j]
print(dp[n-1][0]-1) |
s734806563 | p04013 | u800258529 | 1564113663 | Python | Python (3.4.3) | py | Runtime Error | 45 | 4596 | 322 | n,a=map(int,input().split())
x=list(map(lambda x:int(x)-a,input().split()))
m=min(x)*n;M=max(x)*n+1
dp=[[0]*(M-m) for _ in range(n)]
dp[0][x[0]]+=1
dp[0][0]+=1
for i in range(n-1):
for j in range(m,M):
if dp[i][j]!=0:
dp[i+1][j+x[i+1]]+=dp[i][j]
dp[i+1][j]+=dp[i][j]
print(dp[n-1][0]-1) |
s661801222 | p04013 | u631277801 | 1563970356 | Python | PyPy3 (2.4.0) | py | Runtime Error | 432 | 93660 | 834 | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())
n, a = li()
x = list(li())
dp = [[[0]*(n*max(x)+1) for _ in range(n+1)] for _ in range(n+1)]
dp[0][0][0] = 1
for i in range(1, n+1):
for j in range(n+1):
for k in range(n*max(x) + 1):
dp[i][j][k] += (dp[i-1][j-1][k-x[i-1]] if (j-1 >= 0 and k-x[i-1] >= 0) else 0)\
+ dp[i-1][j][k]
ans = 0
for i in range(1,n+1):
ans += dp[n][i][a*i]
print(ans) |
s613642419 | p04013 | u567434159 | 1562901964 | Python | Python (3.4.3) | py | Runtime Error | 1202 | 5492 | 433 | n, avg = map(int, input().split())
a = list(map(int, input().split()))
mxsm = sum(a) + 5
dp = [[0] * mxsm for _ in range(n + 5)]
dp[0][0] = 1
rs = 0
for x in a:
dp2 = [[it1 for it1 in lin] for lin in dp]
for i in range(1, n + 1):
for j in range(x, mxsm + 1):
if dp[i - 1][j - x]:
dp2[i][j] += dp[i - 1][j - x]
dp = dp2
for i in range(1, n + 1):
rs += dp[i][avg * i]
print(rs)
|
s748855534 | p04013 | u644778646 | 1562512645 | Python | PyPy3 (2.4.0) | py | Runtime Error | 507 | 112476 | 439 | N,A = map(int,input().split())
x = list(map(int,input().split()))
xsum =sum(x)
dp = [ [ [ 0 for j in range(N+1)] for i in range(xsum+1) ] for k in range(N+1)]
dp[0][0][0] = 1
for i in range(N):
for j in range(xsum+1):
for k in range(N):
if j - x[i] >=0:
dp[i+1][j][k+1] = dp[i][j-x[i]][k]
dp[i+1][j][k] += dp[i][j][k]
ans = 0
for k in range(1,N+1):
ans += dp[N][A*k][k]
print(ans)
|
s557774272 | p04013 | u450339194 | 1561692682 | Python | PyPy3 (2.4.0) | py | Runtime Error | 478 | 96092 | 635 | nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()
N, A = nl()
X = nl()
dp = []
for i in range(N+1):
r = []
for j in range(N+1):
r.append([0 for k in range(N*max(X)+1)])
dp.append(r)
dp[0][0][0] = 1
for i in range(1, N+1):
for j in range(0, N+1):
for k in range(N*max(X)+1):
if k < X[i-1]:
dp[i][j][k] = dp[i-1][j][k]
elif j > 0 and k >= X[i-1]:
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k-X[i-1]]
total = 0
for k in range(1, N+1):
total += dp[N][k][k*A]
print(total)
|
s710847434 | p04013 | u450339194 | 1561692538 | Python | PyPy3 (2.4.0) | py | Runtime Error | 457 | 96092 | 619 | nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()
N, A = nl()
X = nl()
dp = []
for i in range(N+1):
r = []
for j in range(N+1):
r.append([0 for k in range(N*max(X)+1)])
dp.append(r)
dp[0][0][0] = 1
for i in range(1, N+1):
for j in range(0, N+1):
for k in range(N*max(X)+1):
if k < X[i-1]:
dp[i][j][k] = dp[i-1][j][k]
elif j > 0:
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k-X[i-1]]
total = 0
for k in range(1, N+1):
total += dp[N][k][k*A]
print(total)
|
s641960436 | p04013 | u263830634 | 1561428518 | Python | PyPy3 (2.4.0) | py | Runtime Error | 174 | 38384 | 915 | import numpy as np
N, A = map(int, input().split())
x = list(map(int, input().split()))
X = max(x)
if X < A:
X = A
def check(j, k, s):
if dp[j][k][s] != -1:
return dp[j][k][s]
if j == 0 and k == 0 and s == 0:
dp[j][k][s] = 1
return 1
if j >= 1 and s < x[j-1]:
a = check(j-1, k ,s)
dp[j][k][s] = a
return a
if j >= 1 and k >= 1 and s >= x[j-1]:
a = check(j-1, k, s) + check(j-1, k-1, s-x[j-1])
dp[j][k][s] = a
return a
dp[j][k][s] = 0
return 0
dp = [[[-1] * (N*X+1) for _ in range(N+1)] for _ in range(N + 1)]
# dp = np.array(dp)
# print (dp)
# for j in range(N+1):
# for k in range(N+1):
# for s in range(N*X + 1):
# print (j, k, s)
# dp[j][k][s] = check(j, k, s)
ans = 0
for k in range(1, N+1):
ans += check(N, k, k * A)
# ans += dp[N][k][k * A]
print (ans) |
s086234280 | p04013 | u263830634 | 1561428430 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38256 | 913 | import numpy as np
N, A = map(int, input().split())
x = list(map(int, input().split()))
X = max(x)
if X < A:
X = A
def check(j, k, s):
if dp[j][k][s] != -1:
return dp[j][k][s]
if j == 0 and k == 0 and s == 0:
dp[j][k][s] = 1
return 1
if j >= 1 and s < x[j-1]:
a = check(j-1, k ,s)
dp[j][k][s] = a
return a
if j >= 1 and k >= 1 and s >= x[j-1]:
a = check(j-1, k, s) + check(j-1, k-1, s-x[j-1])
dp[j][k][s] = a
return a
dp[j][k][s] = 0
return 0
dp = [[[-1] * (N*X+1) for _ in range(N+1)] for _ in range(N + 1)]
dp = np.array(dp)
# print (dp)
# for j in range(N+1):
# for k in range(N+1):
# for s in range(N*X + 1):
# print (j, k, s)
# dp[j][k][s] = check(j, k, s)
ans = 0
for k in range(1, N+1):
ans += check(N, k, k * A)
# ans += dp[N][k][k * A]
print (ans) |
s782156003 | p04013 | u263830634 | 1561427978 | Python | Python (3.4.3) | py | Runtime Error | 2157 | 808852 | 928 | import numpy as np
N, A = map(int, input().split())
x = list(map(int, input().split()))
X = max(x)
if X < A:
X = A
def check(j, k, s):
if dp[j][k][s] != -1:
return dp[j][k][s]
if j == 0 and k == 0 and s == 0:
dp[j][k][s] = 1
return 1
if j >= 1 and s < x[j-1]:
a = check(j-1, k ,s)
dp[j][k][s] = a
return a
if j >= 1 and k >= 1 and s >= x[j-1]:
a = check(j-1, k, s) + check(j-1, k-1, s-x[j-1])
dp[j][k][s] = a
return a
dp[j][k][s] = 0
return 0
dp = [[[-1] * (10 * N+1) for _ in range(10 * N+1)] for _ in range(10 * N*X + 1)]
dp = np.array(dp)
# print (dp)
# for j in range(N+1):
# for k in range(N+1):
# for s in range(N*X + 1):
# print (j, k, s)
# dp[j][k][s] = check(j, k, s)
ans = 0
for k in range(1, N+1):
ans += check(N, k, k * A)
# ans += dp[N][k][k * A]
print (ans) |
s082662024 | p04013 | u457423258 | 1561061013 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 226 | N, A = map(int, input().split())
X = list(map(int, input().split()))
for i in range(N):
X[i] -= A
dp = defaultdict(int)
dp[0] = 1
for x in X:
for j, c in list(dp.items()):
dp[j + x] += c
print(dp[0]-1)
|
s179010656 | p04013 | u865741247 | 1560373895 | Python | PyPy3 (2.4.0) | py | Runtime Error | 361 | 99932 | 612 |
N,A = list(map(int,input().split(" ")))
nums = list(map(int,input().split(" ")))
dp = [[[0 for i in range(2800)]for j in range(50)]for k in range(50)]
# dp[i][j][k] → i枚のうちj枚を選んで 和が kになる組み合わせ
dp[0][0][0] = 1
for i in range(N):
for j in range(N):
for k in range(2501):
if dp[i][j][k] != 0:
dp[i+1][j][k] += dp[i][j][k] #i枚目を選ばなかった世界線
dp[i + 1][j + 1][k + nums[i]] += dp[i][j][k] #i枚目を選んだ世界線
ans = 0
for j in range(1,N+1):
ans += dp[N][j][j*A]
print(ans) |
s913972249 | p04013 | u271469978 | 1559351079 | Python | Python (3.4.3) | py | Runtime Error | 2108 | 58484 | 613 | n, a = map(int, input().split())
x = list(map(int, input().split()))
dp = [[[0 for s in range(n * 50)] for k in range(n + 1)] for j in range(n + 1)]
for j in range(n + 1):
for k in range(n + 1):
for s in range(n * 50):
if (j == 0) and (k == 0) and (s == 0):
dp[j][k][s] = 1
elif (j > 0) and (s < x[j - 1]):
dp[j][k][s] = dp[j - 1][k][s]
elif (j > 0) and (k > 0) and (s >= x[j - 1]):
dp[j][k][s] = dp[j - 1][k][s] + dp[j - 1][k - 1][s - x[j - 1]]
ans = 0
for k in range(1, n + 1):
ans += dp[j][k][k * a]
print(ans) |
s712692752 | p04013 | u006657459 | 1559270818 | Python | Python (3.4.3) | py | Runtime Error | 2107 | 58612 | 527 | from itertools import product
N, A = map(int, input().split())
x = list(map(int, input().split()))
x_max = max(x)
dp = [[[0 for s in range(x_max * (N + 1))] for n in range(N + 1)] for i in range(N + 1)]
dp[0][0][0] = 1
for i, n, s in product(range(1, N + 1), range(N + 1), range(x_max * (N + 1))):
if s < x[i - 1]:
dp[i][n][s] = dp[i - 1][n][s]
elif 0 < n and x[i - 1] <= s:
dp[i][n][s] = dp[i - 1][n][s] + dp[i - 1][n - 1][s - x[i - 1]]
ans = sum([dp[N][n][n*A] for n in range(1, N + 1)])
print(ans) |
s672559010 | p04013 | u006657459 | 1559270502 | Python | Python (3.4.3) | py | Runtime Error | 2109 | 56692 | 523 | from itertools import product
N, A = map(int, input().split())
x = list(map(int, input().split()))
x_max = max(x)
dp = [[[0 for s in range(x_max * N + 1)] for n in range(N + 1)] for i in range(N + 1)]
dp[0][0][0] = 1
for i, n, s in product(range(1, N + 1), range(N + 1), range(x_max * N + 1)):
if s < x[i - 1]:
dp[i][n][s] = dp[i - 1][n][s]
elif 0 < n and x[i - 1] <= s:
dp[i][n][s] = dp[i - 1][n][s] + dp[i - 1][n - 1][s - x[i - 1]]
ans = sum([dp[N][n][n*A] for n in range(1, N + 1)])
print(ans) |
s807473449 | p04013 | u222744685 | 1559269795 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 274 | n, a = map(int, input().split())
xs = list(map(int, input().split()))
dp = [[0]*2501] * 51
for x in xs:
dp[1][x] = 1
for i in range(2,n+1):
for j in range(1,2501):
for x in xs[i-1:]
dp[i][j] = dp[i-1][j-x]
ans = 0
for ys in dp:
ans += ys[n*a]
print(ans) |
s412569478 | p04013 | u365364616 | 1559012525 | Python | Python (3.4.3) | py | Runtime Error | 2107 | 56436 | 632 | n, a = map(int, input().split())
x = list(map(int, input().split()))
x_max = max(x)
x_sum = sum(x)
if x_max < a:
print(0)
else:
dp = [[[0 for k in range(x_sum + 1)] for j in range(n + 1)] for i in range(n + 1)]
dp[0][0][0] = 1
for i in range(1, n + 1):
for j in range(n + 1):
for k in range(x[i - 1]):
dp[i][j][k] = dp[i - 1][j][k]
if j > 0:
for k in range(x[i - 1], x_sum + 1):
dp[i][j][k] = dp[i - 1][j][k] + dp[i - 1][j - 1][k - x[i - 1]]
ans = 0
for j in range(1, n + 1):
ans += dp[-1][j][j * a]
print(ans)
|
s943535742 | p04013 | u365364616 | 1559011710 | Python | Python (3.4.3) | py | Runtime Error | 2107 | 57460 | 539 | n, a = map(int, input().split())
x = list(map(int, input().split()))
x_max = max(x)
dp = [[[0 for k in range(n * x_max + 1)] for j in range(n + 1)] for i in range(n + 1)]
dp[0][0][0] = 1
for i in range(1, n + 1):
for j in range(n + 1):
for k in range(x[i - 1]):
dp[i][j][k] = dp[i - 1][j][k]
if j > 0:
for k in range(x[i - 1], n * x_max + 1):
dp[i][j][k] = dp[i - 1][j][k] + dp[i - 1][j - 1][k - x[i - 1]]
ans = 0
for j in range(1, n + 1):
ans += dp[-1][j][j * a]
print(ans)
|
s240672931 | p04013 | u729133443 | 1558674142 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 478 | def main():
n,a,*x=map(int,open(0).read().split())
x=[0]+x
dp=[[[0]*(50*n+1)for j in range(n+1)]for i in range(n+1)]
dp[0][0][0]=1
for i in range(1,n+1):
dp[i][0]=dp[i-1][0]
for j in range(1,n+1):
for k in range(1,50*n+1):
dp[i][j][k]=dp[i-1][j][k]
if k-x[i]>=0:
dp[i][j][k]+=dp[i-1][j-1][k-x[i]]
ans=0
for i in range(1,n+1):
j=i*a
if j<50*n+2:
ans+=dp[-1][i][j]
print(ans)
def __name__=='__main__':
main() |
s408937402 | p04013 | u163320134 | 1558490142 | Python | Python (3.4.3) | py | Runtime Error | 1927 | 54004 | 414 | n,a=map(int,input().split())
arr=list(map(int,input().split()))
l=sum(arr)
dp=[[[0]*(l+1) for _ in range(n+1)] for _ in range(n+1)]
dp[0][0][0]=1
for i in range(1,n+1):
xi=arr[i-1]
for j in range(0,i+1):
for k in range(0,l+1):
if k<xi:
dp[i][j][k]=dp[i-1][j][k]
elif j>=1:
dp[i][j][k]=dp[i-1][j][k]+dp[i-1][j-1][k-xi]
ans=0
for i in range(1,n+1):
ans+=dp[n][i][i*a]
print(ans) |
s940955766 | p04013 | u037430802 | 1557317717 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 586 | N, A = map(int, input().split())
x = list(map(int, input().split()))
tmp_max = max(x)
tmp_max = max(tmp_max, A)
dp = [[[0 for _ in range(tmp_max * N + 1)] for _ in range(N + 1)] for _ i range(N + 1)]
dp[0][0][0] = 0
for j in range(N + 1):
for k in range(j + 1):
for s in range(tmp_max * k + 1):
if j >= 1 and s < x[j - 1]:
dp[j][k][s] = dp[j - 1][k][s]
elif j >= 1 and k >= 1 and s >= x[j - 1]:
dp[j][k][s] = dp[j - 1][k][s] + dp[j - 1][k - 1][s - x[j - 1]]
ans = 0
for k in range(1, N + 1):
ans += dp[N][k][k * A]
print(ans) |
s816233047 | p04013 | u037430802 | 1557317649 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 586 | N, A = map(int, input().split())
x = list(map(int, input().split()))
tmp_max = max(x)
tmp_max = max(tmp_max, A)
dp = [[[0 for _ in range(tmp_max * N + 1)] for _ in range(N + 1)] for _ i range(N + 1)]
dp[0][0][0] = 0
for j in range(N + 1):
for k in range(j + 1):
for s in range(tmp_max * K + 1):
if j >= 1 and s < x[j - 1]:
dp[j][k][s] = dp[j - 1][k][s]
elif j >= 1 and k >= 1 and s >= x[j - 1]:
dp[j][k][s] = dp[j - 1][k][s] + dp[j - 1][k - 1][s - x[j - 1]]
ans = 0
for k in range(1, N + 1):
ans += dp[N][k][k * A]
print(ans) |
s796312645 | p04013 | u037430802 | 1557317573 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 586 | N, A = map(int, input().split())
x = list(map(int, input().split()))
tmp_max = max(x)
tmp_max = max(tmp_max, A)
dp = [[[0 for _ in range(tmp_max * N + 1)] for _ in range(N + 1)] for _ i range(N + 1)]
dp[0][0][0] = 0
for j in range(n + 1):
for k in range(j + 1):
for s in range(tmp_max * K + 1):
if j >= 1 and s < x[j - 1]:
dp[j][k][s] = dp[j - 1][k][s]
elif j >= 1 and k >= 1 and s >= x[j - 1]:
dp[j][k][s] = dp[j - 1][k][s] + dp[j - 1][k - 1][s - x[j - 1]]
ans = 0
for k in range(1, n + 1):
ans += dp[N][k][k * A]
print(ans) |
s496031681 | p04013 | u655834330 | 1556509715 | Python | Python (3.4.3) | py | Runtime Error | 2109 | 21348 | 1651 |
import numpy as np
def read_input():
n, a = map(int, input().split())
xlist = list(map(int, input().split()))
return n, a, xlist
def submit():
n, a, xlist = read_input()
if a > max(xlist):
print(0)
dp = np.zeros((n + 1, n + 1, (n + 1) * max(xlist)))
# dp[j][k][s] : j枚目までのカードでk枚選び、合計sにする方法の数
# (1) dp[0][0][0] : 1枚も選ばずに合計0にする方法は1種類
# j = k = s = 0のとき
# (2) dp[j][k][s] = dp[j - 1][k][s] if xj > s : j枚目のカードがsより大きいとき、sを作りようがないのでj-1枚目までの手法と一緒
# j > 0, xj > sのとき
# (3) dp[j][k][s] = dp[j - 1][k][s] + dp[j - 1][k - 1][s - xj]
# : xj <= sのとき、j-1枚目まででsを作る方法と、j-1枚目まででs-xjをつくり、j枚目を選んでk枚にする
# j > 0, k > 0, s >= xjのとき
# (4) dp上記以外は無理なので0
for j in range(n + 1):
for k in range(n + 1):
for s in range((n + 1) * max(xlist)):
if j == k == s == 0:
dp[j][k][s] = 1
elif j > 0 and xlist[j - 1] > s:
dp[j][k][s] = dp[j - 1][k][s]
elif j > 0 and k > 0 and xlist[j - 1] <= s:
dp[j][k][s] = dp[j - 1][k][s] + dp[j - 1][k - 1][s - xlist[j - 1]]
else:
dp[j][k][s] = 0
methods = 0
for i in range(1, n + 1):
methods += dp[n][i][i * a]
print(int(methods))
if __name__ == '__main__':
submit()
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.