s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s072657130 | p04011 | u453500284 | 1565886790 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 81 | n, k, x, y = [(int(input()) for i in range(4))]
print(x*n - (x - y)*max(0, n-k))
|
s693577525 | p04011 | u453500284 | 1565886732 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 82 | n, k, x, y = [(int(input()), for i in range(4))]
print(x*n - (x - y)*max(0, n-k))
|
s413481857 | p04011 | u453500284 | 1565886662 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 85 | n, k, x, y = [map(int(input()), for i in range(4))]
print(x*n - (x - y)*max(0, n-k))
|
s604411831 | p04011 | u453500284 | 1565886611 | Python | Python (3.4.3) | py | Runtime Error | 21 | 2940 | 87 | n, k, x, y = [map(int(input()), for i in range(4))]
print(x*n - (x - y)*max(0, n - k))
|
s513560567 | p04011 | u453500284 | 1565886566 | Python | Python (3.4.3) | py | Runtime Error | 21 | 2940 | 86 | n, k, x, y = [map(int(input()), for i in range(4))]
print(x*n - (x - y)*max(0, n - k)
|
s703546995 | p04011 | u453500284 | 1565886517 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 87 | n, k, x, y = [map(int(input()), for i in range(4))]
print(x * n - (x - y)*max(0, n - k) |
s775708766 | p04011 | u959759457 | 1565793821 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 70 | N,K,X,Y=map(int,input().split())
print(X*N if N<=K else X*K+Y*(N-K))
|
s599471639 | p04011 | u280552586 | 1565716128 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 66 | a,b,c,d=[int(input) for i in range(4)]
print(a*c-(c-d)*max(b-a,0)) |
s843720704 | p04011 | u457554982 | 1565709450 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 113 | n=int(input())
k=int(input())
x=int(input())
y=inr(input())
if n>k:
kane=k*x+(n-k)*y
else:
kane=k*x
print(kane) |
s921407541 | p04011 | u802963389 | 1565650517 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 86 | N, K, X, Y = [int(input() for _ in range(4))]
print(min(N, K) * X + max(0, N - K) * Y) |
s306727147 | p04011 | u134712256 | 1565389860 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3060 | 115 | w = input()
for i in range(len(w)):
if w.count(w[i])%2 == 1:
print("No")
exit(1)
print("Yes")
|
s852968210 | p04011 | u134712256 | 1565389821 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 105 | w = input()
for i in set(w):
if w.count(i)%2 == 1:
print("No")
exit(1)
print("Yes")
|
s902147737 | p04011 | u134712256 | 1565389789 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 107 | w = input()
for i in set(w):
if w.count(i)%2 == 1:
print("No")
exit(-1)
print("Yes")
|
s082403605 | p04011 | u134712256 | 1565389695 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 83 | w = input()
for i in set(w):
if w.count(i)%2 == 1:
#print("No")
print("Yes")
|
s686705939 | p04011 | u740047492 | 1565388114 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 127 | N = int(input())
K = int(input())
X = int(input())
Y = int(input())
total_price = ((k * X) + ((N - K) * Y))
print(total_price) |
s020961289 | p04011 | u333190709 | 1565268572 | Python | PyPy3 (2.4.0) | py | Runtime Error | 288 | 68588 | 1167 | #!/usr/bin/env python3
import sys, math, fractions, itertools
def solve(N: int, A: int, x: "List[int]"):
X = max(x)
dp = [[[0 for _ in range(max(N*X+1, N*A+1))] for _ in range(N+1) ] for _ in range(N+1)]
dp[0][0][0] = 1
for n in range(N+1):
for m in range(N+1):
for k in range(N*X+1):
if n >= 1 and k < x[n-1]:
dp[n][m][k] = dp[n-1][m][k]
elif n >= 1 and m >= 1 and k >= x[n-1]:
dp[n][m][k] = dp[n-1][m][k] + dp[n-1][m-1][k-x[n-1]]
s = 0
for i in range(1, N+1):
s += dp[N][i][i*A]
print(s)
return
# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
A = int(next(tokens)) # type: int
x = [ int(next(tokens)) for _ in range(N) ] # type: "List[int]"
solve(N, A, x)
if __name__ == '__main__':
main()
|
s251443377 | p04011 | u571445182 | 1564893522 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 218 | import sys
nN = int(input())
nK = int(input())
nX = int(input())
nY = int(input())
nE = 0
nANs = 0
if nN =< nK:
nAns = nX * nN
print(nAns)
sys.exit()
nE = nN - nK
nAns = nX * nN + nY * nE
print(nAns)
|
s680492122 | p04011 | u498397607 | 1564893507 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 140 | inport numpy as np
n, k, x, y = map(int, input().split('\n'))
basic = np.min(k * x, n * x)
plus = np.max((n - k) * y, 0)
print(basic + plus) |
s249778995 | p04011 | u498397607 | 1564893446 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 115 | n, k, x, y = map(int, input().split('\n'))
basic = min(k * x, n * x)
plus = max((n - k) * y, 0)
print(basic + plus) |
s104761099 | p04011 | u571445182 | 1564893431 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 207 | import sys
nN = int(input())
nK = int(input())
nX = int(input())
nY = int(input())
nE = 0
if nN =< nK:
nAns = nX * nN
print(nAns)
sys.exit()
nE = nN - nK
nAns = nX * nN + nY * nE
print(nAns)
|
s886778963 | p04011 | u498397607 | 1564893371 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 111 | n, k, x, y = map(int, input().split())
basic = min(k * x, n * x)
plus = max((n - k) * y, 0)
print(basic + plus) |
s357471598 | p04011 | u003501233 | 1564534396 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 88 | N,K,X,Y=map(int,input().split())
if N >= K:
print((N-K)*Y + (K*X))
else:
print(N*X) |
s700942898 | p04011 | u302292660 | 1564468660 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38384 | 68 | n = input()
k = input()
x = input()
y = input()
print(k*x + (n-k)*y) |
s645847051 | p04011 | u114648678 | 1564188746 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 84 | n=int(input())
k=int(input())
x=int(input())
y=int(input())
print(k*x+(max(0,n-k)*y) |
s561180183 | p04011 | u675073679 | 1563383233 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 158 | nums = list(map(int,input().split()))
N = int(nums[0])
K = int(nums[1])
X = int(nums[2])
Y = int(nums[3])
if N > K:
print(K*X + (N-K)*Y)
else:
print(N*X) |
s478597808 | p04011 | u093500767 | 1562126879 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 137 | n = input().int()
k = input().int()
x = input().int()
y = input().int()
if n <= k:
print(int(n*x))
else:
print(int(k*x+(n-k)*y)) |
s265000578 | p04011 | u093500767 | 1562126832 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 127 | n = input().int()
k = input().int()
x = input().int()
y = input().int()
if n <= k:
print(n*x)
else:
print(k*x+(n-k)*y) |
s990399208 | p04011 | u759412327 | 1561772686 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 128 | a = []
for i in range(4):
a.append(int(input()))
if a[0] > a[1]:
print(a[3]*a[1]+a[4]*(a[2]-a[1]))
else:
print(a[3]*a[1]) |
s081063240 | p04011 | u263830634 | 1561428280 | Python | PyPy3 (2.4.0) | py | Runtime Error | 165 | 38256 | 913 | import numpy as np
N, A = map(int, input().split())
x = list(map(int, input().split()))
X = max(x)
if X < A:
X = A
def check(j, k, s):
if dp[j][k][s] != -1:
return dp[j][k][s]
if j == 0 and k == 0 and s == 0:
dp[j][k][s] = 1
return 1
if j >= 1 and s < x[j-1]:
a = check(j-1, k ,s)
dp[j][k][s] = a
return a
if j >= 1 and k >= 1 and s >= x[j-1]:
a = check(j-1, k, s) + check(j-1, k-1, s-x[j-1])
dp[j][k][s] = a
return a
dp[j][k][s] = 0
return 0
dp = [[[-1] * (N*X+1) for _ in range(N+1)] for _ in range(N + 1)]
dp = np.array(dp)
# print (dp)
# for j in range(N+1):
# for k in range(N+1):
# for s in range(N*X + 1):
# print (j, k, s)
# dp[j][k][s] = check(j, k, s)
ans = 0
for k in range(1, N+1):
ans += check(N, k, k * A)
# ans += dp[N][k][k * A]
print (ans) |
s814041922 | p04011 | u150386598 | 1560037658 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 137 | s = list(map(int, input().split()))
if s[0] > s[1]:
print((s[1] * s[2] + (s[0] - s[1]) * s[3]))
else:
print(s[0]*s[2]) |
s485863886 | p04011 | u150386598 | 1560037567 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 137 | s = list(map(int, input().split()))
if s[0] > s[1]:
print((s[1] * s[2] + (s[0] - s[1]) * s[3]))
else:
print(s[0]*s[2]) |
s735219398 | p04011 | u558374183 | 1558796495 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 132 | l = [int(input()) for i range(4)]
if l[0] <= l[1]:
sum = l[0] * l[2]
else:
sum = l[1] * l[2] + (l[0]-l[1]) * l[3]
print(sum) |
s275753586 | p04011 | u558374183 | 1558796355 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 130 | l = [int(input) for i range(4)]
if l[0] <= l[1]:
sum = l[0] * l[2]
else:
sum = l[1] * l[2] + (l[0]-l[1]) * l[3]
print(sum) |
s578466256 | p04011 | u558374183 | 1558796010 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 134 | l = list(map(int, input().split()))
if l[0] <= l[1]:
sum = l[0] * l[2]
else:
sum = l[1] * l[2] + (l[0]-l[1]) * l[3]
print(sum) |
s679025254 | p04011 | u558374183 | 1558795814 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 132 | l=list(map(int, input().split()))
if l[0] <= l[1]:
sum = l[0] * l[2]
else:
sum = l[1] * l[2] + (l[0]-l[1]) * l[3]
print(sum) |
s916551404 | p04011 | u558374183 | 1558794424 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 130 | l=list(map(int, input.split()))
if l[0] <= l[1]:
sum = l[0] * l[2]
else:
sum = l[1] * l[2] + (l[0]-l[1]) * l[3]
print(sum) |
s466780192 | p04011 | u663014688 | 1558572191 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 143 | n=int(inpyt())
k=int(inpyt())
sp_p=int(inpyt())
n_p=int(inpyt())
sum = 0
for i in k:
sum += sp_p
for j in n-k:
sum += n_p
print(sum) |
s667244279 | p04011 | u663014688 | 1558571464 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 122 | n, k, sp_p, n_p = map(int, input().split())
sum = 0
for i in k:
sum += sp_p
for j in n-k:
sum += n_p
print(sum) |
s842414287 | p04011 | u663014688 | 1558486628 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 126 | n, k, sp_p, n_p = map(int, input().split())
sum = 0
for i in k+1:
sum += sp_p
for j in n-k+1:
sum += n_p
print(sum) |
s736904675 | p04011 | u353652911 | 1558474529 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 108 | n,k,x,y=(int(input())for i in range(4)
if k>=n:
c=n*x+(k-n)*y
else:
c=n*x
print(c)
|
s934349940 | p04011 | u532966492 | 1557173085 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 70 | N,K,X,Y=[input() for _ in range(4)];print(min([N,K])*X+max([N-K,0])*Y) |
s962707065 | p04011 | u532966492 | 1557173048 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 59 | N,K,X,Y=[input() for _ in range(4)];print(K*X+max(N-K,0)*Y) |
s845547248 | p04011 | u507116804 | 1556677518 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 153 | n=int(input())
k=int(input())
x=int(input())
y=int(input())
if n<=k:
ans=n*x
else:
sum=k*x+(n-k)*y
print(sum) |
s137592999 | p04011 | u432805419 | 1556672264 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 98 | a = input()
b = input()
c = input()
d = input()
if a > b:
print(b*c+(a-b)*d)
else:
print(a*c) |
s008523025 | p04011 | u507116804 | 1556642420 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 61 | if n > k:
print(int(k*x+(n-k)*y))
else:
print(int(n*x)) |
s716867392 | p04011 | u507116804 | 1556642102 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 95 | n,k,x,y=map(int, input().split())
if n > k:
print(int(k*x+(n-k)*y))
else:
print(int(n*x)) |
s565434573 | p04011 | u507116804 | 1556642063 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3316 | 96 | n,k,x,y=map(int, input().split())
if n > k:
print(int(k*x+(n-k)*y))
else:
print(int(n*x)) |
s215318219 | p04011 | u507116804 | 1556640625 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 34 | n,k,x,y=map(int,input().split())
|
s947518097 | p04011 | u507116804 | 1556640349 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 95 | n,k,x,y=map(int,input().split())
if n > k:
print(int(k*x+(n-k)*y))
else:
print(int(n*x)) |
s627843269 | p04011 | u507116804 | 1556640287 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 105 | n,k,x,y=map(int,input().split())
if n > k:
print(int(k*10000+(n-k)*9000))
else:
print(int(n*10000) |
s231432439 | p04011 | u927870520 | 1556160681 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 116 | a=[]
a = list(map(int,input().split()))
if a[1] <= a[0]:
b=(a[0]-a[1])*a[3]+a[1]*a[2]
else:
b=a[0]*a[2]
print(b) |
s789382836 | p04011 | u813371068 | 1556074993 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 74 | n,k,x,y = map( int,input().split() )
print(n*x if k>=n else k*x + (n-k)*y) |
s298468799 | p04011 | u149752754 | 1555630961 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 290 | words = input()
lett = list(words)
numlist = []
for i in lett:
num = lett.count(i)
numlist += [num]
jud = []
for i in numlist:
if i%2 == 0:
jud += ['Yes']
else:
jud += ['No']
anslist = [x for x in set(jud) if jud.count(x) > 1]
ans = anslist[0]
print(ans)
|
s792578702 | p04011 | u021083776 | 1555428938 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 118 | N = int(input())
K = int(input())
X = int(input())
Y = int(input())
if N > K:
print(K*X + (N-K)*Y)
else :
print(N* |
s735503529 | p04011 | u457960175 | 1555006557 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 78 | n, k, x, y = int(input())
if n > k :
print(k*x+(n-k)*y)
else:
print(n*x)
|
s614542206 | p04011 | u288040231 | 1554682982 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 125 | N,K,X,Y=map(int, input().split())
result = 0
if N > K:
result = K * X + (N - K) * Y
else:
result = N * X
print(result)
|
s983699162 | p04011 | u288040231 | 1554682953 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 126 | N,K,X,Y = map(int,input().split())
result = 0
if N > K:
result = K * X + (N - K) * Y
else:
result = N * X
print(result)
|
s987889268 | p04011 | u288040231 | 1554682920 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 127 | N,K,X,Y = map(int, input().split())
result = 0
if N > K:
result = K * X + (N - K) * Y
else:
result = N * X
print(result)
|
s931536332 | p04011 | u288040231 | 1554682626 | Python | Python (3.4.3) | py | Runtime Error | 20 | 2940 | 126 | N,K,X,Y = map(int, input().split())
result = 0
if N > K:
result = K * X + (N - K) * Y
else:
result = N * X
print(result) |
s587390815 | p04011 | u288040231 | 1554670515 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 86 | N,K,X,Y = map(int, input().split())
if(N<=K):
print(X*N)
else:
print(X*K+(N-K)*Y)
|
s070753634 | p04011 | u288040231 | 1554669551 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 64 | n,k,x,y = map(int, input().split)
print((k * x) + ((n - k) * y)) |
s120342602 | p04011 | u280512618 | 1553948664 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 83 | n=int(inout())
k=int(input())
x=int(input())
y=int(input())
print(x*k+y*max(0,n-k)) |
s281668690 | p04011 | u844123804 | 1552869279 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 131 | a = [input() for i in range(4)]
ans = 0
for i in range(1,a[0]+1):
if i<a[1]:
ans += a[2]
else:
ans += a[3]
print(ans) |
s700088608 | p04011 | u844123804 | 1552869072 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 166 | n = input()
ini = input()
ini_pri=input()
left_pri=input()
ans = 0
for i in range(n):
if i < ini:
ans += ini_pri
else:
ans += left_pri
print(ans) |
s188200769 | p04011 | u864667985 | 1551718001 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 204 | n, k, x, y = [int(input()) for _ in range(4)]
ans = k * x + max(n-k, 0) * y
print(ans)
n, k, x, y = [int(input()) for _ in range(4)]
if k < n:
ans = k * x + (n-k) * y
else:
ans = n * x
print(ans)
|
s224791498 | p04011 | u488178971 | 1551146497 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 231 | # ABC 044 A - 高橋君とホテルイージー / Tak and Hotels (ABC Edit)
N = int(input())
K = int(input())
X = int(input())
Y = int(input())
if K > N:
ans = N * X
elif N > K:
ans = K * X
ans +=(N-K)* Y
print( ans ) |
s812631496 | p04011 | u465669072 | 1550851705 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 153 | n = int(input())
k = int(input())
x = int(input())
y = int(input())
for i in range(n):
if i == k+1:
ans += y;
else:
ans += x
print(ans) |
s133188405 | p04011 | u483645888 | 1550089383 | Python | Python (3.4.3) | py | Runtime Error | 74 | 3948 | 407 | n = int(input())
s = int(input())
flag = False
if s == n:
print(n+1)
exit()
def chk(b, n):
if n//b == 0:
return n
else:
return chk(b,n//b) + n%b
for b in range(2, int(n**0.5)+1):
if chk(b, n) == s:
print(b)
flag = True
exit()
for i in range(int(n**0.5), 0, -1):
b = (n-s)//i + 1
if chk(b, n) == s:
print(b)
flag = True
exit()
if flag == False:
print(-1) |
s592270711 | p04011 | u343930666 | 1549014076 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 80 | n, k, x, y = map(int, input().split())
print(min(n, k)* x + max(0, n - k) * y);
|
s673717157 | p04011 | u239981649 | 1548916222 | Python | PyPy3 (2.4.0) | py | Runtime Error | 176 | 38256 | 545 | n, a = map(int, input().split())
x = list(map(int, input().split()))
dp = [[[0]*(50*n+1) for _ in range(n+1)] for _ in range(n+1)]
for i in range(n+1):
for j in range(n+1):
for k in range(50*n+1):
if i == 0 and j == 0 and k == 0:
dp[i][j][k] = 1
elif i and k < x[i-1]:
dp[i][j][k] = dp[i-1][j][k]
elif i and j and k >= x[i-1]:
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k-x[i-1]]
ans = 0
for j in range(1, n+1):
ans += dp[n][j][a*j]
print(ans)
|
s829518400 | p04011 | u239981649 | 1548915974 | Python | PyPy3 (2.4.0) | py | Runtime Error | 175 | 38384 | 545 | N, a = map(int, input().split())
x = list(map(int, input().split()))
dp = [[[0]*(50*N+1) for _ in range(N+1)] for _ in range(N+1)]
for i in range(N+1):
for j in range(N+1):
for k in range(50*N+1):
if i == 0 and j == 0 and k == 0:
dp[i][j][k] = 1
elif i and k < x[i-1]:
dp[i][j][k] = dp[i-1][j][k]
elif i and j and k >= x[i-1]:
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k-x[i-1]]
ans = 0
for j in range(1, N+1):
ans += dp[N][j][a*j]
print(ans)
|
s386676641 | p04011 | u239981649 | 1548915799 | Python | PyPy3 (2.4.0) | py | Runtime Error | 184 | 38384 | 531 | N, a = map(int, input().split())
*x, = (map(int, input().split()))
dp = [[[0]*(50*N+1) for _ in range(N+1)] for i in range(N+1)]
for i in range(N+1):
for j in range(N+1):
for k in range(50*N+1):
if i == j == k == 0:
dp[i][j][k] = 1
elif i and k < x[i-1]:
dp[i][j][k] = dp[i-1][j][k]
elif i and j and k >= x[i-1]:
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k-x[i-1]]
ans = 0
for j in range(1, N+1):
ans += dp[N][j][a*j]
print(ans)
|
s863296932 | p04011 | u239981649 | 1548915105 | Python | PyPy3 (2.4.0) | py | Runtime Error | 192 | 38384 | 533 | N, a = map(int, input().split())
x = list(map(int, input().split()))
dp = [[[0]*(50*N+1) for _ in range(N+1)] for i in range(N+1)]
for i in range(N+1):
for j in range(N+1):
for k in range(50*N+1):
if i == j == k == 0:
dp[i][j][k] = 1
elif i and k < x[i-1]:
dp[i][j][k] = dp[i-1][j][k]
elif i and j and k >= x[i-1]:
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k-x[i-1]]
ans = 0
for j in range(1, N+1):
ans += dp[N][j][a*j]
print(ans)
|
s239633567 | p04011 | u239981649 | 1548915059 | Python | PyPy3 (2.4.0) | py | Runtime Error | 186 | 38640 | 533 | N, a = map(int, input().split())
x = list(map(int, input().split()))
dp = [[[0]*(50*N+1) for _ in range(N+1)] for _ in range(N+1)]
for i in range(N+1):
for j in range(N+1):
for k in range(50*N+1):
if i == j == k == 0:
dp[i][j][k] = 1
elif i and k < x[i-1]:
dp[i][j][k] = dp[i-1][j][k]
elif i and j and k >= x[i-1]:
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k-x[i-1]]
ans = 0
for j in range(1, N+1):
ans += dp[N][j][a*j]
print(ans)
|
s141528138 | p04011 | u239981649 | 1548915015 | Python | PyPy3 (2.4.0) | py | Runtime Error | 176 | 38512 | 533 | N, a = map(int, input().split())
x = list(map(int, input().split()))
dp = [[[0]*(50*N+1) for _ in range(N+1)] for _ in range(N+1)]
for i in range(N+1):
for j in range(N+1):
for k in range(50*N+1):
if i == j == k == 0:
dp[i][j][k] = 1
elif i and k < x[i-1]:
dp[i][j][k] = dp[i-1][j][k]
elif i and j and k >= x[i-1]:
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k-x[i-1]]
ans = 0
for j in range(1, N+1):
ans += dp[N][j][a*j]
print(ans)
|
s526628482 | p04011 | u066455063 | 1546400518 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 73 | N, K, X, Y = map(int, input().split())
print(abs(X * K + (N - K) * Y))
|
s630639862 | p04011 | u066455063 | 1546400253 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 66 | N, K, X, Y = map(int, input().split())
print(X * K + (N - K) * Y) |
s413345035 | p04011 | u239342230 | 1546279434 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 88 | n=int(input())
k=int(input())
x=int(input())
y=int(input())
print(int(x*k+y*(n-k)*(n>k)) |
s373940850 | p04011 | u916806287 | 1545908903 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 82 | N, K, X, K = [int(input()) for i in range(4)]
print(X*K+Y*(N-K if N-K > 0 else 0)) |
s685262324 | p04011 | u916806287 | 1545908730 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 64 | N, K, X, H = [int(input()) for i in range(4)]
print(X*K+Y*(N-K)) |
s340353459 | p04011 | u284854859 | 1545419616 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 685 | n,a = map(int,input().split())
x = list(map(int,input().split()))
#dp[j][k][s] = (x0...xj からk枚選んでxiの合計をsにするような選び方の総数)
dp = [[[0 for s in range(a*n+1) ] for k in range(n+1) ] for j in range(n)]
for j in range(n):
dp[j][0][0]=1
if x[0]<= a*n:
dp[j][1][x[0]] = 1
for j in range(n-1):
for k in range(n+1):
for s in range(a*n+1):
if k>j+2:
dp[j+1][k][s]=0
elif s>=x[j+1] and k>= 1:
dp[j+1][k][s]=dp[j][k][s] + dp[j][k-1][s-x[j+1]]
else:
dp[j+1][k][s]=dp[j][k][s]
res = 0
for i in range(1,n+1):
res += dp[n-1][i][a*i]
print(1) |
s799006732 | p04011 | u439392790 | 1545235524 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 108 | a=[N,K,X,Y]
for i in range(0,4):
a=a.append(input())
if N>K:
print(K*X+(N-K)*Y)
else:
print(N*X) |
s749183151 | p04011 | u439392790 | 1545235447 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 106 | a=[N,K,X,Y]
for i in range(0,4):
a=append(input())
if N>K:
print(K*X+(N-K)*Y)
else:
print(N*X) |
s875435294 | p04011 | u439392790 | 1545234911 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 86 | N,K,X,Y=map(int,input().split(/n))
if N>K:
print(K*X+(N-K)*Y)
else:
print(N*X) |
s596265073 | p04011 | u439392790 | 1545234635 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 87 | N,K,X,Y=map(int,input().split(sep))
if N>K:
print(K*X+(N-K)*Y)
else:
print(N*X) |
s906584747 | p04011 | u439392790 | 1545234602 | Python | Python (3.4.3) | py | Runtime Error | 20 | 2940 | 87 | N,K,X,Y=map(int,input().split(sep))
if N>K:
print(K*X+(N-K)*Y)
else:
print(N*X) |
s875757458 | p04011 | u439392790 | 1545234522 | Python | Python (3.4.3) | py | Runtime Error | 21 | 2940 | 91 | N,K,X,Y=map(int,input().split(sep))
if N>K:
print((K*X)+((N-K)*Y))
else:
print(N*X) |
s218274593 | p04011 | u439392790 | 1545234466 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 93 | N,K,X,Y=map(int,input().split(sep))
if N>K:
print((K*X)+((N-K)*Y))
else:
print((N*X)) |
s425531778 | p04011 | u439392790 | 1545234423 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 96 | N,K,X,Y=map(int,input().split(sep))
if N>K:
print((K*X)+((N-K)*Y))
else:
print(int(N*X)) |
s636117544 | p04011 | u439392790 | 1545234286 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 101 | N,K,X,Y=map(int,input().split(sep))
if N>K:
print(int((K*X)+((N-K)*Y)))
else:
print(int(N*X)) |
s651513937 | p04011 | u439392790 | 1545233850 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 63 | N,K,X,Y=map(int,input().split(sep))
print(int((K*X)+((N-K)*Y))) |
s703750163 | p04011 | u272377260 | 1544893066 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 69 | n, k, x, y = [int(iput()) for _ in range(4)]
print(k * x + (n-k) * y) |
s529954069 | p04011 | u371467115 | 1544682107 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | N=input()
K=input()
X=input()
Y=input()
S=K*X+(N-K)*Y
print(S) |
s191676216 | p04011 | u669382434 | 1544595821 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 72 | n,k,x,y=[int(i) for i in input().split()]
print(min(n,k)*x+max(0,n-k)*y) |
s778426599 | p04011 | u920299620 | 1543345446 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 102 | n,k,x,y=map(int,input().split())
x_day = min( [n,k] )
y_day = max( [0,n-k])
print( x*x_day + y*y_day ) |
s888810401 | p04011 | u877217629 | 1541350059 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 97 | n = input()
k = input()
x = input()
y = input()
sum = 0
sum += k * x
sum += (n-k) * y
print(sum)
|
s297199656 | p04011 | u131405882 | 1540070486 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 68 | N = input()
K = input()
X = input()
Y = input()
print(K*X+(N-K)*Y)
|
s088569678 | p04011 | u214617707 | 1536496749 | Python | PyPy3 (2.4.0) | py | Runtime Error | 162 | 38256 | 533 | n, a = map(int, input().split())
x = list(map(int, input().split()))
X = max(max(x), a)
dp = [[[0] * (n * X + 1) for i in range(n + 1)] for j in range(n + 1)]
dp[0][0][0] = 1
for i in range(1, n + 1):
for j in range(n + 1):
for s in range(n * X + 1):
if s < x[i - 1]:
dp[i][j][s] = dp[i - 1][j][s]
elif j >= 1 and x[i - 1] <= s:
dp[i][j][s] = dp[i - 1][j][s] + dp[i - 1][j - 1][s - x[i - 1]]
num = 0
for i in range(1, n + 1):
num += dp[n][i][i * a]
print(num) |
s054076753 | p04011 | u434500430 | 1533056974 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 59 | N, K, X, Y = map(int, input().split())
print(K*X + (N-K)*Y) |
s999674167 | p04011 | u622255286 | 1531368879 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 135 | n = int(raw_input())
k = int(raw_input())
x = int(raw_input())
y = int(raw_input())
if n < = k:
print(x*n)
else:
print(x*k+y*(n-k)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.