s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time int64 0 100 | memory stringlengths 4 6 | code_size int64 15 14.7k | code stringlengths 15 14.7k | problem_id stringlengths 6 6 | problem_description stringlengths 358 9.83k | input stringlengths 2 4.87k | output stringclasses 807
values | __index_level_0__ int64 1.1k 1.22M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
s698138430 | p04013 | u844789719 | 1543548852 | Python | Python (3.4.3) | py | Accepted | 26 | 3188 | 759 | 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 = dp_plus.co... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,871 |
s114306591 | p04013 | u844789719 | 1543546949 | Python | Python (3.4.3) | py | Accepted | 50 | 3188 | 781 | 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_minus = [1] + ... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,872 |
s470753507 | p04013 | u844789719 | 1543545280 | Python | Python (3.4.3) | py | Accepted | 69 | 3188 | 299 | 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 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,873 |
s999658092 | p04013 | u844789719 | 1543544267 | Python | Python (3.4.3) | py | Accepted | 79 | 3188 | 257 | 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)
| p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,874 |
s331561126 | p04013 | u140251125 | 1543514602 | Python | Python (3.4.3) | py | Accepted | 44 | 3572 | 590 | import collections
# input
n, a = 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 s, c in S.items():
... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,875 |
s455936488 | p04013 | u140251125 | 1543422096 | Python | Python (3.4.3) | py | Accepted | 47 | 3572 | 599 | import collections
# input
n, a = 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()
for s, c in sums.item... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,876 |
s617179497 | p04013 | u233152254 | 1539490241 | Python | Python (3.4.3) | py | Accepted | 39 | 4596 | 386 | N, A = [int(x) for x in input().split()]
X = [int(x) - A for x in input().split()]
S = [[None] * N for x in range(3000)]
def search(value, pos):
if pos == N: return 0 if value else 1
if S[value + A][pos] is not None: return S[value + A][pos]
S[value + A][pos] = search(value, pos + 1) + search(value + X[pos... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,877 |
s112831557 | p04013 | u883048396 | 1539304580 | Python | Python (3.4.3) | py | Accepted | 19 | 3188 | 1,084 | #正負で分割
#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 - iLenPlus - iLenMinus
iCZ... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,878 |
s038920162 | p04013 | u883048396 | 1539297754 | Python | Python (3.4.3) | py | Accepted | 22 | 3316 | 1,009 |
#正負で分割
#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 - iLenPlus - iLe... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,879 |
s759057518 | p04013 | u883048396 | 1539295940 | Python | Python (3.4.3) | py | Accepted | 21 | 3188 | 996 | #正負で分割
#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 - iLenPlus - iLen... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,880 |
s115983268 | p04013 | u883048396 | 1539276872 | Python | Python (3.4.3) | py | Accepted | 25 | 3444 | 1,363 | 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=1..N){nCk... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,881 |
s672642393 | p04013 | u883048396 | 1539272485 | Python | Python (3.4.3) | py | Accepted | 30 | 3572 | 1,144 |
#人のすなる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 - iLenPlus - iLenM... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,882 |
s051878434 | p04013 | u883048396 | 1539271545 | Python | Python (3.4.3) | py | Accepted | 31 | 3444 | 1,223 | #分割してみた。
#
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=1..N){nCk} = 2^n -1
iRet = 0
iRet += i... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,883 |
s201259687 | p04013 | u883048396 | 1539271371 | Python | Python (3.4.3) | py | Accepted | 31 | 3444 | 1,517 | #分割してみた。これで通るかな？
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 = iN - iR
... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,884 |
s584732963 | p04013 | u608088992 | 1537564738 | Python | Python (3.4.3) | py | Accepted | 42 | 5232 | 552 | N, A = map(int, input().split())
X = [int(_) for _ in input().split()]
for i in range(N): #総和のみを考えるために全体からAを引く
X[i] -= A
def DP(i, n, memo = {}): #i番目までのカードを使って総和をnにする組合せの数
if i == 1:
return (1 if X[0] == n else 0)
try:
return memo[(i, n)]
except KeyError:
ans = DP(i-1, n, memo)... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,885 |
s638313761 | p04013 | u761989513 | 1536869142 | Python | Python (3.4.3) | py | Accepted | 44 | 3572 | 284 | import collections
n, a = map(int, input().split())
X = [int(i) - a for i in input().split()]
ans = 0
sums = collections.Counter([0, X[0]])
for i in X[1:]:
sums2 = collections.Counter()
for s, c in sums.items():
sums2[s + i] += c
sums += sums2
print(sums[0] - 1)
| p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,886 |
s944742145 | p04013 | u466105944 | 1536689331 | Python | Python (3.4.3) | py | Accepted | 44 | 3572 | 293 | from collections import Counter
n,a = map(int,input().split())
input_list = [int(num)-a for num in input().split()]
ans = Counter([0,input_list[0]])
for i in input_list[1:]:
temp = Counter()
for key,value in ans.items():
temp[i+key] += value
ans += temp
print (ans[0]-1) | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,887 |
s882374775 | p04013 | u787562674 | 1536534744 | Python | Python (3.4.3) | py | Accepted | 44 | 3572 | 300 | from collections import Counter
N, A = map(int, input().split())
input_list = [int(i) - A for i in input().split()]
ans = Counter([0, input_list[0]])
for i in input_list[1:]:
temp = Counter()
for key, value in ans.items():
temp[i + key] += value
ans += temp
print(ans[0] - 1)
| p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,888 |
s639120981 | p04013 | u419686324 | 1534839631 | Python | Python (3.4.3) | py | Accepted | 46 | 3572 | 258 | N, A = 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 total.items():
mix[i + x] += cnt
total += mix
print(total[0] - 1) | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,889 |
s646360707 | p04013 | u415905784 | 1534824700 | Python | Python (3.4.3) | py | Accepted | 44 | 3572 | 225 | from collections import Counter
N, A = map(int, input().split())
X = [int(x) - A for x in input().split()]
C = Counter([0])
for x in X:
tmp = Counter()
for i, c in C.items():
tmp[i + x] += c
C += tmp
print(C[0] - 1) | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,890 |
s568580298 | p04013 | u333945892 | 1534522925 | Python | Python (3.4.3) | py | Accepted | 37 | 4588 | 1,054 | from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_s(): return list(input().split())
N,A = inpl()
xx = inpl()
pos_numbers = []
neg... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,891 |
s956387878 | p04013 | u631277801 | 1534501920 | Python | Python (3.4.3) | py | Accepted | 43 | 3564 | 288 | from collections import Counter
n,a = 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 cnt.items():
tmp[k+li] += v
cnt += tmp
print(cnt[0]-1) | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,892 |
s232455915 | p04013 | u562935282 | 1533699283 | Python | Python (3.4.3) | py | Accepted | 37 | 4980 | 739 | def na(): return map(int, input().split())
n, a = na()
x = list(na())
xa = list(map(lambda f: f-a, x))
'''
dp[i][点数] = パターン数
i番目まで使用したときの点数になるパターン数
'''
dp = [dict() for _ in range(n)]
if xa[0] == 0:
dp[0][0] = 2
else:
dp[0][0] = 1
dp[0][xa[0]] = 1
for i in range(1, n):
#xa[i]を採用する / 採用しないで2つに分岐
#すべて... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,893 |
s706799460 | p04013 | u826263061 | 1533501198 | Python | Python (3.4.3) | py | Accepted | 36 | 5236 | 567 | # -*- 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[(i,j)]
else:
... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,894 |
s808865470 | p04013 | u631277801 | 1533343335 | Python | Python (3.4.3) | py | Accepted | 44 | 3564 | 292 | from collections import Counter
N,A = 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 cnt.items():
temp[k + x] += v
cnt += temp
print(cnt[0]-1)
| p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,895 |
s956072730 | p04013 | u631277801 | 1532170853 | Python | Python (3.4.3) | py | Accepted | 37 | 3572 | 279 | from collections import Counter
N,A = map(int,input().split())
X = list(map(int, input().split()))
X = [X[i] - A for i in range(N)]
sums = Counter([0, X[0]])
for x in X[1:]:
c = Counter()
for k,v in sums.items():
c[x+k] = v
sums += c
print(sums[0]-1) | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,896 |
s680765229 | p04013 | u631277801 | 1531892271 | Python | Python (3.4.3) | py | Accepted | 34 | 3572 | 348 | from collections import Counter
N, A = map(int, input().split())
X = list(map(int, input().split()))
for i in range(N):
X[i] -= A
sums = Counter([0,X[0]])
for i in range(1,N):
ith_x = X[i]
ith_hash = {}
for key, value in sums.items():
ith_hash[ith_x + key] = value
sums += it... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,897 |
s859525256 | p04013 | u631277801 | 1531784423 | Python | Python (3.4.3) | py | Accepted | 38 | 3572 | 290 | import collections
N,A = map(int, input().split())
X = list(map(int,input().split()))
for i in range(N):
X[i] -= A
sums = collections.Counter([0,X[0]])
for i in X[1:]:
c = collections.Counter()
for p,q in sums.items():
c[i+p] = q
sums += c
print(sums[0]-1)
| p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,898 |
s677920470 | p04013 | u997521090 | 1528933850 | Python | Python (2.7.6) | py | Accepted | 80 | 3588 | 421 | #!/usr/bin/env python
N, A = map(int, raw_input().split())
x = map(int, raw_input().split())
ADD = 10000
DP = [0 for i in range(N * 50 + 1 + 2 * ADD)]
DP[ADD] = 1
for i in range(N):
if x[i] < A:
for j in range(-N * 60, N * 60):
DP[j + ADD] += DP[j + (A - x[i]) + ADD]
else:
for j ... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,899 |
s565424744 | p04013 | u112523623 | 1527790416 | Python | Python (3.4.3) | py | Accepted | 37 | 5604 | 789 | def num_ways_for_sum(target, elems, start_idx, end_idx, cache):
if start_idx > end_idx:
if target == 0:
return 1
else:
return 0
cur_ways = 0
cache_key = (target, start_idx, end_idx)
if cache_key in cache:
cur_ways = cache[cache_key]
else:
cur_... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,900 |
s195029696 | p04013 | u777923818 | 1526011715 | Python | Python (3.4.3) | py | Accepted | 94 | 3064 | 296 | # -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
N, A = inpl()
X = [int(x) - A for x in input().split()]
DP = [0]*(5001)
DP[2500] = 1
for x in X:
DP2 = [0]*(5001)
for i in range(50, 4950):
DP2[i+x] += DP[i] + DP[i+x]
DP = DP2
print(DP[2500] - 1) | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,901 |
s936809272 | p04013 | u257974487 | 1524412646 | Python | Python (3.4.3) | py | Accepted | 43 | 3572 | 298 | import collections
n, a = map(int,input().split())
num = list(map(int,input().split()))
for i in range(n):
num[i] -= a
sums = collections.Counter([0, num[0]])
for i in num[1:]:
c = collections.Counter()
for p, q in sums.items():
c[i + p] += q
sums += c
print(sums[0] - 1) | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,902 |
s615331409 | p04013 | u218843509 | 1524179823 | Python | Python (3.4.3) | py | Accepted | 44 | 3564 | 277 | from collections import Counter
N, A = list(map(int, input().split()))
x = [int(i) - A for i in input().split()]
sums = Counter([0])
for i in x:
sums2 = Counter()
for sm, cnt in sums.items():
sums2[sm + i] += cnt
sums += sums2
print(sums[0] - 1) | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,903 |
s383036899 | p04013 | u761320129 | 1497286096 | Python | Python (2.7.6) | py | Accepted | 75 | 5624 | 759 | from collections import defaultdict
N,A = map(int, raw_input().split())
cards = map(int, raw_input().split())
class CardSet:
def __init__(self, n):
self.cards = []
self.combis = [defaultdict(lambda:0) for i in range(n+1)]
def add_card(self, card):
self.cards.append(card)
for n in range(len(self.c... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,904 |
s812740278 | p04013 | u879309973 | 1495629337 | Python | Python (2.7.6) | py | Accepted | 28 | 4800 | 284 | N, A = map(int, raw_input().split())
x = [v - A for v in map(int, raw_input().split())]
dp = {}
def dfs(i, W):
if i < 0:
return int(W == 0)
if (i, W) in dp:
return dp[i, W]
dp[i, W] = dfs(i-1, W) + dfs(i-1, W-x[i])
return dp[i, W]
print dfs(N-1, 0) - 1 | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,905 |
s578784286 | p04013 | u333917945 | 1480886919 | Python | Python (3.4.3) | py | Accepted | 48 | 3700 | 309 | import collections
n, a = [int(i) for i in input().split()]
x = [int(i) - a for i in input().split()]
ans = 0
sums = collections.Counter([0, x[0]])
for i in x[1:]:
temp = collections.Counter()
for s, c in sums.items():
temp[s + i] += c
sums += temp
#print(sums)
print(sums[0] - 1)
| p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,906 |
s052699888 | p04013 | u117095520 | 1477601215 | Python | Python (2.7.6) | py | Accepted | 28 | 2820 | 312 | N, A = map(int, raw_input().split())
x = map(lambda x: int(x) - A, raw_input().split())
tmp = {}
for xi in x:
new_tmp = {}
for k, v in tmp.items():
new_tmp[k + xi] = v
new_tmp[xi] = new_tmp.get(xi, 0) + 1
for k, v in new_tmp.items():
tmp[k] = tmp.get(k, 0) + v
print tmp.get(0, 0) | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,907 |
s359969036 | p04013 | u830390742 | 1472751524 | Python | Python (2.7.6) | py | Accepted | 93 | 8256 | 397 | N, A = map(int, raw_input().split())
a = sorted(map(lambda x:int(x)-A, raw_input().split()))
mem = {}
def rec(p, acm):
if (p, acm) in mem:
return mem[(p, acm)]
if p >= N:
return 0
if a[p] > 0 and acm > 0:
return 0
mem[(p, acm)] = rec(p+1, acm+a[p]) + rec(p+1, acm)
if acm+a[p... | p04013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,908 |
s369657848 | p04014 | u644972721 | 1599447554 | Python | PyPy3 (7.3.0) | py | Accepted | 92 | 73160 | 572 | import math
n = int(input())
s = int(input())
ans = -1
if n > s:
sqrt_n = math.ceil(math.sqrt(n))
for b in range(2, sqrt_n + 1):
m = n
f = 0
while m >= b:
f += (m % b)
m //= b
f += m
if f == s:
ans = b
break
b = sqrt_n
... | p04014 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>For integers <var>b (b \geq 2)</var> and <var>n (n \geq 1)</var>, let the function <var>f(b,n)</var> be defined as follows:</p>
<ul>
<li><var>f(b,n) = n</var>, when <var>n < b</var></li>
<li><var>f(b... | 87654
30
| 10
| 1,199,909 |
s827907930 | p04014 | u107639613 | 1599363672 | Python | PyPy3 (7.3.0) | py | Accepted | 88 | 73548 | 1,142 | import sys
def input(): return sys.stdin.readline().strip()
def main():
"""
nのオーダーを見てb < √nまで半分全探索しようという気持ちになるのか・・・？
そうだとしても√n < bの場合の考察もやや技巧的に思われるが、
とりあえず√nで切る方策はある種の定石として覚えておくことにする。
あとは解説pdf参照。
"""
n = int(input())
s = int(input())
if n < s:
print(-1)
return
if... | p04014 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>For integers <var>b (b \geq 2)</var> and <var>n (n \geq 1)</var>, let the function <var>f(b,n)</var> be defined as follows:</p>
<ul>
<li><var>f(b,n) = n</var>, when <var>n < b</var></li>
<li><var>f(b... | 87654
30
| 10
| 1,199,910 |
s350490059 | p04014 | u969708690 | 1599304430 | Python | Python (3.8.2) | py | Accepted | 74 | 9288 | 872 | import sys
def yakusu(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
sys.setrecursionlimit(1... | p04014 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>For integers <var>b (b \geq 2)</var> and <var>n (n \geq 1)</var>, let the function <var>f(b,n)</var> be defined as follows:</p>
<ul>
<li><var>f(b,n) = n</var>, when <var>n < b</var></li>
<li><var>f(b... | 87654
30
| 10
| 1,199,911 |
s379107985 | p04014 | u161134623 | 1599029971 | Python | Python (3.8.2) | py | Accepted | 59 | 9280 | 561 | def function(b, n):
if n < b:
return n
else:
return function(b, n//b) + n % b
from math import sqrt
def divs(n):
d=[]
for x in range(1,int(sqrt(n))+1):
if n%x==0:
d.extend([x,n//x])
d=list(set(d))
d.sort()
return d
def main():
n = int(input())
s = int(input())
i... | p04014 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>For integers <var>b (b \geq 2)</var> and <var>n (n \geq 1)</var>, let the function <var>f(b,n)</var> be defined as follows:</p>
<ul>
<li><var>f(b,n) = n</var>, when <var>n < b</var></li>
<li><var>f(b... | 87654
30
| 10
| 1,199,912 |
s533550261 | p04014 | u144913062 | 1596666724 | Python | PyPy3 (7.3.0) | py | Accepted | 94 | 73228 | 693 | def divisor(n):
divisors = []
i = 1
while i * i < n:
if n % i == 0:
divisors.append(i)
divisors.append(n // i)
i += 1
if i * i == n:
divisors.append(i)
divisors.sort()
return divisors
n = int(input())
s = int(input())
if n == s:
print(n + 1)
... | p04014 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>For integers <var>b (b \geq 2)</var> and <var>n (n \geq 1)</var>, let the function <var>f(b,n)</var> be defined as follows:</p>
<ul>
<li><var>f(b,n) = n</var>, when <var>n < b</var></li>
<li><var>f(b... | 87654
30
| 10
| 1,199,913 |
s454401439 | p04014 | u617515020 | 1595183941 | Python | Python (3.8.2) | py | Accepted | 58 | 9200 | 418 | from math import sqrt
def divs(n):
d=[]
for x in range(1,int(sqrt(n))+1):
if n%x==0:
d.extend([x,n//x])
d=list(set(d))
d.sort()
return d
def f(b,n):
if n<b:
return n
else:
return f(b,n//b)+(n%b)
n=int(input())
s=int(input())
if n<s:
print(-1)
exit()
elif n==s:
print(n+1)
exit... | p04014 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>For integers <var>b (b \geq 2)</var> and <var>n (n \geq 1)</var>, let the function <var>f(b,n)</var> be defined as follows:</p>
<ul>
<li><var>f(b,n) = n</var>, when <var>n < b</var></li>
<li><var>f(b... | 87654
30
| 10
| 1,199,914 |
s567557342 | p04014 | u786020649 | 1594407942 | Python | Python (3.8.2) | py | Accepted | 63 | 9300 | 618 | import sys
import math
def divlist(n):
sl=[]
ll=[]
for x in range(1,int(math.sqrt(n))+1):
if n%x==0:
sl.append(x)
ll.append(n//x)
ll.reverse()
sl.extend(ll)
return sl
def f(b,n):
if n<b:
return n
else:
return f(b,n//b)+(n%b)
def main(n,s):
if... | p04014 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>For integers <var>b (b \geq 2)</var> and <var>n (n \geq 1)</var>, let the function <var>f(b,n)</var> be defined as follows:</p>
<ul>
<li><var>f(b,n) = n</var>, when <var>n < b</var></li>
<li><var>f(b... | 87654
30
| 10
| 1,199,915 |
s849316271 | p04014 | u261103969 | 1593378965 | Python | PyPy3 (7.3.0) | py | Accepted | 92 | 72868 | 895 | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n = int(readline())
s = int(readline())
if s > n:
print(-1)
sys.exit()
if s == n:
print(n + 1)
sys.exit()
for i in range(2, n):
k = i ... | p04014 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>For integers <var>b (b \geq 2)</var> and <var>n (n \geq 1)</var>, let the function <var>f(b,n)</var> be defined as follows:</p>
<ul>
<li><var>f(b,n) = n</var>, when <var>n < b</var></li>
<li><var>f(b... | 87654
30
| 10
| 1,199,916 |
s546489014 | p04014 | u968846084 | 1585796853 | Python | Python (3.4.3) | py | Accepted | 50 | 3188 | 502 | def D(n,d):
r=0
while n>0:
r=r+n%d
n=n//d
return r
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
n=int(input())
... | p04014 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>For integers <var>b (b \geq 2)</var> and <var>n (n \geq 1)</var>, let the function <var>f(b,n)</var> be defined as follows:</p>
<ul>
<li><var>f(b,n) = n</var>, when <var>n < b</var></li>
<li><var>f(b... | 87654
30
| 10
| 1,199,917 |
s689821233 | p04014 | u984276646 | 1580935259 | Python | Python (3.4.3) | py | Accepted | 72 | 3188 | 519 | n = int(input())
s = int(input())
A = []
if n >= s:
for i in range(1, int((n-s)**(1/2))+1):
if (n - s) % i == 0:
if (n - s) // i != i:
A.append(i+1)
A.append((n - s) // i + 1)
else:
A.append(i+1)
def digit_sum(b, m):
if m < b:
return m
else:
return digit_sum(b, m //... | p04014 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>For integers <var>b (b \geq 2)</var> and <var>n (n \geq 1)</var>, let the function <var>f(b,n)</var> be defined as follows:</p>
<ul>
<li><var>f(b,n) = n</var>, when <var>n < b</var></li>
<li><var>f(b... | 87654
30
| 10
| 1,199,918 |
s810013994 | p04014 | u864197622 | 1576034576 | Python | Python (3.4.3) | py | Accepted | 22 | 3308 | 2,646 | def primeFactor(N):
i = 2
ret = {}
n = N
mrFlg = 0
while i**2 <= n:
k = 0
while n % i == 0:
n //= i
k += 1
ret[i] = k
i += 1
if i == 101 and n >= (2**20):
def findFactorRho(N): # Primeでないことを確認したものを引数とする。
... | p04014 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>For integers <var>b (b \geq 2)</var> and <var>n (n \geq 1)</var>, let the function <var>f(b,n)</var> be defined as follows:</p>
<ul>
<li><var>f(b,n) = n</var>, when <var>n < b</var></li>
<li><var>f(b... | 87654
30
| 10
| 1,199,919 |
s485942363 | p04014 | u864197622 | 1576034515 | Python | Python (3.4.3) | py | Accepted | 28 | 3316 | 859 | def primeFactor(N):
i, n, ret, d, sq = 2, N, {}, 2, 99
while i <= sq:
k = 0
while n % i == 0: n, k, ret[i] = n//i, k+1, k+1
if k > 0 or i == 97: sq = int(n**(1/2)+0.5)
if i < 4: i = i * 2 - 1
else: i, d = i+d, d^6
if n > 1: ret[n] = 1
return ret
def divisors(N):
... | p04014 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>For integers <var>b (b \geq 2)</var> and <var>n (n \geq 1)</var>, let the function <var>f(b,n)</var> be defined as follows:</p>
<ul>
<li><var>f(b,n) = n</var>, when <var>n < b</var></li>
<li><var>f(b... | 87654
30
| 10
| 1,199,920 |
s238394945 | p04014 | u971321372 | 1473589645 | Python | PyPy2 (5.6.0) | py | Accepted | 87 | 9840 | 504 |
def solve(n, b, shouldbe):
s = 0
while n > 0:
s += n % b
n /= b
return s == shouldbe
import math
n = input()
s = input()
d = n-s
if d < 0:
print -1
elif d == 0:
print n + 1
else:
ans = 98766531231223232232232329876653123122323223223232
for i in range(1, int(math.sqrt(d))+2):
if d % i == 0:
if solve(... | p04014 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>For integers <var>b (b \geq 2)</var> and <var>n (n \geq 1)</var>, let the function <var>f(b,n)</var> be defined as follows:</p>
<ul>
<li><var>f(b,n) = n</var>, when <var>n < b</var></li>
<li><var>f(b... | 87654
30
| 10
| 1,199,921 |
s283164119 | p04015 | u262597910 | 1601516459 | Python | Python (3.8.2) | py | Accepted | 63 | 11476 | 375 | n,a = map(int, input().split())
x = list(map(int, input().split()))
for i in range(n):
x[i] -= a
#x.sort()
#print(x)
#dp[i][j]: i枚目まで、値ｊ
dp = [[0]*5001 for _ in range(n+1)]
dp[0][2500]=1
for i in range(0,n):
for j in range(0,5001):
if (dp[i][j]!=0):
dp[i+1][j] += dp[i][j]
dp[i+1]... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,922 |
s711003198 | p04015 | u029000441 | 1601516326 | Python | PyPy3 (7.3.0) | py | Accepted | 73 | 68376 | 1,233 | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq ... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,923 |
s589395554 | p04015 | u896741788 | 1601058928 | Python | Python (3.8.2) | py | Accepted | 33 | 9528 | 222 | n,a=map(int,input().split())
from collections import defaultdict
dp=defaultdict(int)
dp[0]=1
for i in map(int,input().split()):
i-=a
for k in sorted(dp.keys(),reverse=(i>=0)):
dp[k+i]+=dp[k]
print(dp[0]-1) | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,924 |
s968133196 | p04015 | u678167152 | 1600540486 | Python | PyPy3 (7.3.0) | py | Accepted | 72 | 73448 | 249 | N, A = map(int, input().split())
X = list(map(lambda x:int(x)-A, input().split()))
dp = [0]*10000
dp[0] = 1
for i in range(N):
new_dp = dp[:]
for j in range(-3000,3000):
if dp[j]>0:
new_dp[j+X[i]] += dp[j]
dp = new_dp
print(dp[0]-1)
| p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,925 |
s230656963 | p04015 | u163783894 | 1600215372 | Python | Python (3.8.2) | py | Accepted | 73 | 9316 | 472 | import sys
import copy
readline = sys.stdin.buffer.readline
def main():
N, A = map(int, readline().split())
X = list(map(int, readline().split()))
X = [x - A for x in X]
dp = [0] * 5050
dp[2525] = 1
for i in range(N):
next_dp = copy.copy(dp)
for t in range(5050):
... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,926 |
s877831825 | p04015 | u163783894 | 1600215314 | Python | Python (3.8.2) | py | Accepted | 77 | 9344 | 880 | import sys
import copy
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl = lambda: list(map(int, readline().split()))
in_nl2 = lam... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,927 |
s014946036 | p04015 | u306950978 | 1599787164 | Python | PyPy3 (7.3.0) | py | Accepted | 77 | 70592 | 384 | n , a = map(int,input().split())
x = list(map(lambda x:int(x)-a,input().split()))
dp = [0 for i in range(4901)]
for i in x:
if i < 0:
for j in range(4901):
if 0<=i+j<=4900:
dp[j+i] += dp[j]
elif i >= 0:
for j in reversed(range(4901)):
if 0<=i+j<=4900:
... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,928 |
s230073117 | p04015 | u842170774 | 1599162377 | Python | PyPy3 (7.3.0) | py | Accepted | 77 | 75580 | 354 | import bisect
N,A=map(int,input().split())
x=[i-A for i in map(int,input().split())]
B=max(max(x),abs(min(x)))
dp=[[0]*(2*N*B+1) for _ in [0]*(N+1)]
dp[0][N*B]=1
# dp[n][k]:n番目までの整数でkが作れる場合の数
for n in range(1,N+1):
for k in range(-N*B,N*B+1):
dp[n][k]+=dp[n-1][k-x[n-1]]+dp[n-1][k]
print(dp[N][N*B]-... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,929 |
s971608098 | p04015 | u511824539 | 1598914289 | Python | PyPy3 (7.3.0) | py | Accepted | 93 | 68988 | 341 | N, A = map(int, input().split())
X = list(map(lambda x: int(x)-A, input().split()))
X_MAX = max(max(X), -min(X))
NX = N * X_MAX
dp = [[0] * (X_MAX * (N+1) * 2 + 1) for i in range(N+1)]
dp [0][NX] = 1
for i in range(1, N+1):
for j in range(NX*2+1):
dp[i][j] += dp[i-1][j]
dp[i][j] += dp[i-1][j-X[i-1]... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,930 |
s167643492 | p04015 | u223663729 | 1598127568 | Python | PyPy3 (7.3.0) | py | Accepted | 74 | 70008 | 330 | OFS = 2500
MAX = 2*OFS + 1
N, A = map(int, input().split())
X = [x-A for x in map(int, input().split())]
dp = [[0]*MAX for _ in [0]*(N+1)]
dp[0][OFS] = 1
for i in range(1, N+1):
x = X[i-1]
for j in range(MAX-1, -1, -1):
if 0 <= j-x < MAX:
dp[i][j] = dp[i-1][j] + dp[i-1][j-x]
print(dp[-1][... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,931 |
s655981720 | p04015 | u653837719 | 1597965970 | Python | PyPy3 (7.3.0) | py | Accepted | 74 | 69636 | 324 | n, a = map(int, input().split())
x = list(map(int, input().split()))
y = [v-a for v in x]
dp = [[0] * 5000 for _ in range(n+1)]
zero = 2500
dp[0][zero] = 1
for i in range(n):
for j in range(5000):
dp[i+1][j] += dp[i][j]
if j + y[i] < 5000:
dp[i+1][j+y[i]] += dp[i][j]
print(dp[n][zero] ... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,932 |
s909876702 | p04015 | u367701763 | 1597965896 | Python | PyPy3 (7.3.0) | py | Accepted | 76 | 68740 | 351 | N, A = map(int, input().split())
X = list(map(int, input().split()))
dp = [[0]*(A*N+2) for _ in range(N+2)]
dp[0][0] = 1
for i, x in enumerate(X,start=1):
for n in reversed(range(i)):
for k in range(A*N+1):
if dp[n][k] == 0: continue
dp[n+1][min(k+x,A*N+1)] += dp[n][k]
print(sum(dp[n... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,933 |
s950451167 | p04015 | u023229441 | 1597205133 | Python | Python (3.8.2) | py | Accepted | 62 | 11728 | 327 | n,h=map(int,input().split())
A=list(map(int,input().split()))
A= [i-h for i in A]
dp=[[0]*5100 for i in range(n+1)]
dp[0][2500]=1
for i in range(n):
for j in range(5100):
if not dp[i][j]: continue
dp[i+1][j] += dp[i][j]
#if A[i]==0:continue
dp[i+1][j+A[i]] +=dp[i][j]
print(dp[n][2... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,934 |
s729466733 | p04015 | u036104576 | 1596477573 | Python | Python (3.8.2) | py | Accepted | 91 | 9228 | 350 | N, A = map(int, input().split())
X = list(map(int, input().split()))
Y = [x - A for x in X]
dp = [0] * 5010
dp[2500] = 1
for y in Y:
r = []
if y >= 0:
r = range(5009, -1, -1)
else:
r = range(5010)
for i in r:
if i - y < 0 or i - y >= 5010:
continue
dp[i] += ... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,935 |
s852360284 | p04015 | u046158516 | 1596332593 | Python | PyPy3 (7.3.0) | py | Accepted | 65 | 68732 | 343 | n,a=map(int,input().split())
x=list(map(int,input().split()))
dic={}
dic2=dic.copy()
for i in range(n):
for j in dic:
if j+x[i]-a in dic2:
dic2[j+x[i]-a]+=dic[j]
else:
dic2[j+x[i]-a]=dic[j]
if x[i]-a in dic2:
dic2[x[i]-a]+=1
else:
dic2[x[i]-a]=1
dic=dic2.copy()
if 0 in dic:
print(d... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,936 |
s959956448 | p04015 | u651663683 | 1596233667 | Python | Python (3.8.2) | py | Accepted | 40 | 9232 | 290 | n,a=list(map(int,input().split()))
x=list(map(lambda x:int(x)-a,input().split()))
d={0:1}
for i in range(n):
nd={}
for j in d:
if j in nd:
nd[j]+=d[j]
else:
nd[j]=d[j]
if (j+x[i]) in nd:
nd[j+x[i]]+=d[j]
else:
nd[j+x[i]]=d[j]
d=nd
print(d[0]-1) | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,937 |
s086747077 | p04015 | u647999897 | 1595783234 | Python | PyPy3 (7.3.0) | py | Accepted | 69 | 69356 | 460 | def solve():
N,A = map(int,input().split())
x = list(map(lambda a: int(a)-A,input().split()))
GETA = 2500
dp = [[0] * 5000 for _ in range(N+1)]
dp[0][2500] = 1
for i in range(N):
for j in range(5000):
if dp[i][j] == 0 or j+x[i] >= 5000:
continue
... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,938 |
s676759495 | p04015 | u844789719 | 1595644644 | Python | Python (3.8.2) | py | Accepted | 70 | 10780 | 741 | import collections
N, A = [int(_) for _ in input().split()]
X = [int(_) for _ in input().split()]
Y = X[:N // 2]
Z = X[N // 2:]
def calc(W):
#dp[m][s]=m枚のカードの和がsとなるような選び方の総数
M = len(W)
dp = [collections.defaultdict(int) for _ in range(M + 1)]
dp[0][0] = 1
for i, w in enumerate(W):
for j in... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,939 |
s821546854 | p04015 | u535803878 | 1595547739 | Python | PyPy3 (7.3.0) | py | Accepted | 69 | 69416 | 530 | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n,a = list(map(int, input().split()))
x = list(map(lambda x: int(x)-a, input().split()))
size = max(1, sum(abs(item) for item in x))
# 0:
dp = [[0]*(2*size+1) for _ in range(n+... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,940 |
s056509044 | p04015 | u434966508 | 1595331681 | Python | PyPy3 (7.3.0) | py | Accepted | 83 | 74388 | 336 | from collections import defaultdict
n, a = map(int, input().split())
x = list(map(int, input().split()))
y = [xi - a for xi in x]
# 解説AC
dp = [defaultdict(int) for i in range(n + 1)]
dp[0][0] = 1
for i in range(n):
for j in dp[i]:
dp[i + 1][j + y[i]] += dp[i][j]
dp[i + 1][j] += dp[i][j]
print(dp... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,941 |
s953627416 | p04015 | u035907840 | 1595009102 | Python | PyPy3 (7.3.0) | py | Accepted | 74 | 69884 | 334 | N, A = map(int, input().split())
*X, = map(lambda x:int(x)-A, input().split())
M = 2500
dp = [[0]*(2*M+1) for _ in range(N)]
dp[0][M] += 1
dp[0][X[0]+M] += 1
for i in range(1,N):
for v in range(-M, M+1):
dp[i][v+M] += dp[i-1][v+M]
if -M<=v-X[i]<=M:
dp[i][v+M] += dp[i-1][v-X[i]+M]
prin... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,942 |
s457096980 | p04015 | u222668979 | 1594709274 | Python | Python (3.8.2) | py | Accepted | 43 | 10864 | 334 | from collections import defaultdict
n, a = map(int, input().split())
x = list(map(int, input().split()))
y = [xi - a for xi in x]
# 解説AC
dp = [defaultdict(int) for i in range(n + 1)]
dp[0][0] = 1
for i in range(n):
for j in dp[i]:
dp[i + 1][j + y[i]] += dp[i][j]
dp[i + 1][j] += dp[i][j]
print(dp[n... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,943 |
s069673539 | p04015 | u222668979 | 1594709213 | Python | PyPy3 (7.3.0) | py | Accepted | 83 | 74328 | 334 | from collections import defaultdict
n, a = map(int, input().split())
x = list(map(int, input().split()))
y = [xi - a for xi in x]
# 解説AC
dp = [defaultdict(int) for i in range(n + 1)]
dp[0][0] = 1
for i in range(n):
for j in dp[i]:
dp[i + 1][j + y[i]] += dp[i][j]
dp[i + 1][j] += dp[i][j]
print(dp[n... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,944 |
s080149865 | p04015 | u350248178 | 1593330010 | Python | Python (3.8.2) | py | Accepted | 36 | 10528 | 283 | n,a=map(int,input().split())
x=[int(j)-a for j in input().split()]
from collections import defaultdict
dp=[defaultdict(int)for i in range(n+1)]
dp[0][0]=1
for i,j in enumerate(x,1):
l=dp[i-1].copy()
for k in dp[i-1]:
l[k+j]+=dp[i-1][k]
dp[i]=l
print(dp[-1][0]-1) | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,945 |
s495343282 | p04015 | u875291233 | 1592852448 | Python | Python (3.8.2) | py | Accepted | 35 | 9276 | 345 | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n,a,*x = map(int,read().split())
x = [i-a for i in x]
d = {0:1}
for i in x:
nd = d.copy()
for k,v in d.items():
if k+i in nd:
nd[k+i] += v
else:
nd[k+i] = v
d = nd
... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,946 |
s773581561 | p04015 | u756782069 | 1590637501 | Python | Python (3.4.3) | py | Accepted | 56 | 4468 | 774 | N,A = map(int, input().split())
x = list(map(int,input().split()))
INF = 2500
y = [i-A for i in x]
y.sort()
y1 = [abs(x) for x in y if x < 0]
y2 = [x for x in y if x > 0]
y3 = [x for x in y if x == 0]
def p(y,A):
dp=[[0 for i in range(A+1)] for j in range(N+1)]
dp[0][0]=1
N1 = len(y)
#DP
... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,947 |
s498196747 | p04015 | u780475861 | 1589829553 | Python | Python (3.4.3) | py | Accepted | 23 | 3444 | 810 | import sys
from collections import defaultdict
def main():
N, A, *xlst = map(int, sys.stdin.read().split())
x_p = []
x_n = []
x_z = 0
for i in xlst:
if A < i:
x_p.append(i - A)
elif i < A:
x_n.append(A - i)
else:
x_z += 1
x_p.sort(), ... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,948 |
s792854299 | p04015 | u780475861 | 1589828932 | Python | Python (3.4.3) | py | Accepted | 22 | 3444 | 846 | import sys
from collections import defaultdict
def main():
N, A, *xlst = map(int, sys.stdin.read().split())
x_p = []
x_n = []
x_z = 0
for i in xlst:
if A < i:
x_p.append(i - A)
elif i < A:
x_n.append(A - i)
else:
x_z += 1
x_p.sort(), ... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,949 |
s084862077 | p04015 | u780475861 | 1589828772 | Python | Python (3.4.3) | py | Accepted | 24 | 3436 | 834 | import sys
from collections import defaultdict
def main():
N, A, *xlst = map(int, sys.stdin.read().split())
x_p = []
x_n = []
x_z = 0
xlst.sort()
for i in xlst:
if A < i:
x_p.append(i - A)
elif i < A:
x_n.append(A - i)
else:
x_z += 1
... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,950 |
s712429781 | p04015 | u780475861 | 1589828517 | Python | Python (3.4.3) | py | Accepted | 23 | 3444 | 867 | import sys
from collections import defaultdict
def main():
N, A, *xlst = map(int, sys.stdin.read().split())
x_p = []
x_n = []
x_z = 0
for i in xlst:
i = int(i)
if A < i:
x_p.append(i - A)
elif i < A:
x_n.append(A - i)
else:
x_z +=... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,951 |
s427784572 | p04015 | u780475861 | 1589828039 | Python | Python (3.4.3) | py | Accepted | 23 | 4340 | 979 | import sys
from collections import defaultdict
def main():
N, A, *xlst = map(int, sys.stdin.read().split())
x_p = []
x_n = []
x_z = 0
for i in xlst:
i = int(i)
if A < i:
x_p.append(i - A)
elif i < A:
x_n.append(A - i)
else:
x_z +=... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,952 |
s730278526 | p04015 | u896741788 | 1589689818 | Python | Python (3.4.3) | py | Accepted | 74 | 3188 | 263 | n,a=map(int,input().split())
l=list(map(int,input().split()))
dp=[0]*5300
dp[l[0]-a]=1
for x in l[1:]:
b=x-a
if b>=0:
for i in range(2500,-2501,-1):
dp[i+b]+=dp[i]
else:
for i in range(-2500,2501):
dp[i+b]+=dp[i]
dp[b]+=1
print(dp[0]) | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,953 |
s882235235 | p04015 | u550061714 | 1588082184 | Python | Python (3.4.3) | py | Accepted | 27 | 3444 | 298 | from collections import defaultdict
N, A = map(int, input().split())
intA = lambda x: int(x) - A
X = tuple(map(intA, input().split()))
d = defaultdict(int)
for x in X:
new_d = d.copy()
for k, v in d.items():
new_d[k + x] += v
new_d[x + 2500] += 1
d = new_d
print(d[2500])
| p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,954 |
s511828380 | p04015 | u747602774 | 1587540962 | Python | Python (3.4.3) | py | Accepted | 26 | 3564 | 294 | N,A = map(int,input().split())
X = list(map(int,input().split()))
for i in range(N):
X[i] -= A
from collections import defaultdict
counter = defaultdict(int)
counter[0] = 1
for x in X:
copy = dict(counter)
for k,v in copy.items():
counter[k+x] += v
print(counter[0]-1)
| p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,955 |
s539657550 | p04015 | u861141787 | 1584702595 | Python | Python (3.4.3) | py | Accepted | 39 | 5492 | 328 | from collections import defaultdict
n, a = 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 dp[i].keys():
pk = p + a - x_i
dp[i+1][pk] += dp[i][p]
dp[i+1][p] += dp[i][p]
print(dp[n]... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,956 |
s484317466 | p04015 | u557494880 | 1578518422 | Python | Python (3.4.3) | py | Accepted | 54 | 5748 | 371 | N,A = 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+1):
dp[i][j... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,957 |
s227605505 | p04015 | u509368316 | 1572488414 | Python | Python (3.4.3) | py | Accepted | 42 | 3064 | 333 | N,A=map(int,input().split())
X=[x-A for x in map(int,input().split())]
dp=[0]*(N*100+1)
dp[0]=1
for x in X:
if x>0:
for i in range(N*50,-N*50-1,-1):
if dp[i]>0:
dp[i+x]+=dp[i]
else:
for i in range(-N*50,N*50+1):
if dp[i]>0:
dp[i+x]+=dp[i]
p... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,958 |
s286791987 | p04015 | u196697332 | 1569625165 | Python | Python (3.4.3) | py | Accepted | 26 | 3188 | 256 | N, A = map(int, input().split())
X = [int(_) - A for _ in input().split()]
dic = {0: 1}
#print(dic.items())
for x in X:
for i, j in list(dic.items()):
#print(i, j)
#print(dic)
dic[x + i] = dic.get(x+i, 0) + j
print(dic[0] - 1) | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,959 |
s528462157 | p04015 | u670180528 | 1568957518 | Python | Python (3.4.3) | py | Accepted | 23 | 3188 | 210 | def main():
n,a=map(int,input().split())
y=[a-int(x) for x in input().split()]
dp={0:1}
for i in y:
for k,v in list(dp.items()):
dp[i+k]=dp.get(i+k,0)+v
print(dp[0]-1)
if __name__=="__main__":
main() | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,960 |
s608088283 | p04015 | u670180528 | 1568957380 | Python | Python (3.4.3) | py | Accepted | 25 | 3188 | 158 | n,a=map(int,input().split())
y=[a-int(x) for x in input().split()]
dp={0:1}
for i in y:
for k,v in list(dp.items()):
dp[i+k]=dp.get(i+k,0)+v
print(dp[0]-1) | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,961 |
s280078835 | p04015 | u670180528 | 1568957279 | Python | Python (3.4.3) | py | Accepted | 28 | 3188 | 148 | n,a,*X=map(int,open(0).read().split())
y=[a-x for x in X]
dp={0:1}
for i in y:
for k,v in set(dp.items()):
dp[i+k]=dp.get(i+k,0)+v
print(dp[0]-1) | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,962 |
s718149105 | p04015 | u670180528 | 1568957107 | Python | Python (3.4.3) | py | Accepted | 29 | 3188 | 133 | n,a,*x=map(int,open(0).read().split());dp={0:1}
for i in x:
for k,v in set(dp.items()):
dp[i+k-a]=dp.get(i+k-a,0)+v
print(dp[0]-1) | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,963 |
s955912297 | p04015 | u412481017 | 1568654764 | Python | Python (3.4.3) | py | Accepted | 26 | 3188 | 219 | N, A = tuple(map(int, input().split()))
X = list(map(lambda x: int(x) - A, input().split()))
D = {0:0}
for item in X:
for k,v in list(D.items()):
D[k+item]=D.get(k+item,0)+v
D[item]=D.get(item,0)+1
print(D[0]) | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,964 |
s100233744 | p04015 | u296518383 | 1568589172 | Python | Python (3.4.3) | py | Accepted | 32 | 3064 | 610 | N,A=map(int,input().split())
x=list(map(int,input().split()))
cnt=x.count(A)
B=[]
for i in x:
if i != A:
B.append(i-A)
#print(cnt,B)
plus=[0]*2501
minus=[0]*2501
for i in B:
if i>0:
for j in range(2500,0,-1):
if plus[j]>0 and j+i<=2500:
plus[j+i]+=plus[j]
plus[i]+=1
if i<0:
i=-i
... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,965 |
s637917723 | p04015 | u077291787 | 1567243594 | Python | Python (3.4.3) | py | Accepted | 30 | 3572 | 389 | # ABC044C - 高橋君とカード / Tak and Cards (ARC060C)
from collections import defaultdict
def main():
N, A = tuple(map(int, input().split()))
X = tuple(map(lambda x: int(x) - A, input().split()))
D = defaultdict(int)
D[0] = 1
for i in X:
for j, k in list(D.items()):
D[i + j] += k
p... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,966 |
s204814999 | p04015 | u077291787 | 1567243523 | Python | Python (3.4.3) | py | Accepted | 23 | 3188 | 358 | # ABC044C - 高橋君とカード / Tak and Cards (ARC060C)
def main():
N, A = tuple(map(int, input().split()))
X = tuple(map(lambda x: int(x) - A, input().split()))
D = {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__ =... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,967 |
s976200394 | p04015 | u977193988 | 1562507004 | Python | Python (3.4.3) | py | Accepted | 26 | 3188 | 180 | n,a=map(int,input().split())
X=[int(i)-a for i in input().split()]
memo={0:1}
for x in X:
for k,v in list(memo.items()):
memo[x+k]=memo.get(x+k,0)+v
print(memo[0]-1)
| p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,968 |
s779935562 | p04015 | u864197622 | 1558548438 | Python | Python (3.4.3) | py | Accepted | 47 | 3064 | 417 | N, A = map(int, input().split())
X = [int(a) for a in input().split()]
PO = [x-A for x in X if x > A]
NE = [A-x for x in X if x < A]
ZE = N - len(PO) - len(NE)
Y = [1] + [0] * 3000
Z = [1] + [0] * 3000
for i in PO:
for j in range(2800)[::-1]:
Y[i+j] += Y[j]
for i in NE:
for j in range(2800)[::-1]:
... | p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,969 |
s990459458 | p04015 | u606045429 | 1558470637 | Python | Python (3.4.3) | py | Accepted | 26 | 3188 | 210 | N, A = [int(i) for i in input().split()]
X = [int(i) - A for i in input().split()]
memo = {0:1}
for x in X:
for k, v in list(memo.items()):
memo[x + k] = memo.get(x + k, 0) + v
print(memo[0] - 1)
| p04015 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Tak has <var>N</var> cards. On the <var>i</var>-th <var>(1 \leq i \leq N)</var> card is written an integer <var>x_i</var>.
He is selecting one or more cards from these <var>N</var> cards, so that the av... | 4 8
7 9 8 9
| 5
| 1,199,970 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.