input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N,C,K = list(map(int,input().split()))
T = [int(eval(input())) for i in range(N)]
ans = 0
capa = 0
dept = -1
for t in sorted(T):
if t > dept or capa == 0:
ans += 1
dept = t+K
capa = C-1
else:
capa -= 1
print(ans) | N,C,K = list(map(int,input().split()))
T = [int(eval(input())) for i in range(N)]
T.sort()
cap = C-1
dep = T[0] + K
ans = 1
for t in T[1:]:
if cap and t <= dep:
cap -= 1
else:
cap = C-1
dep = t + K
ans += 1
print(ans) | p03785 |
N, C, K = list(map(int, input().split()))
Tlist = sorted([int(eval(input())) for _ in range(N)])
ans = 0
count = 0
for i in range(N):
now = Tlist[i]
if count == 0:
rl = now + K
count += 1
continue
else:
if now <= rl <= now + K and count < C:
count +=... | N, C, K = list(map(int, input().split()))
Tlist = sorted([int(eval(input())) for _ in range(N)])
ans = 0
now = 1
start = Tlist[0]
for t in Tlist[1:]:
if now == C:
ans += 1
start = t
now = 1
else:
if t - start <= K:
now += 1
else:
ans ... | p03785 |
n,c,k=list(map(int,input().split()))
t=[int(eval(input())) for x in range(n)]
t.sort()
i=0
cnt=0
while i<n:
departure=t[i]+k
p=0
for j in range(i,n):
if t[j] > departure or p==c:
break
p+=1
i+=p
cnt+=1
print(cnt) | import sys
n,c,k,*t = list(map(int, sys.stdin.read().split()))
t.sort()
i=0
cnt=0
while i<n:
departure=t[i]+k
p=0
for j in range(i,n):
if t[j] > departure or p==c:
break
p+=1
i+=p
cnt+=1
print(cnt)
| p03785 |
n, c, k = list(map(int, input().split()))
t = sorted([int(eval(input())) for _ in range(n)])
bus = []
ans = 0
while len(t) != 0:
temp = t.pop(0)
if len(bus) == 0:
bus.append(temp)
else:
if temp < bus[0] + k:
bus.append(temp)
if len(bus) == c:
ans += 1
bus = []
else:
ans += 1... | n, c, k = list(map(int,input().split()))
t = sorted([int(eval(input())) for _ in range(n)])
ans = 0
bus = []
for i in range(n):
if len(bus) == c:
ans += 1
bus = [t[i]]
elif bus != [] and bus[0] + k < t[i]:
ans += 1
bus = [t[i]]
else:
bus.append(t[i])
print((ans+1)) | p03785 |
import sys
input = sys.stdin.readline
n, c, k = [int(w) for w in input().split()]
la = [int(eval(input())) for _ in range(n)]
la.sort()
lak = [a + k for a in la]
ind = 0
ans = 0
while ind < n:
ride = 0
for i in range(min(c, n - ind)):
if la[ind + i] <= lak[ind]:
ride += 1
... | import sys
import bisect
input = sys.stdin.readline
n, c, k = [int(w) for w in input().split()]
la = [int(eval(input())) for _ in range(n)]
la.sort()
lak = [a + k for a in la]
ind = 0
ans = 0
while ind < n:
ride = bisect.bisect_right(la, lak[ind]) - ind
ind += min(ride, c)
ans += 1
print(... | p03785 |
N, C, K = list(map(int, input().split()))
T = [int(eval(input())) for i in range(N)]
T.sort()
count = 0
ans = 0
start = 0
for i in range(N):
if count < C:
if count == 0:
count += 1
start = T[i]
else:
if T[i] <= start + K:
count += 1
... | N, C, K = list(map(int, input().split()))
T = [int(eval(input())) for i in range(N)]
T.sort()
prev = -1
r = 0
ans = 0
for t in T:
if prev > 0 and t - prev > K:
prev = t
r = 1
ans += 1
elif prev < 0:
prev = t
ans += 1
r = 1
else:
r += 1
... | p03785 |
N, C, K = [int(_) for _ in input().split()]
times = sorted([int(eval(input())) for _ in range(N)])
count = 0
while times:
t = times.pop(0)
count += 1
num = 1
while times:
if times[0] <= t + K and num < C:
times.pop(0)
num += 1
else:
break
... | N, C, K = [int(_) for _ in input().split()]
times = sorted([int(eval(input())) for _ in range(N)], reverse=True)
count = 0
while times:
t = times.pop()
count += 1
num = 1
while times:
if times[-1] <= t + K and num < C:
times.pop()
num += 1
else:
... | p03785 |
N, C, K = list(map(int,input().split()))
T = [int(eval(input())) for i in range(N)]
T.sort()
counter = 0
i = 0
while i<N:
for j in range(C):
if i+(C-j-1)<N and T[i]+K >= T[i+(C-j-1)]:
counter += 1
i = i+(C-j-1)+1
break
print(counter)
| N, C, K = list(map(int,input().split()))
T = [int(eval(input())) for i in range(N)]
T.sort(reverse = True)
counter = 1
i = 0 #### whileの中のカウント（バス乗車数）
A = T.pop() #####先頭
while T:
a = T.pop()
i+=1
if i>=C or a>A+K:
i=0
A=a
counter += 1
print(counter) | p03785 |
def resolve():
N, C, K = list(map(int, input().split()))
T = [int(eval(input())) for _ in range(N)]
T.sort()
count_bus = 0
L = len(T)
i = 0
while i < L:
# print('T[{}]: {}'.format(i, T[i]))
t = T[i]
for j in range(1, C):
if i+j >= L:
... | N, C, K = list(map(int, input().split()))
T = [int(eval(input())) for _ in range(N)]
T.sort()
# print(T)
bus = 1
org = T[0]
_count = 0
for t in T:
if t - org <= K and _count < C:
_count += 1
# print('1- t:{}, org:{}, _count:{}, bus:{}'.format(t, org, _count, bus))
else:
... | p03785 |
# https://atcoder.jp/contests/agc011/tasks/agc011_a
n, c, k = list(map(int, input().split()))
schedule = []
for _ in range(n):
t = int(eval(input()))
schedule.append(t)
schedule.sort()
# schedule.append(float('inf'))
def check(num, schedule, c, k):
bus = 0
start = schedule[0]
p = 0
... | # https://atcoder.jp/contests/agc011/tasks/agc011_a
n, c, k = list(map(int, input().split()))
schedule = []
for _ in range(n):
t = int(eval(input()))
schedule.append(t)
schedule.sort()
ans = 0
start = schedule[0]
p = 0
for i in range(n):
s = schedule[i]
if s <= start + k:
p +=... | p03785 |
import sys
from bisect import bisect_right
input = sys.stdin.readline
N, C, K = list(map(int, input().split()))
T = [int(eval(input())) for i in range(N)]
T.sort()
answer = 0
while T:
n = min(C - 1, len(T) - 1)
if T[n] <= T[0] + K:
n = C
else:
n = bisect_right(T, T[0] + K)
... | import sys
input = sys.stdin.readline
N, C, K = list(map(int, input().split()))
T = [int(eval(input())) for i in range(N)]
T.sort()
answer = 1
limit = T[0] + K
n = 0
for i in T:
if i <= limit and n < C:
n += 1
else:
answer += 1
n = 1
limit = i + K
print(answe... | p03785 |
N,C,K = list(map(int,input().split()))
T = [int(eval(input())) for i in range(N)]
T.sort()
i = 0
ans = 0
while i < N:
t = T[i]
x = T.count(T[i])
ans = ans + (x-1+C)//C
if T[N-1]<t+K:
y = N-i
else:
for j in range(i+((x-1+C)//C-1)*C,N):
if T[j]>t+K:
... | N,C,K = list(map(int,input().split()))
T = [int(eval(input())) for i in range(N)]
T.sort()
i = 0
ans = 0
time =0
p = 0
for i in range(N):
if p==0 or p ==C:
ans = ans+1
p =1
time =T[i]+K
elif p<C :
if T[i]<=time:
p +=1
elif T[i]>time:
... | p03785 |
# import sys
# sys.stdin = open('a2.in')
n, c, k = list(map(int, input().split()))
arrivals = [int(eval(input())) for i in range(n)]
arrivals.sort()
res = 0
room = c
bus_start = None
for t in arrivals:
if room == c:
bus_start = t
has_left_because_angry_passenger = bus_start + k < t
... | n, c, k = list(map(int, input().split()))
arrivals = [int(eval(input())) for i in range(n)]
arrivals.sort()
res = 0
room = c
bus_start = None
for t in arrivals:
previous_bus_has_left = bus_start is not None and bus_start + k < t
if previous_bus_has_left:
res += 1
room = c
... | p03785 |
import bisect
# from collections import Counter, deque # https://note.nkmk.me/python-scipy-connected-components/
# from copy import copy, deepcopy
# from functools import reduce
# from heapq import heapify, heappop, heappush
# from itertools import accumulate, permutations, combinations, combinations_with_replacem... | import bisect
import sys
def input(): return sys.stdin.readline().strip()
N, C, K = list(map(int, input().split()))
T = sorted([int(eval(input())) for i in range(N)])
TT = [i + K for i in T]
cnt = 0
i = 0
temp = -1 # temp番まで運び終わった
while True:
i = bisect.bisect_right(T, TT[i])
if i - temp > C... | p03785 |
from functools import lru_cache
N, A = list(map(int, input().split()))
x = list(map(int, input().split()))
sum_x = sum(x)
X = max(x + [A])
answer = 0
@lru_cache(maxsize=None)
def solve(j, k, s):
global x
if j == 0 and k == 0 and s == 0:
return 1
elif j >= 1 and s < x[j - 1]:
... | from functools import lru_cache
N, A = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list([i - A for i in x])
X = max(max(x), A)
@lru_cache(maxsize=None)
def solve(j, t):
global y
if j == 0 and t == 0:
return 1
elif j >= 1 and (t < y[j - 1] - N * X or t > y[j ... | p04013 |
from itertools import product
N, A = list(map(int, input().split()))
x = [int(xi) for xi in input().split()]
x_max = max(max(x), A)
dp = [[[0 for _ in range((N + 1) * x_max)]
for _ in range(N + 1)]
for _ in range(N + 1)]
dp[0][0][0] = 1
for j, k, s in product(list(range(1, N + 1)),
... | from itertools import product
N, A = list(map(int, input().split()))
x = [int(xi) for xi in input().split()]
y = [xi - A for xi in x]
X = max(max(x), A)
dp = [[0 for _ in range(2 * N * X + 1)] for _ in range(N + 1)]
dp[0][N * X] = 1
for k, t in product(list(range(1, N + 1)), list(range(2 * N * X + 1))):
... | p04013 |
from itertools import combinations
N, A = list(map(int, input().split()))
l = list(map(int, input().split()))
cnt = 0
for i in range(1,N+1):
for cmb in combinations(l,i):
if sum(cmb) / i == A:
cnt += 1
print(cnt) | N, A = list(map(int, input().split()))
X = list([int(x) - A for x in input().split()])
dp = [[0 for j in range(100 * N + 1)] for i in range(N+1)]
dp[0][50 * N] = 1
for i in range(N):
for j in range(50, 100*N + 1-50):
dp[i+1][j] = dp[i][j] + dp[i][j - X[i]]
print((dp[N][50 * N] -1)) | p04013 |
import collections
N, A = list(map(int, input().split()))
xs = list(map(int, input().split()))
dp = collections.defaultdict(lambda: 0)
dp[(0, 0)] = 1
for n, x in enumerate(xs, start=1):
for (k, accum), count in list(dp.items()):
dp[(k + 1, accum + x)] += count
found = 0
for (k, accum), count in l... | import collections
N, A = list(map(int, input().split()))
ys = [int(x) - A for x in input().split()]
dp = collections.defaultdict(lambda: 0)
dp[0] = 1
for y in ys:
for accum, count in list(dp.items()):
dp[accum + y] += count
found = -1 # for dp[0]
for accum, count in list(dp.items()):
if acc... | p04013 |
def f(n,x,i):
if n == 0:
if i != 0:
if x/i == m:
return 1
return 0
if memo[n-1][i][x] != -1 :
if memo[n-1][i][x] > 0:
return memo[n-1][i][x]
memo[n-1][i][x] = f(n-1,x,i)+f(n-1,x+a[n-1],i+1)
return memo[n-1][i][x]
n, m= list(map... | def f(n,x,i):
if n == 0:
if i != 0:
if x/i == m:
return 1
return 0
if memo[n-1][i][x] != -1 :
return memo[n-1][i][x]
memo[n-1][i][x] = f(n-1,x,i)+f(n-1,x+a[n-1],i+1)
return memo[n-1][i][x]
n, m= list(map(int,input().split()))
a = list(map(... | p04013 |
def f(n,x,i):
if n == 0:
if i != 0:
if x/i == m:
return 1
return 0
if memo[n-1][i][x] != -1 :
return memo[n-1][i][x]
memo[n-1][i][x] = f(n-1,x,i)+f(n-1,x+a[n-1],i+1)
return memo[n-1][i][x]
n, m= list(map(int,input().split()))
a = list(map(... | def f(n,x,i):
if n == 0:
if x != 0:
if x / i == a:
return 1
return 0
if memo[i][n][x] != -1:
return memo[i][n][x]
memo[i][n][x] = f(n-1,x,i)+f(n-1,x+ary[n-1],i+1)
return memo[i][n][x]
n,a = list(map(int,input().split()))
ary = list(map(int,i... | p04013 |
def larger(x, y):
if x > y: return x
else: return y
N, A = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
max = larger(x[-1], A)
dp = []
for i in range(0, N+1):
tmp1 = []
for j in range(0, N+1):
tmp2 = []
for k in range(0, N*max+1):
tmp2.append(0)
tmp1.append... | def larger(x, y):
if x > y: return x
else: return y
N, A = list(map(int, input().split()))
x = list(map(int, input().split()))
x = [a-A for a in x]
max = larger(x[-1], A)
dp = []
for i in range(0, N+1):
tmp = []
for j in range(0, 2*N*max+1):
tmp.append(0)
dp.append(tmp)
for i in range(0, N+1):... | p04013 |
N, A, *x = list(map(int, open(0).read().split()))
c_nx = N * max(x + [A])
dp = [[[0] * (c_nx + 1) for _ in range(N + 1)]
for _ in range(N + 1)]
x = [0] + x
dp[0][0][0] = 1
for j in range(1, N + 1):
for k in range(N + 1):
for s in range(c_nx + 1):
if s < x[j]:
... | N, A, *x = list(map(int, open(0).read().split()))
NX = N * max(x + [A])
y = [0] + [v - A for v in x]
dp = [[0] * (2 * NX + 1) for _ in range(N + 1)]
dp[0][NX] = 1
for j in range(1, N + 1):
for t in range(2 * NX + 1):
if t - y[j] < 0 or t - y[j] > 2 * NX:
dp[j][t] = dp[j - 1][t]
... | p04013 |
n,a = list(map(int,input().split()))
x = list(map(int,input().split()))
cnt = 0
for i in range(1 << n):
ans=[]
for j in range(n):
if (i >> j) & 1:
ans.append(x[j])
if ans and sum(ans)/len(ans) == a:
cnt+=1
print(cnt) | N,A = list(map(int,input().split()))
X = list(map(int,input().split()))
Y = [x-A for x in X]
dp = {0:1}
for y in Y:
tmp = list(dp.items())
for k,v in tmp:
dp[k+y]=dp.get(k+y,0)+v
print((dp[0]-1)) | p04013 |
# ABC044C - 高橋君とカード / Tak and Cards (ARC060C)
from collections import defaultdict
def main():
N, A, *X = list(map(int, open(0).read().split()))
X, D = [i - A for i in X], defaultdict(int)
D[0] = 1
for i in X:
for j, k in list(D.items()):
D[i + j] += k
ans = D[0] - 1
... | # ABC044C - 高橋君とカード / Tak and Cards (ARC060C)
def main():
N, A, *X = list(map(int, open(0).read().split()))
X, D = [i - A for i in X], {0: 1}
for i in X:
for j, k in list(D.items()):
D[i + j] = D.get(i + j, 0) + k
ans = D[0] - 1
print(ans)
if __name__ == "__main__":
... | p04013 |
n, a = list(map(int, input().split()))
xlist = list(sorted(map(int, input().split())))
maxx = xlist[-1] if xlist[-1] > a else a
# dp[j][k][s]: x_1...x_jまでのなかからk枚選んで合計をsにする総数
dp = [[[0 for _ in range(maxx * n + 1)] for _ in range(n + 1)] for _ in range(n + 1)]
dp[0][0][0] = 1 # 0枚選んで合計を0にするのは1通り
for j in rang... | n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
maxx = max(x)
maxx = max(maxx, a)
# dp[j][k][s] : j枚目までからk枚選んで合計をsにする場合の数
dp = [[[0 for _ in range(maxx * n + 1)] for _ in range(n + 1)] for _ in range(n + 1)]
dp[0][0][0] = 1
for j in range(n + 1):
for k in range(j + 1):
... | p04013 |
def count_up(N, A, x, check, card, total):
if check == N:
return 1 if card > 0 and card * A == total else 0
else:
return count_up(N, A, x, check+1, card+1, total+x[check]) + count_up(N, A, x, check+1, card, total)
def bad_method(N, A, x):
print(count_up(N, A, x, 0, 0, 0))
def well_method(N, A, ... | def count_up(N, A, x, check, card, total):
if check == N:
return 1 if card > 0 and card * A == total else 0
else:
return count_up(N, A, x, check+1, card+1, total+x[check]) + count_up(N, A, x, check+1, card, total)
def bad_method(N, A, x):
print(count_up(N, A, x, 0, 0, 0))
def well_method(N, A, ... | p04013 |
n,a = list(map(int,input().split()))
x = list(map(int,input().split()))
max_x = max(x)
dp = [[[0]*(n*max_x+1) for i in range(n+1)] for j 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-1]:
dp[i][j][k] = dp[i-1][j][k]
... | n,a = list(map(int,input().split()))
x = list(map(int,input().split()))
max_x = max(max(x),a)
dp = [[[0]*(n*max_x+1) for i in range(n+1)] for j 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-1]:
dp[i][j][k] = dp[i-1][j... | p04013 |
n,a=list(map(int,input().split()))
x=list(map(int,input().split()))
X=max(max(x),a)
dp=[[[None for i in range(n*X+1)] for h in range(n+1)] for g 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
... | n,a=list(map(int,input().split()))
x=list(map(int,input().split()))
X=max(max(x),a)
y=[]
for i in x:
y.append(i-a)
dp=[[None for i in range(2*n*X+1)] for h in range(n+1)]
for j in range(n+1):
for t in range(2*n*X+1):
if j==0 and t==n*X:
dp[j][t]=1
elif j>=1 and... | p04013 |
def resolve():
N, A = list(map(int, input().split()))
X = sorted(list(map(int, input().split())))
cnt = 0
for bits in range(1, 1<<N):
flags = list(bin(bits)[2:].zfill(N))
_X = [x for i, x in enumerate(X) if flags[i]=="1"]
cnt += 1 if sum(_X)/len(_X) == A else 0
print(... | def resolve():
N, A = list(map(int, input().split()))
X = [int(i) - A for i in input().split()]
d = {0: 1}
for x in X:
for _sum, count in list(d.items()):
d[_sum+x] = d.get(_sum+x, 0) + count
print((d[0]-1))
if '__main__' == __name__:
resolve()
| p04013 |
n,a=list(map(int,input().split()))
l=[int(i) for i in input().split()]
ans=0
#dp=[[[0 for i in range(51)] for j in range(51)] for k in range(2501)]
dp=[[[0 for i in range(2501)] for j in range(51)] for k in range(51)]
dp[0][0][0]=1
for i in range(n):
for j in range(50):
for k in range(2501):
... | def sol():
n,a=list(map(int,input().split()))
x=[int(i) for i in input().split()]
ans=chk=0
d=[[0]*2501 for j in range(51)]
d[0][0]=1
for i in x:
for j in range(2500,i-1,-1):
for k in range(50,0,-1):
d[k][j]+=d[k-1][j-i]
for i in range(1,51):
... | p04013 |
def factorial(n):
k = 1
for i in range(n): k *= (i + 1)
return k
def binomial(a, b):
return factorial(a) // (factorial(a - b) * factorial(b))
cache = {}
def s(x, a, k, i):
key = (a, k, i)
if key in cache: return cache[key]
if a < 0: return 0
if k < 0: return 0
if k ... | b = []
def binomial(n):
global b
b = [None] * n
for i in range(n):
b[i] = [0] * n
b[i][i] = 1
for i in range(1, n):
for j in range(1, i + 1):
b[i][j] = b[i - 1][j - 1] + b[i - 1][j]
cache = {}
def s(x, a, k, i):
key = (a, k, i)
if key in c... | p04013 |
b = []
def binomial(n):
global b
b = [None] * n
for i in range(n):
b[i] = [0] * n
b[i][i] = 1
for i in range(1, n):
for j in range(1, i + 1):
b[i][j] = b[i - 1][j - 1] + b[i - 1][j]
cache = {}
def s(x, a, k, i):
if a < 0: return 0
if k < 0... | n, a = list(map(int, input().split()))
x = [int(i) for i in input().split()]
cache = {}
def s(v, k, i):
if i == n: return int(v > 0 and v == k * a)
if v > a * n: return 0
key = (v, k, i)
if key in cache: return cache[key]
cache[key] = s(v, k, i + 1) + s(v + x[i], k + 1, i + 1)
return ca... | p04013 |
f=lambda:list(map(int,input().split()))
n,a=f()
l=[i-a for i in f()]
dp=[[0]*5000 for _ in range(51)]
Z=2500
dp[0][Z]=1
for i in range(n):
for s in range(5000-max(l[i],0)):
dp[i+1][s]+=dp[i][s]
dp[i+1][s+l[i]]+=dp[i][s]
print((dp[n][Z]-1)) | _,a,*l=list(map(int,open(0).read().split()))
d={0:1}
for i in l:
for k,v in list(d.copy().items()): d[i-a+k]=d.get(i-a+k,0)+v
print((d[0]-1)) | p04013 |
n,a,*l=list(map(int,open(0).read().split()))
R=2500
dp=[[0]*R*2,[0]*R*2]
dp[0][0]=1
for i in range(n):
for s in range(-R,R):
dp[i+1&1][s]=dp[i&1][s]+dp[i&1][s-l[i]+a]
print((dp[n&1][0]-1)) | n,a,*l=list(map(int,open(0).read().split()))
R=2500
dp=[[0]*R*2,[0]*R*2]
dp[0][0]=1
t=0
for i in range(n):
u=1-t
for s in range(-R,R):
dp[u][s]=dp[t][s]+dp[t][s-l[i]+a]
t=u
print((dp[t][0]-1)) | p04013 |
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
M = max(x)
M = max(M, a)
dp = [[[0]*(n*M+1) for _ in range(n+1)] for _ in range(n+1)]
for j in range(n+1):
for k in range(n+1):
for s in range(n*M+1):
if j == 0 and k == 0 and s == 0:
dp[j][k][s... | n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
M = max(x)
M = max(M, a)
dp = [[[0]*(n*M+1) for _ in range(n+1)] for _ 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*M+1):
if dp[j][k][s]:
dp[j+1][k][s] ... | p04013 |
import collections
# input
n, a = list(map(int, input().split()))
X = [int(i) - a for i in input().split()]
sums = collections.Counter([0, X[0]])
# Xから1枚以上選んで作ることが可能な和:作り方の場合の数
# 1枚も選ばない＝0:1通り
# X[0]のみ選ぶ＝X[0]:1通り
for i in X[1:]: # 選べるカードを増やしていく (X[0] ~ X[i] から選ぶ)
sums2 = collections.Counter()
fo... | import collections
# input
n, a = list(map(int, input().split()))
X = [int(i) - a for i in input().split()]
S = collections.Counter([0, X[0]])
# Xから1枚以上選んで作ることが可能な和:作り方の場合の数
# 1枚も選ばない＝0:1通り
# X[0]のみ選ぶ＝X[0]:1通り
for i in X[1:]: # 選べるカードを増やしていく (X[0] ~ X[i] から選ぶ)
S_temp = collections.Counter()
for ... | p04013 |
n, a = list(map(int, input().split()))
xlst = list(map(int, input().split()))
xlst.insert(0, 0)
"""
dp[i][j][k] ... iまででj個使ってkを作る
dp[i][j][k] += dp[i - 1][j - 1][k - x]
"""
dp = [[[0] * (50 * n + 1) for _ in range(n + 1)] for _ in range(n + 1)]
for i in range(n + 1):
dp[i][0][0] = 1
for i in range(1,... | def main():
n, a = list(map(int, input().split()))
xlst = list(map(int, input().split()))
xlst.insert(0, 0)
"""
dp[i][j][k] ... iまででj個使ってkを作る
dp[i][j][k] += dp[i - 1][j - 1][k - x]
"""
dp = [[[0] * (50 * n + 1) for _ in range(n + 1)] for _ in range(n + 1)]
for i in range(n + 1):
dp[... | p04013 |
def main():
n, a = list(map(int, input().split()))
xlst = list(map(int, input().split()))
xlst.insert(0, 0)
"""
dp[i][j][k] ... iまででj個使ってkを作る
dp[i][j][k] += dp[i - 1][j - 1][k - x]
"""
dp = [[[0] * (50 * n + 1) for _ in range(n + 1)] for _ in range(n + 1)]
for i in range(n + 1):
dp[... | def main():
n, a = list(map(int, input().split()))
xlst = list(map(int, input().split()))
#xlst.insert(0, 0)
"""
dp[i][j][k] ... iまででj個使ってkを作る
dp[i][j][k] += dp[i - 1][j - 1][k - x]
"""
"""
dp = [[[0] * (50 * n + 1) for _ in range(n + 1)] for _ in range(n + 1)]
for i in range(n + 1)... | p04013 |
def main():
n, a = list(map(int, input().split()))
xlst = list(map(int, input().split()))
#xlst.insert(0, 0)
"""
dp[i][j][k] ... iまででj個使ってkを作る
dp[i][j][k] += dp[i - 1][j - 1][k - x]
"""
"""
dp = [[[0] * (50 * n + 1) for _ in range(n + 1)] for _ in range(n + 1)]
for i in range(n + 1)... | def main():
n, a = list(map(int, input().split()))
xlst = list(map(int, input().split()))
"""
dp[i][j][k] ... iまででj個使ってkを作る
dp[i][j][k] += dp[i - 1][j - 1][k - x]
"""
"""
xlst.insert(0, 0)
dp = [[[0] * (50 * n + 1) for _ in range(n + 1)] for _ in range(n + 1)]
for i in range(n + 1):... | p04013 |
def main():
n, a = list(map(int, input().split()))
xlst = list(map(int, input().split()))
"""
dp[i][j][k] ... iまででj個使ってkを作る
dp[i][j][k] += dp[i - 1][j - 1][k - x]
"""
"""
xlst.insert(0, 0)
dp = [[[0] * (50 * n + 1) for _ in range(n + 1)] for _ in range(n + 1)]
for i in range(n + 1):... | def main():
n, a = list(map(int, input().split()))
xlst = list(map(int, input().split()))
"""
#dp[i][j][k] ... iまででj個使ってkを作る
#dp[i][j][k] += dp[i - 1][j - 1][k - x]
xlst.insert(0, 0)
dp = [[[0] * (50 * n + 1) for _ in range(n + 1)] for _ in range(n + 1)]
for i in range(n + 1):
dp[i][... | p04013 |
n,a=list(map(int,input().split()))
arr=list(map(int,input().split()))
x=max(arr)
x=max(x,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(1,n+1):
xi=arr[i-1]
for j in range(n+1):
for k in range(n*x+1):
if k<xi:
dp[i][j][k]=dp[i-1][... | n,a=list(map(int,input().split()))
arr=list(map(int,input().split()))
l=n*max(a,max(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... | p04013 |
def main():
N,A = list(map(int,input().split()))
X = [int(x) for x in input().split()]
dp = [[[0 for _ in range(2501)] for _ in range(N+1)] for _ in range(N+1)]
dp[0][0][0] = 1
for j in range(N):
now = X[j]
for k in range(N+1):
for s in range(2501):
... | def main():
n,a = list(map(int,input().split()))
x = [int(x) for x in input().split()]
dp= [[[0 for _ in range(2501)] for _ in range(n+1)] for _ in range(n)]
dp[0][0][0] = 1
dp[0][1][x[0]] = 1
for i in range(1,n):
for j in range(n+1):
for k in range(2501):
... | p04013 |
from functools import lru_cache
N, A = list(map(int, input().split()))
X = tuple(int(x) for x in input().split())
# 平均を出すのに選んだ個数が必要
@lru_cache(maxsize=None)
def rec(x, a, k):
"""
:param x: tuple
数列
:param a: int
総和
:param k: int
選ぶ個数
:return: int
通り数... | from functools import lru_cache
N, A = list(map(int, input().split()))
X = tuple(int(x) for x in input().split())
# 平均を出すのに選んだ個数が必要
@lru_cache(maxsize=None)
def rec(i, a, k):
"""
:param i: int
数列の長さ
:param a: int
総和
:param k: int
選ぶ個数
:return: int
通... | p04013 |
import sys
from collections import deque, Counter
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()
n, a = na()
x = na()
x = [0] + x
dp = [[[0] * (50 * n + 1) for i in range(n+1)] for j in range(n+1)]
for j in range(n + 1):
... | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()
n, a = na()
x = na()
x = [0] + x
dp = [[[0] * (50 * n + 1) for i in range(n+1)] for j in range(n+1)]
for j in range(n + 1):
for k in range(j + 1):
for s in... | p04013 |
def solve():
def recur(i, n, total):
# print("i, n, total", i, n, total)
if not TABLE[i][n][total] == -1:
# print('cache!')
return TABLE[i][n][total]
if not i < N:
if n > 0 and total == A * n:
TABLE[i][n][total] = 1
... | def solve():
def recur(i, n, total):
# print("i, n, total", i, n, total)
if not TABLE[i][n][total] == -1:
# print('cache!')
return TABLE[i][n][total]
if not i < N:
if n > 0 and total == A * n:
return 1
return 0
... | p04013 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | p04013 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | #!/usr/bin/env python3
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
s = sum(x)
dp = [[[0] * (s+1) for _ in range(n+1)] for _ in range(n+1)]
dp[0][0][0] = 1
for i in range(1, n+1):
xi = x[i-1]
for j in range(s+1):
for k in range(i):
dp[i][k][j] = dp[i-1... | p04013 |
N,A=list(map(int,input().split()))
xlist=list(map(int,input().split()))
dp=[[[0]*(sum(xlist)+1) for _ in range(N+1)] for _ in range(N+1)]
dp[0][0][0]=1
for i in range(1,N+1):
dp[i][0][0]=1
for j in range(1,N+1):
for k in range(1,sum(xlist)+1):
dp[i][j][k]=dp[i-1][j][k]
if k-xlist[i-1]>=0:... | N,A=list(map(int,input().split()))
xlist=list(map(int,input().split()))
dp=[[[0]*(sum(xlist)+1) for _ in range(N+1)] for _ in range(N+1)]
dp[0][0][0]=1
for i in range(1,N+1):
dp[i][0][0]=1
for j in range(1,i+1):
for k in range(1,sum(xlist)+1):
dp[i][j][k]=dp[i-1][j][k]
if k-xlist[i-1]>=0:... | p04013 |
n,a=list(map(int,input().split()))
x=list(map(int,input().split()))
X=max(max(x),a)
dp=[[[0]*(n*X+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):
xi=x[i-1]
for j in range(n+1):
for h in range(j*X+1):
if h<xi:dp[i][j][h]=dp[i-1][j][h]
if xi<=h and j>=1:... | n,a=list(map(int,input().split()))
x=list(map(int,input().split()))
X=max(max(x),a)
dp=[[[0]*(X*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):
xi=x[i-1]
for j in range(i+1):
for h in range(j*X+1):
if h<xi:dp[i][j][h]=dp[i-1][j][h]
if xi<=h and j>=1:... | p04013 |
import itertools
n, a = list(map(int, input().split()))
integers = list(int(x) - a for x in input().split())
count = 0
for i in range(1, len(integers)+1):
for combs in itertools.combinations(integers, i):
av = sum(combs) / i
if av == 0:
count += 1
print(count)
| import sys
n, a, *x = list(map(int, sys.stdin.read().split()))
def main():
ma = a * n
res = [[[0] * (ma + 1) for _ in range(n + 1)] for _ in range(n + 1)]
res[0][0][0] = 1
for i in range(n):
cur = x[i]
for j in range(i+2):
for k in range(ma + 1):
... | p04013 |
import sys
n, a, *x = list(map(int, sys.stdin.read().split()))
def main():
ma = a * n
res = [[[0] * (ma + 1) for _ in range(n + 1)] for _ in range(n + 1)]
res[0][0][0] = 1
for i in range(n):
cur = x[i]
for j in range(i+2):
for k in range(ma + 1):
... | import sys
n, a, *x = list(map(int, sys.stdin.read().split()))
def main():
for i in range(n):
x[i] -= a
x.sort()
res = [[0] * 99*n for _ in range(n+1)]
# res[i][49*n]を中心とする。
res[0][49*n] = 1
for i in range(n):
for j in range(99*n):
res[i+1][j] += res[... | p04013 |
N, A = list(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... | N, A = list(map(int, input().split()))
x = list(map(int, input().split()))
X = max(x)
if X < A:
X = A
y = []
for i in x:
y += [i-A]
dp = [[-1] * (2*N*X+1) for _ in range(N+1)]
def check(j, t):
if dp[j][t] != -1:
return dp[j][t]
if j == 0 and t == N * X:
dp[j][t]... | p04013 |
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
dp = [[[0 for s in range(n * 60)] 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 * 60):
if (j == 0) and (k == 0) and (s == 0):
dp[j][k][... | n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
X = max(x)
y = [i - a for i in x]
dp = [[0 for t in range(2 * n * X + 10)] for j in range(n + 1)]
dp[0][n * X] = 1
for j in range(1, n + 1):
for t in range(2 * n * X + 1):
if 0 <= t - y[j - 1] <= 2 * n * X:
dp[j]... | p04013 |
import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools, random
from collections import deque
from heapq import heappush, heappop
sys.setrecursionlimit(10 ** 7)
ans = 0
tmp = 0
inf = 10 ** 20
INF = float("INF")
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
dd = [(-1, 0)... | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools, random
from collections import deque
from heapq import heappush, heappop
sys.setrecursionlimit(10 ** 7)
ans = 0
tmp = 0
inf = 10 ** 20
INF = float("INF")
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
dd = [(-1, 0)... | p04013 |
from sys import stdin
input = stdin.readline
def Combi(n, r):
return int(factorial[n] / factorial[r] / factorial[n-r])
N, A = [int(x) for x in input().rstrip().split()]
x = [int(x) for x in input().rstrip().split()]
# num = [0]*51
# for i in x:
# num[i] += 1
# print(2**num[A]-1)
# factorial = [1]
# for i... | from sys import stdin
input = stdin.readline
N, A = [int(x) for x in input().rstrip().split()]
x = [int(x) for x in input().rstrip().split()]
X = max(max(x), A)
# dp = [[[0]*(N*X+1) for _ in range(N+1)] for _ 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... | p04013 |
N,A = list(map(int,input().split()))
X = [0]+list(map(int,input().split()))
# dp[n][k][s] : n枚目までからk枚選んで合計をsにする場合の数
dp = [[[0 for _ in range(2501)] for _ in range(N+1)] for _ in range(N+1)]
dp[0][0][0] = 1
for n in range(1,N+1):
for k in range(n+1):
for s in range(50*k+1):
if n>=1 an... | N,A = list(map(int,input().split()))
X = [0]+list(map(int,input().split()))
# dp[n][k][s] : n枚目までからk枚選んで合計をsにする場合の数
dp = [[[0 for _ in range(2501)] for _ in range(N+1)] for _ in range(N+1)]
dp[0][0][0] = 1
for n in range(1,N+1):
for k in range(n+1):
for s in range(50*k+1):
if s<X[n]:... | p04013 |
N,A = list(map(int,input().split()))
X = [0]+list(map(int,input().split()))
# dp[n][k][s] : n枚目までからk枚選んで合計をsにする場合の数
dp = [[[0 for _ in range(2501)] for _ in range(N+1)] for _ in range(N+1)]
dp[0][0][0] = 1
for n in range(1,N+1):
for k in range(n+1):
for s in range(50*k+1):
if s<X[n]:... | # python3 (3.4.3)
import sys
input = sys.stdin.readline
# main
N,A = list(map(int,input().split()))
X = [0] + list(map(int,input().split()))
# dp[n][k][d] : n枚からk枚選んで合計dにする選び方
dp = [[[0 for _ in range(50*N+1)] for _ in range(N+1)] for _ in range(N+1)]
dp[0][0][0] = 1
for n in range(N+1):
for k in ra... | p04013 |
n,v = list(map(int,input().split()))
X = list(map(int,input().split()))
ans = [[0,0]]
for i in range(n):
ans2 = []
for x in ans:
ans2.append([x[0]+X[i],x[1]+1])
ans2.append([x[0],x[1]])
ans = ans2
cnt = 0
for a in ans:
if a[1] == 0:
continue
elif a[0]/a[1]... | n,a = list(map(int,input().split()))
X = [int(i)-a for i in input().split()]
dp = [[0]*(100*n+1) for i in range(n+1)]
dp[0][50*n] = 1
for i in range(n):
for j in range(50,100*n+1-50):
dp[i+1][j] = dp[i][j]+dp[i][j-X[i]]
print((dp[n][50*n]-1)) | p04013 |
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def solve():
"""
OPT[i][j][k] - sum is i, j number of elements, first k elements
OPT[i][j][k] = OPT[i-x[k]][j-1][k-1] if j-th element is taken
OPT[i][... |
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def solve():
"""
OPT[i][j][k] - sum is i, j number of elements, first k elements
OPT[i][j][k] = OPT[i-x[k]][j-1][k-1] if j-th element is taken
OPT[i][... | p04013 |
import copy
def main():
N, A = list(map(int, input().split()))
x = list(map(int, input().split()))
dp = [[0] * (50*N + 1) for _ in range(N+1)]
dp[0][0] = 1
for k in range(N):
dpn = copy.deepcopy(dp)
for i in range(k+1):
for j in range(50 * N + 1 -x[k]):
... | def main():
N, A = list(map(int, input().split()))
x = list(map(int, input().split()))
dp = [[0] * (50*N + 1) for _ in range(N+1)]
dp[0][0] = 1
for k in range(N):
for i in reversed(list(range(k+1))):
for j in range(50 * N + 1 -x[k]):
dp[i+1][j+x[k]] += dp[... | p04013 |
def tak_and_cards(N: int, A: int, x: list) -> int:
count = 0
for b in range(1, 1 << N):
n, s = 0, 0
for i in range(N):
if (b >> i) & 1 == 0:
continue
n += 1
s += x[i]
if s == n * A:
count += 1
return count
... | def tak_and_cards(N: int, A: int, X: list) -> int:
# 部分点解法
# :---------:
# count = 0
# for b in range(1, 1 << N):
# n, s = 0, 0
# for i in range(N):
# if (b >> i) & 1 == 0:
# continue
# n += 1
# s += X[i]
# if s ==... | p04013 |
N, A = list(map(int, input().split()))
x = [int(i) for i in input().split()]
lim = sum(x)
dp = [[0]*(lim + 1) for i in range(N + 1)]
dp[0][0] = 1
for i in range(N):
for k in range(N, 0, -1):
for v in range(lim, -1, -1):
if v - x[i] < 0:
break
dp[k][... | N, A = list(map(int, input().split()))
x = [int(i) for i in input().split()]
# 3d DP
max_x = max(x)
dp = [[[0] * (max_x * N + 1) for j in range(N + 1)]
for i in range(N + 1)]
dp[0][0][0] = 1
for i in range(0, N):
for k in range(0, N + 1):
for y in range(max_x * ... | p04013 |
N, A = list(map(int, input().split()))
x = [int(i) for i in input().split()]
# 3d DP
max_x = max(x)
dp = [[[0] * (max_x * N + 1) for j in range(N + 1)]
for i in range(N + 1)]
dp[0][0][0] = 1
for i in range(0, N):
for k in range(0, N + 1):
for y in range(max_x * ... | def solve():
N, A = list(map(int, input().split()))
x = [int(i) for i in input().split()]
# 3d DP
max_x = max(x)
dp = [[[0] * (max_x * N + 1) for j in range(N + 1)]
for i in range(N + 1)]
dp[0][0][0] = 1
for i in range(0, N):
for ... | p04013 |
def solve():
N, A = list(map(int, input().split()))
x = [int(i) for i in input().split()]
# 3d DP
max_x = max(x)
dp = [[[0] * (max_x * N + 1) for j in range(N + 1)]
for i in range(N + 1)]
dp[0][0][0] = 1
for i in range(0, N):
for ... | def solve():
N, A = list(map(int, input().split()))
x = [int(i) for i in input().split()]
lim = sum(x)
dp = [[0]*(lim + 1) for i in range(N + 1)]
dp[0][0] = 1
for i in range(N):
for k in range(i + 1, 0, -1):
for v in range(lim, x[i] - 1, -1):
... | p04013 |
n, a = list(map(int, input().split()))
cnt = [0]
x = list(map(int, input().split()))
check = [0 for i in range(n)]
def ave(idx, k):
if idx == n:
s = 0
for i in range(n):
if check[i]:
s += x[i]
if s == k * a and k != 0:
cnt[0] += 1
... | n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
def ave_comb(v_max, ave):
dp = [[[0 for c in range(n*v_max+1)] for b in range(n+1)] for a in range(n+1)]
for i in range(n+1):
dp[i][0][0] = 1
for i in range(1, n+1):
for j in range(1, i+1):
... | p04013 |
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
def ave_comb(v_max, ave):
dp = [[[0 for c in range(n*v_max+1)] for b in range(n+1)] for a in range(n+1)]
for i in range(n+1):
dp[i][0][0] = 1
for i in range(1, n+1):
for j in range(1, i+1):
... | n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
x_max = max(x)
y = [i-a for i in x]
def ave_comb():
dp = [[0 for d in range(2*n*x_max+1)] for c in range(n+1)]
for i in range(n+1):
dp[i][n*x_max] = 1
for i in range(1, n+1):
for j in range(1, 2*n*x_m... | p04013 |
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
x_max = max(x)
x_sum = sum(x)
ans = 0
if x_max >= a:
dp = [[[0 for k in range(x_sum + 1)] for j in range(n + 1)] for i in range(2)]
dp[0][0][0] = 1
for i in range(1, n + 1):
idx = i % 2
for j in range(n + 1)... | n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
x_max = max(x)
x_sum = sum(x)
ans = 0
if x_max >= a:
dp = [[0 for j in range(2 * x_sum + 1)] for i in range(2)]
dp[0][x_sum] = 1
for i in range(1, n + 1):
idx = i % 2
y = x[i - 1] - a
for j in range... | p04013 |
n,a = list(map(int,input().split()))
l = list(map(int,input().split()))
dp = [[[0]*(2501) for i in range(n+1)] for j in range(n+1)]
dp[0][0][0] = 1
# i 個目までのj個選んで 和のmod aが k
for i in range(n):
for j in range(i+1):
for k in range(2501):
dp[i+1][j][k] += dp[i][j][k]
... | n,a = list(map(int,input().split()))
l = list(map(int,input().split()))
dp = [[[0]*(2501) for i in range(n+1)] for j in range(n+1)]
dp[0][0][0] = 1
for i in range(n):
for j in range(i+1):
for k in range(2501):
dp[i+1][j][k] += dp[i][j][k]
if k+l[i] < 2501:
... | p04013 |
n,a = [int(i) for i in input().split()]
X = [int(i) for i in input().split()]
X = [0]+X
m = max(X+[a])
dp = [[[0]*50*(n+1) for i in range(n+1)] for j in range(n+1)]
#print(dp)
for i in range(n+1):
for j in range(n+1):
for k in range(m*(n+1)):
if i == j == k == 0:
... | n,a = [int(i) for i in input().split()]
X = [int(i)-a for i in input().split()]
dp = [[0]*(100*n+1) for i in range(n+1)]
#print(dp)
dp[0][50*n]=1
for i in range(n):
for j in range(50,100*n+1-50):
dp[i+1][j] = dp[i][j]+dp[i][j-X[i]]
ans = dp[n][n*50]-1
print(ans) | p04013 |
N,A=list(map(int,input().split()))
X=[int(a) for a in input().split()]
X.append(0)
X.sort()
ma=sum(X)
#[x]までのy個を使ってzを作る場合の数を数え上げるdp
#dp[x][y][z]=dp[x-1][y][z]+dp[x-1][y-1][z-X[x]](zが残っている場合）
#dp[x][y][z]=dp[x-1][y][z](zが残っていない場合)
dp=[[[0] * (ma+1) for i in range(N+1)] for j in range(N+1)]
for i in range(N+1)... | def solve(N,A,X):
X.append(0)
X.sort()
ma=sum(X)
#[x]までのy個を使ってzを作る場合の数を数え上げるdp
#dp[x][y][z]=dp[x-1][y][z]+dp[x-1][y-1][z-X[x]](zが残っている場合）
#dp[x][y][z]=dp[x-1][y][z](zが残っていない場合)
dp=[[[0] * (ma+1) for i in range(N+1)] for j in range(N+1)]
#[x]までの0個を使って0を作る方法は1つ（dp初期化）
for i in range(N+1):
... | p04013 |
n, a = list(map(int, input().split()))
X = tuple(map(int, input().split()))
X = sorted(X)
from collections import deque
ans = 0
for i in range(n):
st = deque([[i, 1, X[i]]])
while st:
idx, count, s = st.pop()
if count*a == s:
ans += 1
elif count*a < s:
... | n, a = list(map(int, input().split()))
X = tuple(map(int, input().split()))
dp = [[[0] * (2550) for _ in range(n+1)] for _ in range(n+1)]
dp[0][0][0] = 1
for i in range(n):
# i枚目までで
for j in range(n):
# j枚のカードを選んで
for s in range(n*a+1):
# 合計がsになるパターン
if dp[i][j]... | p04013 |
N, A = list(map(int, input().split()))
X = [int(x) - A for x in input().split()]
import functools
@functools.lru_cache(maxsize=None)
def f(acc, left):
if not left: return 0
ret = 0
y = acc + left[0]
ret += 1 if y == 0 else 0
ret += f(y, left[1:])
ret += f(acc, left[1:])
return r... | N, A = list(map(int, input().split()))
X = [int(x) - A for x in input().split()]
from collections import Counter
total = Counter([0])
for x in X:
mix = Counter()
for i, cnt in list(total.items()):
mix[i + x] += cnt
total += mix
print((total[0] - 1)) | p04013 |
from itertools import product
N, A = list(map(int, input().split()))
x = [int(x) for x in input().split()]
max_x = max(max(x), A)
dp = [[[0 for _ in range((N + 1) * max_x)] for _ in range(N + 1)] for _ in range(N + 1)]
dp[0][0][0] = 1
for j, k, s in product(list(range(1, N + 1)), list(range(N + 1)), list(ra... | from itertools import product
N, A = list(map(int, input().split()))
x = [int(x) for x in input().split()]
X = max(max(x), A)
dp = [[0 for _ in range(2 * N * X + 1)] for _ in range(N + 1)]
dp[0][N * X] = 1
for j, t in product(list(range(1, N + 1)), list(range(2 * N * X + 1))):
y = x[j - 1] - A
if ... | p04013 |
from collections import defaultdict
N, A = list(map(int, input().split()))
x = [int(x) for x in input().split()]
for i in range(N):
x[i] -= A
X = max(max(x), A)
dp = [defaultdict(int) for _ in range(N + 1)]
dp[0][0] = 1
for i in range(N):
for j in range(-N * X, N * X + 1):
if - N * X <= ... | from collections import defaultdict
N, A = list(map(int, input().split()))
x = [int(x) for x in input().split()]
for i in range(N):
x[i] -= A
X = max(max(x), A)
dp = [defaultdict(int) for _ in range(N + 1)]
dp[0][0] = 1
for i in range(N):
for j in range(-N * X, N * X + 1):
dp[i + 1][j] =... | p04013 |
N,A = list(map(int,input().split()))
x = list(map(int,input().split()))
temp = x + [A]
X = max(temp)
m = N * X
dp = [[[0]*(m+1) for k in range(N+1)] for j in range(N+1)]
dp[0][0][0] = 1
res = 0
for j in range(N+1):
for k in range(N+1):
for s in range(m+1):
if (j >= 1) & ... | N,A = list(map(int,input().split()))
x = list(map(int,input().split()))
temp = x + [A]
X = max(temp)
m = N * X
dp = [[[0 for s in range(m+1)] for k in range(N+1)] for j in range(N+1)]
dp[0][0][0] = 1
res = 0
for j in range(N):
for k in range(N):
for s in range(m):
if dp[... | p04013 |
import sys
from sys import stdin
input = stdin.readline
def solve(N, A, x):
x.append(0)
x.sort()
W=sum(x)
dp=[[[0]*(W+1) for _ in range(N+1)] for _ in range(N+1)]
for j in range(N+1):
dp[j][0][0]=1
for j in range(1,N+1):
xj=x[j]
for k in range(1, N+1):
... | import sys
from sys import stdin
input = stdin.readline
def solve(N, A, x):
x.append(0)
x.sort()
W=sum(x)
dp=[[[0]*(W+1) for _ in range(N+1)] for _ in range(N+1)]
for j in range(N+1):
dp[j][0][0]=1
for j in range(1,N+1):
xj=x[j]
for k in range(1, N+1):
... | p04013 |
import sys
from sys import stdin
input = stdin.readline
def solve(N, A, x):
x.append(0)
x.sort()
W=sum(x)
dp=[[[0]*(W+1) for _ in range(N+1)] for _ in range(N+1)]
for j in range(N+1):
dp[j][0][0]=1
for j in range(1,N+1):
xj=x[j]
for k in range(1, N+1):
... | import sys
from sys import stdin
input = stdin.readline
def solve(N, A, x):
W=sum(x)
dp=[[[0]*(W+1) for _ in range(N+1)] for _ in range(N+1)]
for j in range(N+1):
dp[j][0][0]=1
for j in range(1,N+1):
xj=x[j-1]
for k in range(1, N+1):
for s in range(1, W+1... | p04013 |
from functools import lru_cache
n, a = list(map(int, input().split(' ')))
x = list(map(int, input().split(' ')))
t = 0
@lru_cache(maxsize=1024)
def dfs(i,ave):
if i ==n:
if ave == 0:
return 1
else:
return 0
return dfs(i+1,ave)+dfs(i+1,ave+x[i]-a)
print... | n,a = list(map(int, input().split(' ')))
x = list(map(int, input().split(' ')))
y = [i - a for i in x]
X = max(a,max(x))
dp = []
for i in range(n+1):
dp.append([0]*(2*n*X+1))
for j in range(n,-1,-1):
for t in range(2*n*X+1):
if j == n and t ==n*X:
dp[j][t] = 1
elif j == ... | p04013 |
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, a = list(map(int, input().split()))
X = list(map(int, input().split()))
MAX = 50 * 50 + 1
dp = [[[0] * MAX for _ in range(n + 1)] for _ in range(n + 1)]
dp[0][0][0] = 1
for i in r... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 998244353
def resolve():
n, a = list(map(int, input().split()))
X = list(map(int, input().split()))
MAX = sum(X)
dp = [[[0] * (MAX + 1) for _ in range(n + 1)] for _ in range(n + 1)]
dp[0][... | p04013 |
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
X = max(max(x), a)
#dp = [[[0]*(n*X+1) for _ in range(X+1)] for i in range(n+1)]
dp = [[[0]*(n*X+1) for _ in range(n+1)] for i 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... | # 配列を大きめにとって配った方がすっきりかけるのかも
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
X = max(max(x), a)
dp = [[[0]*(n*X+1) for _ in range(n+1)] for i in range(n+1)]
#if j == 0 and k == 0 and s == 0:
dp[0][0][0] = 1
for j in range(n):
for k in range(n):
for s in range(n*X):
... | p04013 |
import itertools
N, A = list(map(int, input().split()))
x = sorted([int(i)-A for i in input().split()])
ans = x.count(0)
if N >= 2:
for i in range(2, N+1):
check = list(itertools.combinations(x,i))
for i in check:
if sum(i) == 0:
ans += 1
print(ans) | N, A = [int(_) for _ in input().split()]
x = [int(_) for _ in input().split()]
dp = [[0] * (sum(x)+1) for j in range(N+1)]
dp[0][0] = 1
for i in range(1, N+1):
for j in list(range(1, N+1))[::-1]:
for k in list(range(x[i-1], sum(x[:i])+1))[::-1]:
dp[j][k] += dp[j-1][k - x[i-1]]
p... | p04013 |
N, A = [int(_) for _ in input().split()]
x = [int(_) for _ in input().split()]
dp = [[0] * (sum(x)+1) for j in range(N+1)]
dp[0][0] = 1
for i in range(1, N+1):
for j in list(range(1, N+1))[::-1]:
for k in list(range(x[i-1], sum(x[:i])+1))[::-1]:
dp[j][k] += dp[j-1][k - x[i-1]]
p... | N, A = [int(_) for _ in input().split()]
x = [int(i)-A for i in input().split()]
dp = [[0 for j in range(100 * N + 1)] for i in range(N + 1)]
dp[0][50 * N] = 1
for i in range(N):
for j in range(50, 100 * N + 1 - 50):
dp[i + 1][j] = dp[i][j] + dp[i][j - x[i]]
print((dp[N][50 * N] - 1)) | p04013 |
N, A = list(map(int,input().split()))
X = list(map(int,input().split()))
dp = [[[0 for i in range(N*50+1)] for j in range(N+1)] for k in range(N+1)]
for i in range(N+1):
dp[i][0][0] = 1
for i in range(1,N+1):
x = X[i-1]
for j in range(1,N+1):
for k in range(N*50+1):
if k < x:
... | N,A = list(map(int,input().split()))
X = list(map(int,input().split()))
for i in range(N):
X[i] -= A
dp = [[0 for i in range(5001)] for i in range(N+1)]
dp[0][2500] = 1
u = 2500
d = 2500
for i in range(1,N+1):
x = X[i-1]
if x <= 0:
d += x
else:
u += x
for j in range(d,u... | p04013 |
N, A = input().split(" ")
N, A = int(N), int(A)
x = input().split(" ")
x = [int(i) for i in x]
import itertools
cnt = 0
for n in range(1, N+1):
for i in itertools.combinations(x, n):
if sum(i) / n == A:
cnt += 1
print(cnt) | N, A = input().split(" ")
N, A = int(N), int(A)
x = input().split(" ")
x = [int(i) for i in x]
y = [0]+[int(i)-A for i in x]
X = max(x+[A])
dp = [[0 for t in range(2*N*X+1)] for j in range(N+1)]
for j in range(N+1):
for t in range(2*N*X+1):
if j == 0 and t == N*X: # 0枚の時は0しか達成できない
... | p04013 |
N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
sum_X = sum(X)
dp = [[[0]*(sum_X+1) 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(sum_X):
if dp[i][j][k] == 0: continue
# not used
dp[i+1][j][k] +... | N, A = list(map(int, input().split()))
# 予め-Kした状態で用意しておく
X = [A-int(x) for x in input().split()]
MAX = N*A*2
# dp[i][k] := i枚目までのカードで、合計をkにする通り数
dp = [[0]*(MAX+1) for _ in range(N+1)]
# 負の数を考慮して、N*K位置を0とする
dp[0][N*A] = 1
for i in range(N):
x = X[i]
for k in range(MAX+1):
dp[i+1][k] += dp[i][k]
i... | p04013 |
from collections import Counter
def main():
num, avg = list(map(int, input().split()))
data = list(map(int, input().split()))
dp = [[[0 for i in range(6000)] 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]
... | from collections import Counter
def main():
num, avg = list(map(int, input().split()))
data = list(map(int, input().split()))
max_num = max(num, avg, max(data))
dp = [[[0 for i in range(max_num ** 2 + 1)] for j in range(num + 1)] for k in range(num + 1)]
dp[0][0][0] = 1
for i i... | p04013 |
# -*- coding: utf-8 -*-
""" 3次元DP """
N,A = list(map(int, input().split()))
xN = list(map(int, input().split()))
X = max(max(xN), A)
# i(=xNリストからどこまでを選べる範囲とするか)からj(=0～N)枚選んで、選んだ値の合計をkにするような選び方の総数
dp = [[[0] * (N*X+1) for j in range(N+1)] for i in range(N+1)]
dp[0][0][0] = 1
ans = 0
for i in range(1,N+1... | # -*- coding: utf-8 -*-
""" 2次元DP """
N,A = list(map(int, input().split()))
xN = list(map(int, input().split()))
X = max(max(xN), A)
# 全てのxから-Aすることで、合計=0,平均=0を求める形にする
yN = [int(i)-A for i in xN]
# 二つ目の添え字はマイナスを取りうるので工夫する
dp = [[0] * (2*N*X+1) for j in range(N+1)]
# 基準点を0じゃなくて真ん中(N*X)にする
dp[0][N*X] = 1
... | p04013 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p04013 |
# -*- coding: utf-8 -*-
import sys
from collections import Counter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range... | # -*- coding: utf-8 -*-
import sys
from collections import defaultdict
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in r... | p04013 |
from itertools import combinations
from statistics import mean
n, a = list(map(int, input().split(" ")))
x = tuple(map(int, input().split(" ")))
count = 0
for m in range(1, n+1):
for nums in combinations(x, m):
if mean(nums) == a:
count += 1
print(count) | from collections import Counter
N, A = list(map(int, input().split(" ")))
X = list(map(int, input().split(" ")))
X = [x-A for x in X]
c = Counter([0])
for x in X:
d = Counter()
for k, v in list(c.items()):
d[k+x] += v
c += d
print((c[0]-1)) | p04013 |
N,A=list(map(int,input().split()))
x=[0]+list(map(int,input().split()))
#print x
max_n=max(x)
#dp=[[[0]*(max_n*N+1) for k in range(N+1)] for j in range(N+1)]
dp=[[[0]*3000 for k in range(51)] for j in range(51)]
#print dp
for j in range(N+1):
for k in range(N+1):
for s in range(max_n*N+1):
if j=... | N,A=list(map(int,input().split()))
x=[0]+list(map(int,input().split()))
#print x
y=[i-A for i in x]
#print y
max_x=max(max(x),A)
#print max_x
dp=[[0]*(2*N*max_x+1) for i in range(N+1)]
for j in range(N+1):
for t in range(2*N*max_x):
if j==0 and t==N*max_x:
dp[j][t]=1
elif j>=1 and (t-y[j]<0 or... | p04013 |
from collections import Counter
N,A = list(map(int, input().split()))
X = list(map(int, input().split()))
X = [x-A for x in X]
cnt = Counter([0, X[0]])
for x in X[1:]:
temp = Counter([])
for k,v in list(cnt.items()):
temp[k + x] += v
cnt += temp
print((cnt[0]-1))
... | from collections import Counter
n,a = list(map(int, input().split()))
l = list(map(int, input().split()))
l = [ai - a for ai in l]
cnt = Counter([0, l[0]])
for li in l[1:]:
tmp = Counter([])
for k,v in list(cnt.items()):
tmp[k+li] += v
cnt += tmp
print((cnt[0]-1)) | p04013 |
from collections import Counter,defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
de... | from collections import Counter,defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
de... | p04013 |
n,a = list(map(int,input().split()))
x = list(map(int,input().split()))
import collections
def Count(j,k,s):
if(j==0 and k==0 and s==0):
return 1
elif(j >= 1 and s < x[j-1]):
return Count(j-1,k,s)
elif(j >= 1 and k>=1 and s >= x[j-1]):
return Count(j-1,k,s) + Count(j-1,k-1,s-x[j-1])
elif(j < k):
... | n,a = list(map(int,input().split()))
x = list(map(int,input().split()))
def Count(n,k,a):
s = sum(x)
dp=[[[0 for l in range(s+1)] for j in range(k+1)] for i in range(n+1)]
dp[0][0][0]=1
Sum=0
for i in range(n):
for j in range(k+1):
for l in range(s+1):
if l < x[i]:
dp[i+1][j][l] = dp[i][... | p04013 |
n,a = list(map(int,input().split()))
lst = [int(i) for i in input().split()]
lst.sort()
ans = 0
for i in range(2 ** n):
bit = format(i,'b')
bit = bit.rjust(n,'0')
lcs = 0
cnt = 0
for w in range(n):
if bit[w]=='1':
lcs += lst[w]
cnt += 1
if c... | num,ave = list(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] =... | p04013 |
# -*- 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(4000+1)]... | # -*- 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(50*50+1)] for __ in range(N+1)] for ___ in range(N+1)]
dp[0][0][0] = 1 # 何も選んでない初期値
for i in r... | p04013 |
# -*- coding:utf-8 -*-
def solve():
N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
dp = [[[0 for _ in range(50*50+1)] for __ in range(N+1)] for ___ in range(N+1)]
dp[0][0][0] = 1 # 何も選んでない初期値
"""
dp[i][j][k] := 左からi+1枚目までに、j枚のカードを選んで、選んだカードの総和がkになる選び方の総数... | # -*- coding:utf-8 -*-
def solve():
N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
# dp[i][j][k] := 左からi+1枚目までに、j枚を選んで、選んだカードの総和がkになる場合の数
dp = [[[0 for _ in range(50*50+1)] for __ in range(N+1)] for ___ in range(N)]
dp[0][0][0] = 1
dp[0][1][X[0]] = 1
... | p04013 |
from itertools import combinations as c
n,a=list(map(int,input().split()))
l=list(map(int,input().split()))
v=0
for i in range(1,n+1):
v+=sum([1 for j in c(l,i) if sum(j)==a*i])
print(v) | n,a=list(map(int,input().split()))
l=list(map(int,input().split()))
x=max(l)
x=max(x,a)
dp=[[[0 for _ in range(n*x+1)] for _ in range(n+1)] for _ 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... | p04013 |
n,a=list(map(int,input().split()))
*x,=list(map(int,input().split()))
dp=[[[None]*(n*50+1) for i 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*50+1):
if i==0 and j==0 and k==0:
dp[i][j][k]=1
elif i and k<x[i-1... | n,a=list(map(int,input().split()))
*x,=list(map(int,input().split()))
dp=[[[0]*(n*50+1) for i 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*50+1):
if i==0 and j==0 and k==0:
dp[i][j][k]=1
elif i and k<x[i-1]:
... | p04013 |
N,A=list(map(int, input().split()))
x=list(map(int, input().split()))
dp = [[[0]*(51*51) for _ in range(N+1)] for _ in range(N+1)]
# dp[j][k][s]
for j in range(N+1):
for k in range(N+1):
for s in range(51*51):
if j==0 and k==0 and s==0:
dp[j][k][s] = 1
elif j... | N,A=list(map(int, input().split()))
x=list(map(int, input().split()))
dp = [[[0]*(51*51) for _ in range(N+1)] for _ in range(N+1)]
# dp[j][k][s]
for j in range(N+1):
for k in range(j+1):
for s in range(51*51):
if j==0 and k==0 and s==0:
dp[j][k][s] = 1
elif j... | p04013 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.