input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, A = list(map(int, input().split())) # N枚数のカード, 平均をAにしたい
X = tuple(map(int, input().split())) # N枚のカードの中身
dp = [[[0]*(50*N+1) for _ in range(N+1)] for _ in range(N+1)]
dp[0][0][0] = 1 # 0枚の中から0枚選んで合計が0になる選び方が1通りある
for i in range(N):
for j in range(N+1):
for k in range(50*N+1):
... | N, A = list(map(int, input().split())) # N枚数のカード, 平均をAにしたい
X = tuple(map(int, input().split())) # N枚のカードの中身
dp = [[[0]*(50*N+2) for _ in range(N+2)] for _ in range(N+2)]
dp[0][0][0] = 1 # 0枚の中から0枚選んで合計が0になる選び方が1通りある
for i in range(N):
for j in range(N+1):
for k in range(50*N+1):
... | p04013 |
N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
s = [{} for i in range(N+1)]
s[0][0] = 1
for i in range(N):
cur = X[i]
for j in range(N, 0, -1):
for k, v in list(s[j-1].items()):
s[j][cur + k] = s[j].get(cur + k, 0) + v
ans = 0
for i in range(1, N+1):
ans += s[i... | N, A = list(map(int, input().split()))
X = list([int(x) - A for x in input().split()])
d = {0: 1}
for cur in X:
for k, v in list(d.items()):
d[cur + k] = d.get(cur + k, 0) + v
print((d[0]-1)) | p04013 |
n,a = (int(i) for i in input().split())
x = [int(i) for i in input().split()]
m,answer = max(max(x),a),0
dp = [[[0]*(n*m+1) for i in range(n+1)] for i 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*m+1):
if i>=1 and k<x[i-1]: dp[i][j][k] = dp[i-1][j][k]
elif ... | n,a = (int(i) for i in input().split())
x = [int(i)-a for i in input().split()]
x = [0]+x
y = max(max(x)+a,a)
dp = [[0 for i in range(2*n*y+1)] for i in range(n+1)]
dp[0][n*y] = 1
for i in range(n+1):
for j in range(2*n*y+1):
if i>0 and (j-x[i]<0 or j-x[i]>2*n*y): dp[i][j]=dp[i-1][j]
elif i>0 and 0<=j-x[i... | p04013 |
from functools import lru_cache
N, A = list(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:
... | from functools import lru_cache
N, A = list(map(int, input().split()))
X = [int(x) for x in input().split()]
#with open("9", "w") as f:
# print(50, 1, file=f)
# print(*([1]*50), file=f)
assert len(X) == N
def solve0(i, n, s):
if s < 0:
return -1
if N-i+1 < n:
return -1
if n... | p04013 |
from itertools import combinations, starmap
N, A = list(map(int, input().split()))
x_list = list(map(int, input().split()))
coefficient = 1 # Aの係数
result = 0
while coefficient <= N:
for r in range(1, N+1):
multiple_of_a = coefficient * A
combis_sums = list(map(sum, combinations(x_list, ... | N, A = list(map(int, input().split()))
x = list(map(int, input().split()))
max_of_a = N * A
# dp[i][j][k] := i枚目までからj枚取って、合計をkにする通り数
dp = [[[0] * (max_of_a + 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(max_of_a + 1):
... | p04013 |
from collections import Counter
from copy import copy
N,A = list(map(int,input().split()))
src = list(map(int,input().split()))
dp = [Counter()]
dp[0][0] = 1
for i,a in enumerate(src):
dp.append(Counter())
for j in reversed(list(range(i+1))):
for k,v in list(dp[j].items()):
dp[j+... | from collections import Counter
N,A = list(map(int,input().split()))
src = list(map(int,input().split()))
dp = [Counter({0:1})]
for i,a in enumerate(src):
dp.append(Counter())
for j in reversed(list(range(i+1))):
for k,v in list(dp[j].items()):
dp[j+1][k+a] += v
ans = 0
for... | p04013 |
n,a=list(map(int,input().split()))
lists=list(map(int,input().split()))
x=max(lists)
dp=[[[0 for i in range(2602)] for j in range(51)] for _ in range(51)]
dp[0][0][0]=1
#dp[i][j][k] で0からi番目のカードまでのうちで ｊ枚を選択して、その時に選んだ数の合計がsとなるような方法の総数を刺すことにする
for i in range(n+1):
for j in range(n+1):
for k in range(n*... | n,a=list(map(int,input().split()))
lists=list(map(int,input().split()))
for i in range(n):
lists[i]-=a
answer=0
dp=[[0 for i in range(5001)] for _ in range(51)]
#dp[i][j]で0からi枚目まで好きなように選択してそのそうわがｊ-2500となるような撮り方の総数
#最終的に求めるのはdp[i][0]である
for i in range(n+1):
for j in range(4951):
if i>=1 and... | p04013 |
N, A = list(map(int, input().split()))
X = list([int(x) - A for x in input().split()])
maxn = max(max(X), A)
dp = [[0 for _ in range(2 * N * maxn + 1)] for _ in range(N + 1)]
dp[0][N * maxn] = 1
for i in range(N):
for k in range(2 * N * maxn + 1):
dp[i + 1][k] = dp[i][k]
if 0 <= k - X[i]... | N, A = list(map(int, input().split()))
X = list([int(x) - A for x in input().split()])
maxn = max(max(X), A)
dp = [[0] * (2 * N * maxn + 1) for _ in range(N + 1)]
dp[0][N * maxn] = 1
for i in range(N):
for k in range(2 * N * maxn + 1):
dp[i + 1][k] = dp[i][k]
if 0 <= k - X[i] <= 2 * N * ... | p04013 |
from collections import deque
n,a=list(map(int,input().split()))
cards=list(map(int,input().split()))
noz=[x-a for x in cards].count(0)
pl=[x-a for x in cards if x-a>0]
nl=[a-x for x in cards if x-a<0]
sl=[pl,nl][len(nl)<=len(pl)]
ll=[pl,nl][len(pl)<len(nl)]
sl.sort()
ll.sort()
sumfunc = lambda n, l... | import sys
n,a=list(map(int, input().split()))
cards=list(map(int, input().split()))
integers=[x-a for x in cards]
cards.append(a)
f=max(cards)*n
dp=[[0 for i in range(n+1)] for j in range(2*f+1) ]
for y in range(n+1):
for x in range(2*f+1):
if y==0 and x==f:
dp[x][y]=1
... | p04013 |
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
dp = [[[0] * (50 * (n + 10)) for _ in range(n + 10)] for _ in range(n + 10)]
dp[0][0][0] = 1
for i in range(n):
for use in range(n):
for total in range(n * a):
dp[i + 1][use][total] += dp[i][use][total]
... | n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
dp = [[[0] * (50 * (n + 10)) for _ in range(n + 10)] for _ in range(n + 10)]
dp[0][0][0] = 1
for i in range(n):
for use in range(n):
for total in range(n * a):
if dp[i][use][total]:
dp[i + 1][u... | p04013 |
from collections import Counter
n,a=list(map(int,input().split()))
x=list(map(int,input().split()))
for i in range(n):
x[i]-=a
left=x[:n//2]
l=len(left)
right=x[n//2:]
r=len(right)
data_left=Counter()
data_right=Counter()
for i in range(1,2**l):
num=0
for j in range(l):
i... | n,a=list(map(int,input().split()))
x=list(map(int,input().split()))
for i in range(n):
x[i]-=a
dp=[0]*(2*n*50+2)
dp[0]=1
for i in range(n):
h=dp[:]
for j in range(-(n-1)*50,(n-1)*50+1):
h[j]+=dp[j-x[i]]
dp=h
print((dp[0]-1)) | p04013 |
import itertools as itr
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
#print(n,a)
#print(x)
cnt=0
for i in range(1,n+1):
for y in itr.combinations(x,i):
#print(y)
if sum(y) == i*a:
cnt += 1
print(cnt) | # -*- coding: utf-8 -*-
"""
Created on Sun Aug 5 12:20:16 2018
ABC44C
@author: maezawa
"""
def f(i, j):
global xa
global dp
if i==0:
cnt = 0
if j==0:
cnt += 1
if j==xa[0]:
cnt += 1
return cnt
if (i, j) in dp:
return dp[(... | p04013 |
from collections import Counter
n,a = list(map(int,input().split()))
x = [int(i)-a for i in input().split()]
dp = [Counter()]
# [何個使ったか][sum]
dp[0][0] = 1
for i,j in enumerate(x):
dp.append(Counter())
for k in reversed(list(range(i+1))):
for m,n in list(dp[k].items()):
dp[k+1][m+j] += n
res = 0
... | from collections import Counter
n,a = list(map(int,input().split()))
x = list(map(int,input().split()))
dp = [Counter()]
# [何個使ったか][sum]
dp[0][0] = 1
for i,j in enumerate(x):
dp.append(Counter())
for k in reversed(list(range(i+1))):
for m,p in list(dp[k].items()):
dp[k+1][m+j] += p
res = 0
for ... | p04013 |
from collections import defaultdict
n, k = list(map(int, input().split()))
arr = list(map(int, input().split()))
arr = [x - k for x in arr]
arr.sort()
arr_minus = [-x for x in arr if x < 0]
arr_zero = sum(x==0 for x in arr)
arr_plus = [x for x in arr if x > 0]
minus_nums = defaultdict(int)
for i ... | from collections import defaultdict
n, k = list(map(int, input().split()))
arr = list(map(int, input().split()))
arr = [x - k for x in arr]
dct = defaultdict(int)
dct[0] = 1
for x in arr:
for k, v in list(dct.items()):
dct[k + x] += v
print((dct[0] - 1))
| p04013 |
N, A = [int(_) for _ in input().split()]
X = [int(_) - A for _ in input().split()]
dp = [0] * 3000 + [1] + [0] * 3000
for x in X:
dp_old = dp.copy()
for i in range(max(-x, 0), min(6001, 6001 - x)):
dp[i + x] += dp_old[i]
print((dp[3000] - 1))
| N, A = [int(_) for _ in input().split()]
X = [int(_) - A for _ in input().split()]
M = max(X + [A])
dp = [0] * (2 * N * M + 1)
dp[N * M] = 1
for x in X:
dp_old = dp.copy()
for i in range(max(-x, 0), min(2 * N * M + 1, 2 * N * M + 1 - x)):
dp[i + x] += dp_old[i]
print((dp[N * M] - 1))
| p04013 |
N, A = [int(_) for _ in input().split()]
X = [int(_) - A for _ in input().split()]
X_plus = [_ for _ in X if _ > 0]
X_minus = [-_ for _ in X if _ < 0]
l_plus = len(X_plus)
l_minus = len(X_minus)
l_zero = len(X) - l_plus - l_minus
s_plus = sum(X_plus)
s_minus = sum(X_minus)
dp_plus = [1] + [0] * s_plus
dp_minu... | N, A = [int(_) for _ in input().split()]
X = [int(_) - A for _ in input().split()]
X_plus = [_ for _ in X if _ > 0]
X_minus = [-_ for _ in X if _ < 0]
l_zero = len(X) - len(X_plus) - len(X_minus)
s_plus = sum(X_plus)
s_minus = sum(X_minus)
dp_plus = {0: 1}
dp_minus = {0: 1}
for p in X_plus:
dp_plus_old = ... | p04013 |
import collections
import itertools
import functools
@functools.lru_cache(maxsize=100000000)
def sigma(s):
return sum(k * v for k, v in s)
def main():
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
d = collections.defaultdict(int)
d[0] = 1
for c... | import collections
def main():
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
d = collections.defaultdict(int)
d[0] = 1
for c in x:
current = list(d.items())
for diff, count in current:
delta = diff + c - a
d[delta... | p04013 |
from collections import defaultdict
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
dp = [defaultdict(int) for _ in range(n+1)]
dp[0][a] += 1
for i, x_i in enumerate(x):
for p in list(dp[i].keys()):
pk = p + a - x_i
dp[i+1][pk] += dp[i][p]
dp[i+1][p] +... | n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
x = [i - a for i in x]
# print(x)
D = {0 : 1}
for i in x:
for j, k in list(D.items()):
D[i+j] = D.get(i+j, 0) + k
# print(D)
print((D[0] - 1))
| p04013 |
N,A = list(map(int,input().split()))
L = list(map(int,input().split()))
#for i in range(N) :
# L[i] -= A
#L = sorted(L)
ans = 0
for bit in range(1 << N) :
calc = 0
ctr = 0
for k in range(N) :
if bit & (1 << k) :
calc += L[k]
ctr += 1
if calc == 0 :
... | N,A = list(map(int,input().split()))
X = list(map(int,input().split()))
ma = max(X)
dp = [[[0 for s in range(ma*N+1)] for k in range(N+1)] for i in range(N+1)]
dp[0][0][0] = 1
for i in range(1,N+1) :
for k in range(i+1) :
for s in range(ma*N+1) :
if (k >= 1) and (s >= X[i-1]) :... | p04013 |
iN,iA =[int(x) for x in input().split()]
#aX = [int(x) - iA for x in input().split()]
aX = [int(x) for x in input().split()]
#解法1
#すげーな動的計画法
iMX = max(aX + [iA])
dp = [[[0]*(iN*iMX + 1) for _ in range(iN+1)] for _ in range(iN + 1)]
dp[0][0][0] = 1
for j in range(1,iN+1):
for k in range(0,iN+1):
... | iN,iA =[int(x) for x in input().split()]
aX = [int(x) - iA for x in input().split()]
#解法2
iMX = max(aX + [iA])
dp = [[0]*(2 * iN*iMX + 1) for _ in range(iN+1)]
for j in range(0,iN+1):
for t in range(0,2*iN*iMX):
if j == 0 and t == iN * iMX :
dp[j][t] = 1
elif j >= 0 and ( ... | p04013 |
iN,iA =[int(x) for x in input().split()]
aX = [int(x) - iA for x in input().split()]
#解法2
iMX = max(aX + [iA])
dp = [[0]*(2 * iN*iMX + 1) for _ in range(iN+1)]
for j in range(0,iN+1):
for t in range(0,2*iN*iMX):
if j == 0 and t == iN * iMX :
dp[j][t] = 1
elif j >= 0 and ( ... | iN,iA =[int(x) for x in input().split()]
aX = [int(x) - iA for x in input().split()]
#解法2そのまま
iMX = max(aX + [iA])
iULim = iN*iMX
iULim2 = 2*iULim
#y0..yjから0枚以上選んだ合計をt-iN*iMXにするような選び方の総数
dp = [[0]*(iULim2 + 1) for _ in range(iN+1)]
for j in range(0,iN+1):
for t in range(0,iULim2):
if j == 0 ... | p04013 |
iN,iA =[int(x) for x in input().split()]
#aX = [int(x) - iA for x in input().split()]
aX = [int(x) for x in input().split()]
#解法1
iMX = max(aX + [iA])
dp = [[[0]*(iN*iMX + 1) for _ in range(iN+1)] for _ in range(iN + 1)]
dp[0][0][0] = 1
for j in range(1,iN+1):
# for k in range(0,iN+1):
for k in ran... | #分割してみた。これで通るかな？
iN,iA =[int(x) for x in input().split()]
aX = [int(x) - iA for x in input().split()]
aPlus = [x for x in aX if 0 < x ]
aMinus = [-1 * x for x in aX if x < 0 ]
iLenPlus = len(aPlus)
iLenMinus = len(aMinus)
iLen0 = iN - iLenPlus - iLenMinus
def fnCr(iN,iR):
if iN - iR < iR :
iR =... | p04013 |
#人のすなるCounterなるものを我も書いてみんとてするなり
from collections import Counter
#方針 マイナスとプラスでDPを分割
iN,iA =[int(x) for x in input().split()]
aX = [int(x) - iA for x in input().split()]
aPlus = [x for x in aX if 0 < x ]
aMinus = [-1 * x for x in aX if x < 0 ]
iLenPlus = len(aPlus)
iLenMinus = len(aMinus)
iLen0 = iN - iLenP... | def 解():
iN,iA =[int(x) for x in input().split()]
aX = [int(x) - iA for x in input().split()]
aPlus = [x for x in aX if 0 < x ]
aMinus = [-1 * x for x in aX if x < 0 ]
iLenPlus = len(aPlus)
iLenMinus = len(aMinus)
iLen0 = iN - iLenPlus - iLenMinus
iCZero = 2**iLen0 - 1 #sum(k=... | p04013 |
def 解():
iN,iA =[int(x) for x in input().split()]
aX = [int(x) - iA for x in input().split()]
aPlus = [x for x in aX if 0 < x ]
aMinus = [-1 * x for x in aX if x < 0 ]
iLenPlus = len(aPlus)
iLenMinus = len(aMinus)
iLen0 = iN - iLenPlus - iLenMinus
iCZero = 2**iLen0 - 1 #sum(k=... | #正負で分割
#dpの作り方はARCの方の人のロジックを参考にした。
#こんなんでええんや...
def 解():
iN,iA =[int(x) for x in input().split()]
aX = [int(x) - iA for x in input().split()]
aPlus = [x for x in aX if 0 < x ]
aMinus = [-1 * x for x in aX if x < 0 ]
iLenPlus = len(aPlus)
iLenMinus = len(aMinus)
iLen0 = iN - iLenP... | p04013 |
# C - 高橋君とカード / Tak and Cards
#import numpy as np
import math
N, A = list(map(int, input().split()))
#x = np.array(list(map(int, input().split())))
x = list(map(int, input().split()))
# 数列aと整数Aを与えると、aからいくつか取って合計Aにするパターンが何通りあるかを返す関数
def partial_sum(a,A):
n = len(a)
dp = [[0]*(A+2) for _ in range(n... | # C - 高橋君とカード / Tak and Cards
#import numpy as np
import math
N, A = list(map(int, input().split()))
x = list(map(int, input().split()))
# 数列aと整数Aを与えると、aからいくつか取って合計Aにするパターンが何通りあるかを返す関数
def partial_sum(a,A):
n = len(a)
dp = [[0]*(A+2) for _ in range(n+2)] # dp[i+1][j] a[i]までの数からいくつか選んで総和をjにするパターンの数... | p04013 |
import sys
input = sys.stdin.readline
def main():
n, a = list(map(int, input().split()))
x = tuple(map(int, input().split()))
sm_mx = sum(x)
dp = [[[0] * (sm_mx + 1) for i in range(n + 1)] for j in range(n + 1)]
dp[0][0][0] = 1
for i, e in enumerate(x, 1):
for j in r... | import sys
input = sys.stdin.readline
def main():
n, a = list(map(int, input().split()))
x = tuple(map(int, input().split()))
sm_mx = sum(x)
dp = [[[0] * (sm_mx + 1) for _ in range(n + 1)] for _ in range(n + 1)]
dp[0][0][0] = 1
for i, e in enumerate(x, 1):
for j in r... | p04013 |
import sys
input = sys.stdin.readline
def main():
n, a = list(map(int, input().split()))
x = tuple(map(int, input().split()))
sm_mx = sum(x)
dp = [[[0] * (sm_mx + 1) for _ in range(n + 1)] for _ in range(n + 1)]
dp[0][0][0] = 1
for i, e in enumerate(x, 1):
for j in r... | def main():
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
mx = max(x + [a])
for i in range(n):
x[i] -= a
sm = 2 * n * mx
dp = [[0] * (sm + 1) for _ in range(n + 1)]
dp[0][n*mx] = 1
for i, e in enumerate(x, 1):
for j in ra... | p04013 |
n,a = list(map(int,input().split()))
x = list(map(int,input().split()))
x = list([y-a for y in x])
ans = -1
for i in range(2**n):
tmp = 0
for j in range(n):
if (i >> j) & 1:
tmp += x[j]
if tmp == 0:
ans += 1
print(ans) | n,a = list(map(int,input().split()))
x = sorted(list([int(y)-a for y in input().split()]))
sx = max(abs(x[0]),abs(x[-1]))*n
dp = [[0 for _ in range(2*sx+2)] for _ in range(n+1)]
dp[0][0] = 1
for j in range(n):
for t in range(-sx-1,sx+1):
if -sx <= t-x[j] and t-x[j] <= sx:
dp[j+1][... | p04013 |
N,A = (int(T) for T in input().split())
X = [int(T) for T in input().split()]
DP = [[[0]*(N+1) for TS in range(0,50*N+1)] for TI in range(0,N+1)]
DP[0][0][0] = 1
for TI in range(0,N):
for TS in range(0,50*N+1):
for TK in range(0,N+1):
if DP[TI][TS][TK]!=0:
DP[TI+1][TS][TK... | N,A = (int(T) for T in input().split())
X = [int(T)-A for T in input().split()]
DP = [[0]*(2*(50*N)+1) for TI in range(0,N+1)]
DP[0][50*N] = 1
for TI in range(0,N):
for TS in range(0,2*50*N+1):
if DP[TI][TS]!=0:
DP[TI+1][TS] += DP[TI][TS]
DP[TI+1][TS+X[TI]] += DP[TI][TS]
pri... | p04013 |
import sys
input=sys.stdin.readline
n,a=list(map(int,input().split()))
x=[0]+list(map(int,input().split()))
su=sum(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(su+1):
if k<x[i]:
... | import sys
input=sys.stdin.readline
n,a=list(map(int,input().split()))
x=[0]+list(map(int,input().split()))
su=sum(x)
maxi=max(x)
dp=[[[0 for k in range(maxi*n+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):
... | p04013 |
import sys
input=sys.stdin.readline
n,a=list(map(int,input().split()))
x=[0]+list(map(int,input().split()))
su=sum(x)
maxi=max(x)
dp=[[[0 for k in range(maxi*n+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):
... | from collections import Counter
n,a=list(map(int,input().split()))
X=sorted(list([int(x)-a for x in input().split()]))
ans=Counter([0])
for x in X:
tmp=Counter()
for i,j in list(ans.items()):
tmp[i+x]+=j
ans+=tmp
print((ans[0]-1))
| p04013 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, A, *X = list(map(int, read().split()))
M = sum(X)
dp = [[0] * (M + 1) for j in range(N + 1)]
dp[0][0] = 1
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, A, *X = list(map(int, read().split()))
M = sum(X)
dp = [[0] * (M + 1) for j in range(N + 1)]
dp[0][0] = 1
... | p04013 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, A, *X = list(map(int, read().split()))
X = [x - A for x in X]
base = 2500
dp = [[0] * 5001 for _ in range(N + 1)]... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, A, *X = list(map(int, read().split()))
X = [x - A for x in X]
neg = pos = 0
for x in X:
if x > 0:
... | p04013 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, A, *X = list(map(int, read().split()))
X = [x - A for x in X]
base = 2500
dp = [[0] * 5001 for _ in range(N + 1... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, A, *X = list(map(int, read().split()))
X = [x - A for x in X]
base = 2500
dp = [0] * 5001
dp[base] = 1
... | p04013 |
import sys
readline = sys.stdin.readline
from collections import Counter
def main():
N, A = list(map(int, readline().rstrip().split()))
X = list(map(int, readline().rstrip().split()))
X = [x-A for x in X]
ans = 0
X1 = X[:N//2]
X2 = X[N//2:]
X1_sum = [0]
for i in range(1, 2**... | import sys
readline = sys.stdin.readline
def main():
N, A = list(map(int, readline().rstrip().split()))
X = list(map(int, readline().rstrip().split()))
lim = max(X) * N
X = [x-A for x in X]
dp = [[0]*(2*lim) for _ in range(N+1)]
dp[0][lim] = 1
for i in range(1, N+1):
x = ... | p04013 |
# 配るDP
N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
dp = [[[0 for _ in range(3010)] 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[... | # 配るDP
N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
dp = [[[0 for _ in range(3010)] 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):
if dp[i][j][k]:
dp[i+1][j][k... | p04013 |
N, A = list(map(int, input().split()))
lst = [int(x) for x in input().split()]
ret = 0
for i in range(2 ** N):
n = 0
cnt = 0
for j in range(N):
if i >> j & 1:
n += lst[j]
cnt += 1
if cnt > 0 and n / cnt == A:
ret += 1
print(ret)
| N, A = list(map(int, input().split()))
lst = [int(x) - A for x in input().split()]
dp = [[0] * (100 * N + 1) for _ 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 - lst[i]]
print((dp[N][50 * N] - 1))
| p04013 |
NMAX = 55
N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
dp = [[[0] * NMAX for s in range(3000)] for i in range(NMAX)]
dp[0][0][0] = 1 # dp[i][s][k]: i個からk個選ぶとき、総和がsのものの個数
for i in range(N): # N-1時点でNが更新されるのでここまでで十分
for s in range(3000):
for k in range(N+1):
... |
NMAX = 55
T = 2500
N, A = list(map(int, input().split()))
X = list([int(x) - A for x in input().split()])
dp = [[0]*5001 for i in range(NMAX)] # i時点で総和がSになるものの個数
dp[0][T] = 1
for i in range(N):
for s in range(5001):
if s+X[i] > 5001 or dp[i][s] == 0:
continue
dp[i+1][s... | p04013 |
while True:
things = {}
count = eval(input())
if count == 0: break
for i in range(count):
fuga = input().split()
things[fuga[0]] = int(fuga[1])
for i in range(eval(input())):
fuga = input().split()
money =0
for j in range(int(fuga[1])):
... | while True:
things = {}
count = eval(input())
if count == 0: break
for i in range(count):
fuga = input().split()
things[fuga[0]] = int(fuga[1])
for i in range(eval(input())):
fuga = input().split()
money =0
for j in range(int(fuga[1])):
... | p00201 |
n,a,b,k=list(map(int,input().split()))
p=998244353
def getinv(n):
inv=[0]*(n+1)
for i in range(1,n+1):
inv[i]=pow(i,p-2,p)
return inv
def getnCr(n):
inv=getinv(n)
nCr=[0]*(n+1)
nCr[0]=1
for i in range(1,n+1):
nCr[i]=(nCr[i-1]*(n-i+1)*inv[i])%p
return nCr
def solve(n,a,b,k):
ans=... | p=998244353
def getinv(n):
inv = [0]*(n+1)
#フェルマーの小定理より、i=1の時は1であることが分かる
inv[1] = 1
for i in range(2,n+1):
#そのまま計算すると負になってしまうので、最後にmod pを取ることで正に戻す
inv[i] = (-(p//i)*inv[p%i])%p
return inv
def getCmb(n):
#逆元を取得
inv = getinv(n)
#0 <= r <= n に対してnCrを求める
nCr = [0]*(n+1)
#r=0の時は、r... | p03332 |
# -*- coding: utf-8 -*-
"""
Created on Sat Mar 16 15:50:39 2019
@author: Yamazaki Kenichi
"""
N,A,B,K = list(map(int,input().split()))
mod = 998244353
T = []
R = K//A
for i in range(R+1):
if i == 0:
if K%B == 0 and K//B <= N:
T.append([0,0,K//B,N-K%B])
continue
if... | # -*- coding: utf-8 -*-
"""
Created on Sat Mar 16 18:32:20 2019
@author: Yamazaki Kenichi
"""
N,A,B,K = list(map(int,input().split()))
mod = 998244353
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inv = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, N+1):
g1.append((g1[-1] * i) % mod)
inv.append((-inv[mod ... | p03332 |
# -*- coding: utf-8 -*-
"""
Created on Sat Mar 16 18:32:20 2019
@author: Yamazaki Kenichi
"""
N,A,B,K = list(map(int,input().split()))
mod = 998244353
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inv = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, N+1):
g1.append((g1[-1] * i) % mod)
inv.append((-inv[mod ... | # -*- coding: utf-8 -*-
"""
Created on Sat Mar 16 18:40:19 2019
@author: Yamazaki Kenichi
"""
N,A,B,K = list(map(int,input().split()))
mod = 998244353
def cmb(n, r, mod):
if (r < 0 or r > n):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
g1 = [1, 1] # 元テーブル
g2 = [1, ... | p03332 |
N, A, B, K = list(map(int, input().split()))
maxAB = max(A, B)
minAB = min(A, B)
ans = 0
def cmb(n, r):
if (r < 0 or r > n):
return 0
r = min(r, n-r)
return fac[n] * finv[r] * finv[n-r] % mod
mod = 998244353 # 問題によって変える、ここは素数でないとうまく動かない
N_cmb = 0
N_cmb += N # 入力の制約によって変えるところ、nCr... | N, A, B, K = list(map(int, input().split()))
maxAB = max(A, B)
minAB = min(A, B)
ans = 0
def cmb(n, r):
if (r < 0 or r > n):
return 0
r = min(r, n-r)
return fac[n] * finv[r] * finv[n-r] % mod
mod = 998244353 # 問題によって変える、ここは素数でないとうまく動かない
N_cmb = 0
N_cmb += N # 入力の制約によって変えるところ、nCr... | p03332 |
#from collections import deque,defaultdict
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 998244353
def ddprint(x):
if DBG:
... | #from collections import deque,defaultdict
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 998244353
def ddprint(x):
if DBG:
... | p03332 |
MOD = 998244353
MAX = int(3e5 + 1)
def div(a, b):
return a * pow(b, MOD-2, MOD) % MOD
FACT = [1] * (MAX+1)
for i in range(1, MAX+1):
FACT[i] = (i * FACT[i-1]) % MOD
INV = [1] * (MAX+1)
INV[MAX] = div(1, FACT[MAX])
for i in range(MAX, 0, -1):
INV[i-1] = (INV[i] * i) % MOD
def main():
... | MOD = 998244353
MAX = int(3e5 + 10)
def div(a, b):
return a * pow(b, MOD-2, MOD) % MOD
FACT = [1] * (MAX+1)
for i in range(1, MAX+1):
FACT[i] = (i * FACT[i-1]) % MOD
INV = [1] * (MAX+1)
INV[MAX] = div(1, FACT[MAX])
for i in range(MAX, 0, -1):
INV[i-1] = (INV[i] * i) % MOD
def main():
... | p03332 |
import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline
def ii(): return int(eval(input()))
def mi(): return list(map(int, input().rstrip().split()))
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
# template
# BEGIN CUT HERE
# MOD = 10**9 + 7
... | import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline
def ii(): return int(eval(input()))
def mi(): return list(map(int, input().rstrip().split()))
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
# template
# BEGIN CUT HERE
# MOD = 10**9 + 7
... | p03332 |
def cmb1(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 998244353 #出力の制限
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse... | n, a, b, k = list(map(int, input().split()))
def cmb1(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 998244353 #出力の制限
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
... | p03332 |
N, A, B, K = tuple(map(int, (input().split())))
mod = 998244353
def ab(n):
ab = []
a = n // A
while (n - A * a) % B != 0:
a -= 1
b = (n - A * a) // B
ab.append((a, b))
while a > 0:
a, b = a - B // gcd(A, B), b + A // gcd(A, B)
if a < 0:
break
... | N, A, B, K = tuple(map(int, (input().split())))
mod = 998244353
factorial = [1 for i in range(N + 1)]
inverse = [1 for i in range(N + 1)]
for i in range(1, N + 1):
factorial[i] = (factorial[i - 1] * i) % mod
inverse[i] = inverse[i - 1] * pow(i, mod - 2, mod) % mod
com = [1 for i in range(N + 1)]
for... | p03332 |
# 拡張ユークリッド互除法
# gcd(a,b) と ax + by = gcd(a,b) の最小整数解を返す
def extgcd(a, b):
if a == 0:
return b, 0, 1
else:
g, y, x = extgcd(b % a, a)
return g, x - (b // a) * y, y
# aの逆元(mod m)を求める。(aとmは互いに素であることが前提)
def mod_inv(a,m):
gcd, x, y = extgcd(a,m)
return (m+x%m)%m
N... | def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
N, A, B, K = list(map(int, input().split()))
p = 998244353
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv ... | p03332 |
class Factorial:
def __init__(self, n, mod):
self.f = [1]
self.mod = mod
for j in range(1, n + 1):
self.f.append(self.f[-1] * j % mod)
self.i = [pow(self.f[-1], mod - 2, mod)]
for j in range(n, 0, -1):
self.i.append(self.i[-1] * j % mod)
... | def main():
class Factorial:
def __init__(self, n, mod):
self.f = [1]
self.mod = mod
for j in range(1, n + 1):
self.f.append(self.f[-1] * j % mod)
self.i = [pow(self.f[-1], mod - 2, mod)]
for j in range(n, 0, -1):
... | p03332 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product
... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product
sy... | p03332 |
n, a, b, k = list(map(int, input().split()))
M = 998244353
fact_n = [None for m in range(n+1)]
fact_inv = [None for m in range(n+1)]
def combination(n, r):
if n == 0 and r == 0:
return 1
elif n < r or n < 0:
return 0
c = fact_inv[r] * fact_inv[n-r] % M
return fact_n[n] ... | n, a, b, k = list(map(int, input().split()))
M = 998244353
fact_n = [0 for m in range(n+1)]
fact_inv = [0 for m in range(n+1)]
def combination(n, r):
if n == 0 and r == 0:
return 1
elif n < r or n < 0:
return 0
c = fact_inv[r] * fact_inv[n-r] % M
return fact_n[n] * c % ... | p03332 |
n, a, b, k = list(map(int, input().split()))
M = 998244353
fact_n = [0 for m in range(n+1)]
fact_inv = [0 for m in range(n+1)]
def combination(n, r):
if n == 0 and r == 0:
return 1
elif n < r or n < 0:
return 0
c = fact_inv[r] * fact_inv[n-r] % M
return fact_n[n] * c % ... | n, a, b, k = list(map(int, input().split()))
M = 998244353
fact_n = [0 for m in range(n+1)]
fact_inv = [0 for m in range(n+1)]
def mod_pow(a, n):
x = 1
while n > 0:
if n & 1:
x = x * a % M
a = a * a % M
n >>= 1
return x
def combination(n, r):
... | p03332 |
n,a,b,k = list(map(int,input().split()))
mod = 998244353
fact = [1,1]
finv = [1,1]
inv = [0,1]
for i in range(2,n+5):
fact.append((fact[-1]*i)%mod)
inv.append((inv[mod%i]*(mod-mod//i))%mod)
finv.append((finv[-1]*inv[-1])%mod)
def nCr(n,r,mod):
if r > n:
return 0
else:
... | n,a,b,k = list(map(int,input().split()))
mod = 998244353
fact = [1,1]
finv = [1,1]
inv = [0,1]
for i in range(2,n+5):
fact.append((fact[-1]*i)%mod)
inv.append((inv[mod%i]*(mod-mod//i))%mod)
finv.append((finv[-1]*inv[-1])%mod)
def nCr(n,r,mod):
if r > n:
return 0
else:
... | p03332 |
mod=998244353
N,A,B,K=list(map(int,input().split()))
#繰り返し二乗法
def great_power(x, y):
if y == 0:
return 1
elif y == 1:
return x % mod
elif y % 2 == 0:
return great_power(x, y//2)**2 % mod
else:
return great_power(x, y//2)**2 * x % mod
#階乗計算
factorial=[1]
for i... | mod=998244353
N,A,B,K=list(map(int,input().split()))
#繰り返し二乗法
def great_power(x, y):
if y == 0:
return 1
elif y == 1:
return x % mod
elif y % 2 == 0:
return great_power(x, y//2)**2 % mod
else:
return great_power(x, y//2)**2 * x % mod
#階乗計算
factorial=[1]
for i... | p03332 |
N, A, B, K = list(map(int, input().split()))
mod = 998244353
F = [1]
RF = []
def inv(x):
res = 1
k = mod - 2
y = x
while k:
if k & 1:
res = (res * y) % mod
y = (y * y) % mod
k //= 2
return res
def init():
for i in range(N):
F.... | N, A, B, K = list(map(int, input().split()))
mod = 998244353
fact = [1] * (N + 1)
ifact = [1] * (N + 1)
def init():
for i in range(N):
fact[i + 1] = fact[i] * (i + 1) % mod
ifact[i + 1] = pow(fact[i + 1], mod - 2, mod)
def comb(x, y):
if y < 0 or y > x:
return 0
... | p03332 |
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 998244353 #出力の制限
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.... | def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 998244353 #出力の制限
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.... | p03332 |
def read():
return int(eval(input()))
def reads():
return [int(x) for x in input().split()]
P = 998244353
N, A, B, K = reads()
fact = [1]
for i in range(1, N+1):
fact.append(fact[i-1] * i % P)
def egcd(a, b):
if b == 0:
return a, 1, 0
else:
q, r = divmod(a, b)
g, x, y = egc... | def read():
return int(eval(input()))
def reads():
return [int(x) for x in input().split()]
P = 998244353
N, A, B, K = reads()
def inv(n):
return pow(n, P-2, P)
fact = [1] * (N+1)
for i in range(1, N+1):
fact[i] = fact[i-1] * i % P
invfact = [inv(fact[N])] * (N+1)
for i in range(N, 0, -1... | p03332 |
import math
L = input().split()
sp = 998244353
# approx 10**9
N = int(L[0])
A = int(L[1])
B = int(L[2])
K = int(L[3])
def binom(n,m):
if n == m:
return 1
elif m == 1:
return n
elif m > n:
return 0
else:
a = math.factorial(n)
b = math.factorial(m)
c = math.factorial(n - m)
return a... | N,A,B,K = list(map(int,input().split()))
sprime = 998244353 # approx 10**9
A,B = sorted((A,B))
if (A+B) * N < K:
print((0))
exit()
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a) * y, y)
def modinv(a, m):
g, x, y... | p03332 |
N, A, B, K = list(map(int, input().split()))
mod = 998244353
fac = [1]
inv = [1]
for i in range(1, N + 1) :
fac.append(fac[-1] * i % mod)
inv.append(pow(fac[-1], mod - 2, mod))
ret = 0
for na in range(N + 1) :
if (K - na * A) % B != 0 :
continue
nb = (K - na * A) // B
... | N, A, B, K = list(map(int, input().split()))
mod = 998244353
fac = [1]
inv = [1]
for i in range(1, N + 1) :
fac.append(fac[-1] * i % mod)
inv.append(pow(fac[-1], mod - 2, mod))
ret = 0
for na in range(N + 1) :
if (K - na * A) % B != 0 :
continue
nb = (K - na * A) // B
... | p03332 |
from math import factorial as fac
def cc(n,r):
def fac2(n,r):
m = 1
for i in range(n-r+1,n+1):
m*=i
return m
r = min(r,n-r)
return fac2(n,r)//fac(r)
n, a, b, k = list(map(int, input().split()))
mod = 998244353
ans = 0
for i in range(min(k//a+1,n+1)):
jof = k-a*i
if jof%b==0 and... | n,a,b,k = list(map(int,input().split()))
mod = 998244353
fun = [1]*(n+1)
for i in range(1,n+1):
fun[i] = fun[i-1]*i%mod
rev = [1]*(n+1)
rev[n] = pow(fun[n],mod-2,mod)
for i in range(n-1,0,-1):
rev[i] = rev[i+1]*(i+1)%mod
def nCr(n,r):
if r > n:
return 0
return fun[n]*rev[r]%mod*rev[n-r]%mod
ans... | p03332 |
n, a, b, k = list(map(int, input().split()))
MOD = 998244353
a_max = min(k // a, n) + 1
pair = []
for i in range(a_max):
if (k - a * i) % b == 0:
j = (k - a * i) // b
if j <= n:
pair.append([i % MOD,j % MOD])
inv = [0] * (n + 1)
inv[1] = 1
for i in range(2, n + 1):
i... | # coding: utf-8
# Your code here!
n, a, b, k = list(map(int, input().split()))
MOD = 998244353
inv = [0] * ( n + 1)
inv[1] = 1
for i in range(2, n + 1):
inv[i] = (-(MOD // i) * inv[MOD % i]) % MOD
nCr = [0] * ( n + 1)
nCr[0] = 1
for i in range(1, n+1):
nCr[i] = (nCr[i-1] * (n - i + 1) * inv[i])... | p03332 |
N,A,B,K=list(map(int,input().split()))
P=998244353
def egcd(a, b):
(x, lastx) = (0, 1)
(y, lasty) = (1, 0)
while b != 0:
q = a // b
(a, b) = (b, a % b)
(x, lastx) = (lastx - q * x, x)
(y, lasty) = (lasty - q * y, y)
return (lastx, lasty, a)
def inv(x):
ret... | N,A,B,K=list(map(int,input().split()))
P=998244353
def egcd(a, b):
(x, lastx) = (0, 1)
(y, lasty) = (1, 0)
while b != 0:
q = a // b
(a, b) = (b, a % b)
(x, lastx) = (lastx - q * x, x)
(y, lasty) = (lasty - q * y, y)
return (lastx, lasty, a)
def inv(x):
ret... | p03332 |
P=998244353
MAX_N=3*10**5+1
def egcd(a, b):
(x, lastx) = (0, 1)
(y, lasty) = (1, 0)
while b != 0:
q = a // b
(a, b) = (b, a % b)
(x, lastx) = (lastx - q * x, x)
(y, lasty) = (lasty - q * y, y)
return (lastx, lasty, a)
def inv(x):
return egcd(x,P)[0]
Fact=... | N,A,B,K=list(map(int,input().split()))
P=998244353
def egcd(a, b):
(x, lastx) = (0, 1)
(y, lasty) = (1, 0)
while b != 0:
q = a // b
(a, b) = (b, a % b)
(x, lastx) = (lastx - q * x, x)
(y, lasty) = (lasty - q * y, y)
return (lastx, lasty, a)
def inv(x):
ret... | p03332 |
import sys
input = sys.stdin.buffer.readline
import copy
def main():
N,A,B,K = list(map(int,input().split()))
MOD = 998244353
fac = [0 for _ in range(N+1)]
fac[0],fac[1] = 1,1
inv = copy.deepcopy(fac)
invfac = copy.deepcopy(fac)
for i in range(2,N+1):
fac[i]... | import sys
input = sys.stdin.buffer.readline
import copy
def main():
N,A,B,K = list(map(int,input().split()))
MOD = 998244353
fac = [0 for _ in range(N+1)]
fac[0],fac[1] = 1,1
invfac = copy.deepcopy(fac)
for i in range(2,N+1):
fac[i] = (fac[i-1]*i)%MOD
... | p03332 |
from math import factorial as fa
f=lambda a,b:fa(a)//(fa(a-b)*fa(b))
n,a,b,k=list(map(int,input().split()))
v=998244353
l=[]
for i in range(n+1):
if not (k-a*i)%b:
j=(k-a*i)//b
if 0<=j<=n+1:
l.extend([(i,j)])
s=0
for (i,j) in l:
s+=(f(n,i)*f(n,j))%v
print(s) | n,a,b,k=list(map(int,input().split()))
mod=998244353
s=0
fac=[1]*(n+1)
rev=[1]*(n+1)
for i in range(1,n+1):
fac[i]=i*fac[i-1]%mod
rev[i]=pow(fac[i],mod-2,mod)
f=lambda a,b:(fac[a]*rev[a-b]*rev[b])%mod
for i in range(n+1):
j,r=divmod((k-a*i),b)
if r==0 and 0<=j<=n:
s+=(f(n,i)*f(n,j))%mod
... | p03332 |
def comb(n,k,p):
from math import factorial
if n<0 or k<0 or n<k: return 0
if n==0 or k==0: return 1
a,b,c = factorial(n)%p,factorial(k)%p,factorial(n-k)%p
return (a*pf(b,p-2,p)*pf(c,p-2,p))%p
def pf(a,b,p):
if b==0: return 1
if b%2==0:
d = pf(a,b//2,p)
return d**2%p
if b%2==1: return (a*pf(a,b-1... | n,a,b,k = (int(i) for i in input().split())
mod,ans = 998244353,0
fn,fk = [1]*n,[1]*n
for i in range(n-1): fn[i+1] = (fn[i]*(i+2))%mod
def power(n,k):
if k==1: return n
elif k%2==0: return power((n**2)%mod,k//2)
else: return (n*power(n,k-1))%mod
def comb(n,k):
if n==0 or k==0 or n==k: return 1
else: retu... | p03332 |
M=998244353;n,A,B,K=list(map(int,input().split()));F=[1];a=0
for i in range(n):F+=[F[-1]*(n-i)*pow(i+1,M-2,M)%M]
for i in range(n+1):
r=K-i*A;q=r//B
if(r%B==0)&(0<=q<=n):a+=F[i]*F[q]
print((a%M)) | M=998244353;n,A,B,K=list(map(int,input().split()));F=[1];a=0
for i in range(n):F+=[F[-1]*(n-i)*pow(i+1,M-2,M)%M]
for i in range(n+1):
r=K-i*A
if r%B==0and 0<=r//B<=n:a+=F[i]*F[r//B]
print((a%M)) | p03332 |
N,A,B,K = list(map(int,input().split()))
if A<B: A,B = B,A
MOD = 998244353
def mul(a,b):
return (a*b) % MOD
def pow(a,n): # a^n
ret = 1
mag = a
while n > 0:
if n & 1:
ret = mul(ret, mag)
mag = mul(mag, mag)
n >>= 1
return ret
def inv(a):
r... | N,A,B,K = list(map(int,input().split()))
if A<B: A,B = B,A
MOD = 998244353
def mul(a,b):
return (a*b) % MOD
def pow(a,n): # a^n
ret = 1
mag = a
while n > 0:
if n & 1:
ret = mul(ret, mag)
mag = mul(mag, mag)
n >>= 1
return ret
def inv(a):
r... | p03332 |
N,A,B,K = list(map(int,input().split()))
MOD = 998244353
fac = [1,1] + [0]*N
finv = [1,1] + [0]*N
inv = [0,1] + [0]*N
for i in range(2,N+2):
fac[i] = fac[i-1] * i % MOD
inv[i] = -inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i-1] * inv[i] % MOD
def ncr(n,r):
if n < r: return 0
if n < 0... | N,A,B,K = list(map(int,input().split()))
MOD = 998244353
if (A+B)*N < K:
print((0))
exit()
M = N+5
fac = [1,1] + [0]*M
finv = [1,1] + [0]*M
inv = [0,1] + [0]*M
for i in range(2,M+2):
fac[i] = fac[i-1] * i % MOD
inv[i] = -inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i-1] * inv[i] % MO... | p03332 |
N,A,B,K = list(map(int,input().split()))
MOD = 998244353
if (A+B)*N < K:
print((0))
exit()
M = N+5
fac = [1,1] + [0]*M
finv = [1,1] + [0]*M
inv = [0,1] + [0]*M
for i in range(2,M+2):
fac[i] = fac[i-1] * i % MOD
inv[i] = -inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i-1] * inv[i] % MO... | N,A,B,K = list(map(int,input().split()))
MOD = 998244353
MAXN = N+5
fac = [1,1] + [0]*MAXN
finv = [1,1] + [0]*MAXN
inv = [0,1] + [0]*MAXN
for i in range(2,MAXN+2):
fac[i] = fac[i-1] * i % MOD
inv[i] = -inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i-1] * inv[i] % MOD
def comb(n,r):
if n < ... | p03332 |
N, A, B, K = [int(_) for _ in input().split()]
def gcd(a, b):
if a < b:
a, b = b, a
while b:
a, b = b, a % b
return a
L = 300000+1
M = 998244353
Fm = {}
inverseFm = {}
x = 1
for i in range(L):
Fm[i] = x
x = x * (i + 1) % M
def inverseFm(x, cache={}):
if x ... | N, A, B, K = [int(_) for _ in input().split()]
L = 300000+1
M = 998244353
Fm = {}
inverseFm = {}
x = 1
for i in range(L):
Fm[i] = x
x = x * (i + 1) % M
def inverseFm(x, cache={}):
if x in cache:
return cache[x]
result = pow(Fm[x], M - 2, M)
cache[x] = result
return re... | p03332 |
import sys
def input():
return sys.stdin.readline().strip()
N, A, B, K = list(map(int, input().split()))
mod = 998244353
fact_list = [1]
for i in range(1, N + 1):
fact_list.append((fact_list[-1]*i) % mod)
def pow(x, y, mod=1000000007):
pow_list = [x]
i = 1
while 2**i <= y:
a = pow_list[-1]**2... |
import sys
def input():
return sys.stdin.readline().strip()
N, A, B, K = list(map(int, input().split()))
mod = 998244353
fact_list = [1]
for i in range(1, N + 1):
fact_list.append((fact_list[-1]*i) % mod)
def pow(x, y, mod=1000000007):
pow_list = [x]
i = 1
while 2**i <= y:
a = pow_list[-1]*... | p03332 |
# coding: utf-8
# Your code here!
import array
SIZE=300000; MOD= 998244353
#inv = array.array('q',[0]*(SIZE+1))# inv[j] = j^{-1} mod M
#fac = array.array('q',[0]*(SIZE+1))# inv[j] = j! mod M
#finv = array.array('q',[0]*(SIZE+1))# inv[j] = (j!)^{-1} mod M
inv = [0]*(SIZE+1)# inv[j] = j^{-1} mod M
fac = [0]*(SI... | SIZE=300000; MOD=998244353 #ここを変更する
inv = [0]*(SIZE+1)# inv[j] = j^{-1} mod MOD
fac = [0]*(SIZE+1)# inv[j] = j! mod MOD
finv = [0]*(SIZE+1)# inv[j] = (j!)^{-1} mod MOD
inv[1] = 1
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE+1):
inv[i] = MOD -(MOD//i)*inv[MOD%i]%MOD
fac[i] = fac[i-1... | p03332 |
n,a,b,k=[int(i) for i in input().split()]
c=a+b
mod=998244353
ans=0
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range(2,300003):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) ... | n,a,b,k=[int(i) for i in input().split()]
c=a+b
mod=998244353
ans=0
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range(2,300003):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) ... | p03332 |
from copy import deepcopy
dx=[0,0,1,-1]
dy=[1,-1,0,0]
def dfs(y,x,cnt):
Ice_cp[y][x]=0
cnt+=1
for i in range(4):
mx=x+dx[i]
my=y+dy[i]
if 0<=mx<m and 0<=my<n and Ice_cp[my][mx]==1:
return dfs(my,mx,cnt)
return cnt
while True:
m=eval(input())
... | dx=[0,0,1,-1]
dy=[1,-1,0,0]
def dfs(y,x,cnt):
global maxInt
maxInt=max(maxInt,cnt)
Ice[y][x]=0
for i in range(4):
mx=x+dx[i]
my=y+dy[i]
if mx<0 or m<=mx or my<0 or n<=my:
continue
if Ice[my][mx]==1:
dfs(my,mx,cnt+1)
Ice[m... | p00458 |
def b(M,x,y,n=1):
M[x][y]='0';t=[]
if'1'==M[x-1][y]:t+=[b(M,x-1,y,n+1)]
if'1'==M[x][y-1]:t+=[b(M,x,y-1,n+1)]
if'1'==M[x+1][y]:t+=[b(M,x+1,y,n+1)]
if'1'==M[x][y+1]:t+=[b(M,x,y+1,n+1)]
M[x][y]='1'
return max([n]+t)
for e in iter(input,'0'):
n,m=int(e),int(eval(input()))
P=[['0']*(n+2)for _ in[0]*(m+2)]... | def b(M,x,y,n=1):
M[x][y]=0;t=[]
if M[x-1][y]:t+=[b(M,x-1,y,n+1)]
if M[x][y-1]:t+=[b(M,x,y-1,n+1)]
if M[x+1][y]:t+=[b(M,x+1,y,n+1)]
if M[x][y+1]:t+=[b(M,x,y+1,n+1)]
M[x][y]=1
return max([n]+t)
for e in iter(input,'0'):
n,m=int(e),int(eval(input()))
P=[[0]*(n+2)for _ in[0]*(m+2)]
for i in range(m):P... | p00458 |
def s():
def b(M,x,y,n=0):
if M[x][y]==0:return n
M[x][y]=0
a=max(b(M,x-1,y,n+1),b(M,x,y-1,n+1),b(M,x+1,y,n+1),b(M,x,y+1,n+1))
M[x][y]=1
return a
for e in iter(input,'0'):
n,m=int(e),int(eval(input()))
P=[[0]*(n+2)for _ in[0]*(m+2)]
for i in range(m):P[i+1][1:-1]=list(map(int,input().split()... | def s():
def b(M,x,y,n):
M[x][y]=0;a=n
if M[x-1][y]:a=max(a,b(M,x-1,y,n+1))
if M[x][y-1]:a=max(a,b(M,x,y-1,n+1))
if M[x+1][y]:a=max(a,b(M,x+1,y,n+1))
if M[x][y+1]:a=max(a,b(M,x,y+1,n+1))
M[x][y]=1
return a
for e in iter(input,'0'):
n,m=int(e),int(eval(input()))
P=[[0]*(n+2)for _ in[0]*(m+... | p00458 |
def s():
def b(M,x,y,n=1):
M[x][y]=0;a=n
if M[x-1][y]:a=max(a,b(M,x-1,y,n+1))
if M[x][y-1]:a=max(a,b(M,x,y-1,n+1))
if M[x+1][y]:a=max(a,b(M,x+1,y,n+1))
if M[x][y+1]:a=max(a,b(M,x,y+1,n+1))
M[x][y]=1
return a
for e in iter(input,'0'):
n,m=int(e),int(eval(input()))
P=[[0]*(n+2)for _ in[0]*(... | def s():
def b(M,x,y,n=1):
M[x][y]=0;a=n
if M[x-1][y]:
t=b(M,x-1,y,n+1)
if a<t:a=t
if M[x][y-1]:
t=b(M,x,y-1,n+1)
if a<t:a=t
if M[x+1][y]:
t=b(M,x+1,y,n+1)
if a<t:a=t
if M[x][y+1]:
t=b(M,x,y+1,n+1)
if a<t:a=t
M[x][y]=1
return a
for e in iter(input,'0'):
n,m=in... | p00458 |
def s():
def b(M,x,y,n=1):
M[x][y]=0;a=n
for p,q in[(-1,0),(0,-1),(1,0),(0,1)]:
if M[x+p][y+q]:
t=b(M,x+p,y+q,n+1)
if a<t:a=t
M[x][y]=1
return a
for e in iter(input,'0'):
n,m=int(e),int(eval(input()))
P=[[0]*(n+2)for _ in[0]*(m+2)]
for i in range(m):P[i+1][1:-1]=list(map(int,input... | def s():
def b(M,x,y,n=1):
M[x][y]=0;a=n
if M[x-1][y]:
t=b(M,x-1,y,n+1)
if a<t:a=t
if M[x][y-1]:
t=b(M,x,y-1,n+1)
if a<t:a=t
if M[x+1][y]:
t=b(M,x+1,y,n+1)
if a<t:a=t
if M[x][y+1]:
t=b(M,x,y+1,n+1)
if a<t:a=t
M[x][y]=1
return a
for e in iter(input,'0'):
n,m=in... | p00458 |
def solve():
while True:
m, n = int(eval(input())), int(eval(input()))
if not m:
break
ices = [[0] + list(map(int,input().split())) + [0] for _ in range(n)]
ices.insert(0, [0] * (m + 2),)
ices.append([0] * (m + 2))
score = [[0] * (m + 2) for _ in range(n + 2)]
for x i... | def solve():
while True:
m, n = int(eval(input())), int(eval(input()))
if not m:
break
ices = [[0] + list(map(int,input().split())) + [0] for _ in range(n)]
ices.insert(0, [0] * (m + 2),)
ices.append([0] * (m + 2))
score = [[0] * (m + 2) for _ in range(n + 2)]
for x i... | p00458 |
def solve():
while True:
m, n = int(eval(input())), int(eval(input()))
if not m:
break
ices = [[0] + list(map(int,input().split())) + [0] for _ in range(n)]
ices.insert(0, [0] * (m + 2),)
ices.append([0] * (m + 2))
score = [[0] * (m + 2) for _ in range(n + 2)]
for x i... | def solve():
while True:
m, n = int(eval(input())), int(eval(input()))
if not m:
break
ices = [[0] + list(map(int,input().split())) + [0] for _ in range(n)]
ices.insert(0, [0] * (m + 2),)
ices.append([0] * (m + 2))
score = [[0] * (m + 2) for _ in range(n + 2)]
for x i... | p00458 |
from copy import deepcopy
from array import array
while True:
m = int(input())
n = int(input())
if m == 0 and n == 0:
break
begin = [array('b', [False] * m) for y in range(n)]
for y in range(n):
line = list(map(int, input().split(' ')))
for x in range(m):
... | from copy import deepcopy
while True:
m = int(input())
n = int(input())
if m == 0 and n == 0:
break
field = [[False] * m for y in range(n)]
for y in range(n):
line = list(map(int, input().split(' ')))
for x in range(m):
if line[x] == 1:
... | p00458 |
from collections import deque
while 1:
c = eval(input())
r = eval(input())
if c == 0: break
l = [list(map(int, input().split())) for i in range(r)]
ans = 0
d = [(-1,0),(0,-1),(1,0),(0,1)]
for i in range(c):
for j in range(r):
q = deque()
a = [[0]*c ... | while 1:
c = eval(input())
r = eval(input())
if c == 0: break
l = [list(map(int, input().split())) for i in range(r)]
ans = 0
d = [(-1,0),(0,-1),(1,0),(0,1)]
def dfs(j, i, cnt):
global ans
ans = max(ans, cnt)
for x, y in d:
dx = x + i; d... | p00458 |
def check(p):
for i in range(1, 9):
if p[i] != p[0]:
return False
for i in range(10, 12):
if p[i] != p[9]:
return False
for i in range(13, 15):
if p[i] != p[12]:
return False
for i in range(16, 18):
if p[i] != p[15]:
... |
def check(p):
for i in range(1, 9):
if p[i] != p[0]:
return False
for i in range(10, 12):
if p[i] != p[9]:
return False
for i in range(13, 15):
if p[i] != p[12]:
return False
for i in range(16, 18):
if p[i] != p[15]:
... | p00295 |
def rotate(p, comm):
if comm==0:
p[0],p[1],p[2], p[27],p[28],p[29] = p[27],p[28],p[29], p[0],p[1],p[2]
p[14], p[15] = p[15], p[14]
p[18], p[20] = p[20], p[18]
elif comm==1:
p[2],p[5],p[8], p[21],p[24],p[27] = p[21],p[24],p[27], p[2],p[5],p[8]
p[11], p[18] = p[18], ... | def rotate(p, comm):
if comm==0:
p[0],p[1],p[2], p[27],p[28],p[29] = p[27],p[28],p[29], p[0],p[1],p[2]
p[14], p[15] = p[15], p[14]
p[18], p[20] = p[20], p[18]
elif comm==1:
p[2],p[5],p[8], p[21],p[24],p[27] = p[21],p[24],p[27], p[2],p[5],p[8]
p[11], p[18] = p[18], ... | p00295 |
def rotate(p, comm):
if comm==0:
p[0],p[1],p[2], p[27],p[28],p[29] = p[27],p[28],p[29], p[0],p[1],p[2]
p[14], p[15] = p[15], p[14]
p[18], p[20] = p[20], p[18]
elif comm==1:
p[2],p[5],p[8], p[21],p[24],p[27] = p[21],p[24],p[27], p[2],p[5],p[8]
p[11], p[18] = p[18], ... | def rotate(p, comm):
if comm==0:
p[0],p[1],p[2], p[27],p[28],p[29] = p[27],p[28],p[29], p[0],p[1],p[2]
p[14], p[15] = p[15], p[14]
p[18], p[20] = p[20], p[18]
elif comm==1:
p[2],p[5],p[8], p[21],p[24],p[27] = p[21],p[24],p[27], p[2],p[5],p[8]
p[11], p[18] = p[18], ... | p00295 |
def op1 (p) :
q = [i for i in p]
q[12] = p[17]
q[17] = p[12]
q[6] = p[21]
q[7] = p[22]
q[8] = p[23]
q[21] = p[6]
q[22] = p[7]
q[23] = p[8]
q[9] = p[11]
q[11] = p[9]
return q
def op2 (p) :
q = [i for i in p]
q[14] = p[15]
q[15] = p[14]
q[... | def op1 (p) :
return (
p[ 0],p[ 1],p[ 2],p[ 3],p[ 4],p[ 5],p[21],p[22],p[23],p[11],p[10],p[9],p[17],p[13],p[14],
p[15],p[16],p[12],p[18],p[19],p[20],p[ 6],p[ 7],p[ 8],p[24],p[25],p[26],p[27],p[28],p[29]
)
def op2 (p) :
return (
p[27],p[28],p[29],p[ 3],p[ 4],p[ 5],p[ 6],p[ 7],p... | p00295 |
def op1 (p) :
return (
p[ 0],p[ 1],p[ 2],p[ 3],p[ 4],p[ 5],p[21],p[22],p[23],p[11],p[10],p[9],p[17],p[13],p[14],
p[15],p[16],p[12],p[18],p[19],p[20],p[ 6],p[ 7],p[ 8],p[24],p[25],p[26],p[27],p[28],p[29]
)
def op2 (p) :
return (
p[27],p[28],p[29],p[ 3],p[ 4],p[ 5],p[ 6],p[ 7],p... | def op1 (p) :
return (
p[ 0],p[ 1],p[ 2],p[ 3],p[ 4],p[ 5],p[21],p[22],p[23],p[11],p[10],p[ 9],p[17],p[13],p[14],
p[15],p[16],p[12],p[18],p[19],p[20],p[ 6],p[ 7],p[ 8],p[24],p[25],p[26],p[27],p[28],p[29]
)
def op2 (p) :
return (
p[27],p[28],p[29],p[ 3],p[ 4],p[ 5],p[ 6],p[ 7... | p00295 |
while 1:
n=int(eval(input()))
if n==0:break
a=0
for i in range(1,n//2):a+=(n+2*i-1)//(2*i)-1
print((8*(2*n-1+a))) | while 1:
n=int(eval(input()))
if n==0:break
a=0;i=1;b=n//2
while i*i<b:a+=((b-1)//i+1)-i-1;i+=1
a=(a+b-1)*2+i
print((8*(a+n))) | p00612 |
x, t = (int(x) for x in input().split())
if x > t:
ans = x-t
else:
ans = 0
print(ans) | x, t = list(map(int, input().split()))
f = lambda x: x if x > 0 else 0
print((f(x-t))) | p03609 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
X,t = MI()
print((max(0,X-t)))
| p03609 |
a,b=list(map(int,input().split()));print((max(0,a-b))) | x,t=list(map(int,input().split()))
print((max(0,x-t))) | p03609 |
import sys
x, t = (int(i) for i in sys.stdin.readline().split())
print((x - t if x > t else 0)) | import sys
def main():
X, t = list(map(int, sys.stdin.readline().split()))
ans = max(0, X - t)
print(ans)
if __name__ == '__main__':
main() | p03609 |
a,b = list(map(int,input().split()))
print((max(a-b,0))) | def main():
x,t = list(map(int,input().split()))
print((max(0,x-t)))
if __name__ == '__main__':
main()
| p03609 |
X, t = list(map(int, input().split()))
print((max(X - t, 0))) | X, t = list(map(int, input().split()))
print((max(0, X - t))) | p03609 |
x,t=list(map(int, input().split()))
if x-t>0:
print((int(x-t)))
else:
print((int(0))) | x,t=list(map(int, input().split()))
A=x-t
if A>=0:
print(A)
else:
print((0)) | p03609 |
X, t = list(map(int, input().split()))
print((max(X - t, 0))) | X, t = list(map(int, input().split()))
if X > t:
print((X -t))
else:
print((0)) | p03609 |
x,t=list(map(int,input().split()))
print(("0" if x-t<0 else x-t)) | print((max(eval(input().replace(" ","-")),0))) | p03609 |
print((max(0,eval(input().replace(' ','-'))))) | print((max(eval(input().replace(*' -')),0))) | p03609 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.