input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def main():
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N//R + 1):
for g in range(N//G + 1):
res = (N - (R*r + G*g))
if res >= 0 and res % B == 0:
ans += 1
print(ans)
if __name__ == "__main__":
mai... | def main():
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N//R + 1):
for g in range(N//G + 1):
res = (N - (R*r + G*g))
if res < 0 :
break
if res >= 0 and res % B == 0:
ans += 1
print(an... | p03048 |
import sys
input = sys.stdin.readline
r, g, b, n = list(map(int, input().split()))
cnt = 0
for i in range(int(n/r)+1):
for j in range(int(n/g)+1):
tmp = r*i + g*j
if tmp > n:
break
else:
tmp = n - tmp
if tmp%b == 0:
cnt += 1
print(c... | r, g, b, n = list(map(int, input().split()))
cnt = 0
for i in range(0, n+1, r):
for j in range(0, n+1, g):
tmp = n - (i+j)
if tmp < 0:
break
if tmp%b == 0:
cnt += 1
print(cnt)
| p03048 |
r,g,b,n=list(map(int,input().split()))
sum=0
for x in range(0,1+(3000//r)):
for y in range(0,1+(3000-x*r)//g):
if r*x+g*y<=n and (n-r*x-g*y)%b==0:
sum+=1
print(sum) | r,g,b,n=list(map(int,input().split()))
sum=0
for x in range(0,1+(n//r)):
for y in range(0,1+(n-x*r)//g):
if (n-r*x-g*y)%b==0:
sum+=1
print(sum) | p03048 |
r,g,b,n = list(map(int,input().split(" ")))
count = 0
for i in range(n+1):
for j in range(n+1):
if (i * r + j * g) <= n:
if (n - (i * r + j * g)) % b == 0:
count += 1
print(count) | r,g,b,n = list(map(int,input().split(" ")))
count = 0
for i in range(0,n+1,r):
for j in range(0,n+1,g):
if i + j <= n:
if (n - (i + j)) % b == 0:
count += 1
print(count) | p03048 |
from sys import stdin
import math
input=input=stdin.readline().rstrip().split()
for i in range(len(input)):
input[i]=int(input[i])
output=0
R=input[0]
G=input[1]
B=input[2]
N=input[3]
for r in range(math.floor(N/R)+1):
for g in range(math.floor(N/G)+1):
#for b in range(math.floor(N/B)+1):
... | from sys import stdin
import math
input=input=stdin.readline().rstrip().split()
for i in range(len(input)):
input[i]=int(input[i])
output=0
R=input[0]
G=input[1]
B=input[2]
N=input[3]
for r in range(math.floor(N/R)+1):
for g in range(math.floor(N/G)+1):
#for b in range(math.floor(N/B)+1):
... | p03048 |
R, G, B, N = list(map(int, input().split()))
score = 0
for i in range(N // R + 1):
for j in range(N // G + 1):
if N - i * R - j * G >= 0 and (N - i * R - j * G) % B == 0:
score += 1
print(score) | R, G, B, N = list(map(int, input().split()))
score = 0
for i in range(N // R + 1):
for j in range((N-i * R) // G + 1):
if N - i * R - j * G >= 0 and (N - i * R - j * G) % B == 0:
score += 1
print(score) | p03048 |
R,G,B,N = list(map(int,input().split()))
count = 0
for r in range(N//R+1):
for g in range((N-r*R)//G+1):
b = (N-R*r-G*g)/B
if b.is_integer() and b >= 0:
count += 1
print(count)
| R,G,B,N = list(map(int,input().split()))
cnt = 0
for r in range(N//R+1):
for g in range((N-R*r)//G+1):
if (N-R*r-G*g)%B == 0:
cnt += 1
print(cnt)
| p03048 |
R,G,B,N = list(map(int,input().split()))
A = [R,G,B]
A.sort()
R = A[0]
G = A[1]
B = A[2]
rmax = N//R
gmax = N//G
bmax = N//B
cnt = 0
for i in range(rmax+1):
for j in range(gmax+1):
if R*i + G*j > N:
continue
if ((N-R*i-G*j)%B == 0) and ((N-R*i-G*j)//B <= bmax):
... | R,G,B,N = list(map(int,input().split()))
A = [R,G,B]
A.sort()
R = A[2]
G = A[1]
B = A[0]
rmax = N//R
gmax = N//G
bmax = N//B
cnt = 0
if R == 1:
print(((N+1)*(N+2)//2))
exit()
for i in range(rmax+1):
for j in range(gmax+1):
if R*i + G*j > N:
continue
if ((N-... | p03048 |
r,g,b,n=list(map(int,input().split()))
ans=0
for i in range(n+1):
if r*i>n:
break
for j in range(n+1):
if r*i+g*j>n:
break
if (n-r*i-g*j)%b==0:
ans+=1
print(ans) | r,g,b,n=list(map(int,input().split()))
m=[r,g,b]
m.sort(reverse=1)
r,g,b=m[0],m[1],m[2]
ans=0
if m==[1,1,1]:
print(((n+2)*(n+1)//2))
else:
for i in range(n+1):
if r*i>n:
break
for j in range(n+1):
if r*i+g*j>n:
break
if (n-r*i-g*j)%b==0:
ans+=1
print(ans) | p03048 |
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N//R+1):
for g in range((N-r*R)//G+1):
tmp = (N-r*R-g*G)/B
if tmp.is_integer():
ans += 1
print(ans) | R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N // R + 1):
for g in range((N - r * R) // G + 1):
if (N - r * R - g * G) % B==0:
ans += 1
print(ans) | p03048 |
r,g,b,n = list(map(int,input().split()))
total = 0
ref = 0
count = 0
for i in range(n//r+1):
for j in range((n-r*i)//g+1):
total = r*i + g*j
ref = n - total
if (ref >= 0):
if ref%b == 0:
count += 1
... | r,g,b,n = list(map(int,input().split()))
total = 0
ref = 0
count = 0
for i in range(n//r+1):
for j in range((n-r*i)//g+1):
total = r*i + g*j
ref = n - total
if (ref == 0) or (ref%b == 0):
count += 1
print(count) | p03048 |
R,G,B,N = list(map(int, input().split()))
ans = 0
for r in range(N//R+1):
for g in range(N//G+1):
check = N - (R*r + G*g)
if check == 0:
# print(r, g, check//B, check)
ans += 1
elif check > 0 and check%B == 0:
# print(r, g, check//B, check)
... | R,G,B,N = list(map(int, input().split()))
ans = 0
for r in range(N//R+1):
for g in range(N//G+1):
check = N - (R*r + G*g)
if check >= 0 and check%B == 0:
ans += 1
# if check == 0:
# # print(r, g, check//B, check)
# ans += 1
# elif check... | p03048 |
R,G,B,N = list(map(int, input().split()))
ans = 0
for r in range(N//R+1):
for g in range(N//G+1):
check = (N - (R*r + G*g))/B
if float.is_integer(check) and check >= 0:
ans += 1
# if check >= 0 and check%B == 0:
# ans += 1
# if check == 0:
... | R,G,B,N = list(map(int, input().split()))
ans=0
for r in range(N//R+1):
x = N-R*r
for g in range(x//G+1):
if (x-G*g)%B==0:
ans+=1
print(ans) | p03048 |
# import time
R, G, B, N = list(map(int, input().split()))
# print(R, G, B)
i = 0
# r, g = 0, 0
# s = time.time()
for r in range(N // R + 1):
for g in range(N // G + 1):
if (N - r * R - g * G) >= 0:
b = int((N - r * R - g * G) / B)
if N - (r * R + g * G + b * B) == 0:
... | R, G, B, N = list(map(int, input().split()))
i = 0
for r in range(N // R + 1):
Rr = r * R
for g in range(N // G + 1):
Gg = g * G
Bb = N-Rr-Gg
if Bb < 0:
break
if Bb % B == 0:
i += 1
print(i)
| p03048 |
R,G,B,N = list(map(int,input().split()))
ans = 0
for r in range(N+1) :
for g in range(N+1) :
if (N - (r*R + g*G)) < 0 : continue
if (N - (r*R + g*G)) % B == 0 :
ans += 1
#print(r,g)
print(ans)
| R,G,B,N = list(map(int,input().split()))
ans = 0
for r in range(N//R + 1) :
for g in range((N-r)//G + 1) :
calc = r*R + g*G
if (N-calc) < 0 :
break
if (N-calc) % B == 0 :
ans += 1
print(ans)
| p03048 |
R,G,B,N = list(map(int,input().split()))
ans = 0
for r in range(N//R + 1) :
for g in range((N-r)//G + 1) :
calc = r*R + g*G
if N < calc :
break
if (N-calc) % B == 0 :
ans += 1
print(ans)
| R,G,B,N = list(map(int,input().split()))
ans = 0
for r in range(N//R + 1) :
for g in range((N-r)//G + 1) :
calc = r*R + g*G
if N < calc :
break
if not (N-calc) % B :
ans += 1
print(ans) | p03048 |
R, G, B, N = list(map(int, input().split()))
l = sorted([R, G, B])[::-1]
count = 0
for l0 in range(N//l[0]+1):
n0 = N-l0*l[0]
for l1 in range(n0//l[1]+1):
l2 = (n0 - l1*l[1])/l[2]
if l2%1.0 == 0 and l2 >= 0:
count += 1
print(count) | R, G, B, N = list(map(int, input().split()))
l = sorted([R, G, B])[::-1]
count = 0
for l0 in range(N//l[0]+1):
n0 = N-l0*l[0]
for l1 in range(n0//l[1]+1):
l2 = n0 - l1*l[1]
if l2%l[2] == 0 and l2 >= 0:
count += 1
print(count)
| p03048 |
R, G, B, N = list(map(int, input().split()))
rgb = []
for r in range(N//R + 1):
for g in range((N - r*R)//G + 1):
tmp = N-r*R-g*G
if tmp%B == 0:
rgb.append((r,g,tmp//B))
print((len(set(rgb)))) | R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N//R + 1):
for g in range((N - r*R)//G + 1):
tmp = N-r*R-g*G
if tmp%B == 0:
ans += 1
print(ans) | p03048 |
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N//R + 1):
for g in range((N - r*R)//G + 1):
tmp = N-r*R-g*G
if tmp%B == 0:
ans += 1
print(ans) | R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N//R + 1):
for g in range((N - r*R)//G + 1):
if (N-r*R-g*G)%B == 0:
ans += 1
print(ans) | p03048 |
R, G, B, N = list(map(int, input().split()))
LIM = 3003
ans = 0
for r in range(LIM):
for g in range(LIM):
if R * r + G * g > N:
break
Bb = N - R * r - G * g
if Bb % B == 0:
ans += 1
print(ans)
| def solve():
R, G, B, N = list(map(int, input().split()))
LIM = 3001
ans = 0
for r in range(LIM):
for g in range(LIM):
if R * r + G * g > N:
break
Bb = N - R * r - G * g
if Bb % B == 0:
ans += 1
return ans
pr... | p03048 |
R, G, B, N = list(map(int, input().split()))
ans = 0
n_iter_r = N//R + 1
n_iter_g = N//G + 1
for r in range(n_iter_r):
for g in range(n_iter_g):
if N - R*r - G*g < 0:
break
else:
if (N - R*r - G*g)%B==0:
ans += 1
print(ans) | R, G, B, N = list(map(int, input().split()))
ans = 0
n_iter_r = N//R + 1
n_iter_g = N//G + 1
for r in range(n_iter_r):
for g in range(n_iter_g):
nokori = N - R*r - G*g
if nokori < 0:
break
else:
if nokori%B==0:
ans += 1
print(ans) | p03048 |
r,g,b,n=list(map(int,input().split()))
ans=0
r,g,b=max(r,g,b),r+g+b-max(r,g,b)-min(r,g,b),min(r,g,b)
for i in range(n//r+1):
for j in range(n//g+1):
if (n-i*r-j*g)%b or (n-i*r-j*g)<0:
continue
ans+=1
print(ans)
| r,g,b,n=list(map(int,input().split()))
ans=0
for R in range(n//r+1):
for B in range((n)//b+1):
if (R*r+B*b-n)<=0 and (R*r+B*b-n)%g==0:
ans+=1
print(ans) | p03048 |
r,g,b,n = list(map(int,input().split()))
ans = 0
for i in range(n+1):
for j in range(n+1):
if r*i + g*j > n:
break
elif (n - r*i - g*j) % b == 0:
ans += 1
print(ans) | r,g,b,n = list(map(int,input().split()))
a = [0]*(n+1)
a[0] = 1
for i in [r,g,b]:
for j in range(n+1-i):
a[j+i]+=a[j]
print((a[n])) | p03048 |
R, G, B, N = [int(n) for n in input().split()]
count = 0
for r in range(N//R + 1):
for g in range((N-r*R)//G + 1):
b_ = N - (R * r + G * g)
if b_ % B == 0 and 0 <= b_ / B <= N//B:
count += 1
print(count) | R, G, B, N = [int(n) for n in input().split()]
count = 0
for r in range(N//R + 1):
for g in range((N-r*R)//G + 1):
b_ = N - (R * r + G * g)
if b_ % B == 0:
count += 1
print(count)
| p03048 |
R, G, B, N = [int(n) for n in input().split()]
count = 0
for r in range(N//R + 1):
for g in range((N-r*R)//G + 1):
b_ = N - (R * r + G * g)
if b_ % B == 0 and 0 <= b_ / B:
count += 1
print(count) | R, G, B, N = [int(n) for n in input().split()]
count = 0
for r in range(N//R + 1):
for g in range((N-r*R)//G + 1):
b_ = N - (R * r + G * g)
if b_ % B == 0 and 0 <= b_:
count += 1
print(count) | p03048 |
R, G, B, N = list(map(int, input().split()))
count = 0
for r in range(0, N//R+1):
for g in range(0, N//G+1):
# compute b
b = (N - r*R - g*G) / B
# judge
if b.is_integer() and b>=0:
count += 1
print(count) | R, G, B, N = list(map(int, input().split()))
count = 0
for r in range(N//R+1):
for g in range((N-r*R)//G+1):
if (N - r*R - g*G) % B == 0:
count += 1
print(count) | p03048 |
r, g, b, n = [int(i) for i in input().split()]
ans = 0
for i in range(n//b + 1):
for j in range((n-i*b)//g + 1):
if (n - i*b - g*j) % r == 0:
ans += 1
print(ans) | def trans(n, dp, color):
for i in range(n-color+1):
dp[i+color] += dp[i]
return dp
def main():
r, g, b, n = [int(i) for i in input().split()]
dp = [0 for i in range(n+1)]
dp[0] = 1
dp = trans(n, dp, r)
dp = trans(n, dp, g)
dp = trans(n, dp, b)
print((dp[-1]))
... | p03048 |
r, g, b, n = (int(i) for i in input().split())
rmax = int(n/r)
gmax = int(n/g)
count = 0
for i in range(0, rmax + 1):
for j in range(0, gmax + 1):
tmp = (n - r * i - g * j)
if (tmp % b == 0 and tmp >=0):
count += 1
print(count) | r, g, b, n = (int(i) for i in input().split())
rmax = int(n/r)
count = 0
for i in range(0, rmax + 1):
gmax = (n - r * i) // g
for j in range(0, gmax + 1):
tmp = n - r * i - g * j
if (tmp % b == 0 and tmp >=0):
count += 1
print(count) | p03048 |
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N + 1):
for g in range(N + 1):
v = N - r * R - g * G
if v >= 0 and v % B == 0:
ans += 1
print(ans) | def solve():
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N + 1):
for g in range(N + 1):
v = N - r * R - g * G
if v >= 0 and v % B == 0:
ans += 1
print(ans)
solve() | p03048 |
a = [0]*3
a[0],a[1],a[2],n = list(map(int,input().split()))
a.sort()
cnt = 0
for i in range(n//a[2]+1):
for j in range(n//a[1]+1):
d = n-a[2]*i-a[1]*j
if d%a[0] == 0 and d >= 0:
cnt += 1
print(cnt)
| a = [0]*3
a[0],a[1],a[2],n = list(map(int,input().split()))
a.sort()
cnt = 0
for i in range(n//a[2]+1):
for j in range((n-i*a[2])//a[1]+1):
d = n-a[2]*i-a[1]*j
if d%a[0] == 0 and d >= 0:
cnt += 1
print(cnt)
| p03048 |
def input_from_console():
r, g, b, n = list(map(int, input().split()))
return r, g, b, n
def main():
r, g, b, n = input_from_console()
counter = 0
r, g, b = sorted([r, g, b], reverse=True)
# print(r,g,b)
for i1 in reversed(list(range(int(n / r) + 1))):
n1 = n - r * i1
... |
def input_from_console():
r, g, b, n = list(map(int, input().split()))
return r, g, b, n
def main():
r, g, b, n = input_from_console()
counter = 0
r, g, b = sorted([r, g, b], reverse=True)
for i1 in reversed(list(range(int(n / r) + 1))):
n1 = n - r * i1
for i2 in... | p03048 |
r,g,b,n=list(map(int,input().split()))
cnt=0
s=0
for i in range(n//r+1):
for j in range(n//g+1):
k=(n-(i*r+j*g))//b
s=i*r+j*g+k*b
if s==n and k>=0:
cnt+=1
print(cnt) | # 2019/10/17
R,G,B,n=list(map(int,input().split()))
cnt=0
for i in range(n//R+1):
r=i*R
rem=n-r
for j in range((n-r)//G+1):
g=j*G
b=n-(r+g)
if b%B:continue
cnt+=1
print(cnt) | p03048 |
#%%
r, g, b, n = list(map(int, input().split()))
ans = 0
for i in range(n//r+2):
flag = False
for j in range(n//g+2):
tmp = n - (r*i + g*j)
if j == 0 and tmp < 0:
flag = True
if tmp < 0:
break
if tmp % b == 0:
ans += 1
if flag... | r, g, b, n = list(map(int, input().split()))
ans = 0
for i in range(n//r+2):
flag = False
for j in range(n//g+2):
tmp = n - (r*i + g*j)
if tmp < 0:
break
if tmp % b == 0:
ans += 1
print(ans) | p03048 |
*j, n = list(map(int, input().split()))
j.sort()
a, b, c = j
count = 0
for y in range(n//b+1):
for z in range((n-y*b)//c+1):
if (n - b*y - c*z) % a == 0 and (n - b*y - c*z) >= 0:
count += 1
print(count) | *j, n = list(map(int, input().split()))
j.sort()
a, b, c = j
count = 0
for y in range(n//b+1):
for z in range((n-y*b)//c+1):
if (n - b*y - c*z) % a == 0:
count += 1
print(count) | p03048 |
r, g, b, n = list(map(int, input().split()))
r_num = n // r
g_num = n // g
b_num = n // b
count = 0
for i in range(r_num+1):
r_remain = n - r * i
if r_remain == 0:
count += 1
else:
for j in range(g_num+1):
g_remain = r_remain - g * j
if g_remain == 0:
... | r, g, b, n = list(map(int, input().split()))
count = 0
for i in range(0, n+1, r):
rem = n-i
for j in range(0, rem+1, g):
if (rem-j)%b==0:
count += 1
print(count)
| p03048 |
r, g, b, n = list(map(int, input().split()))
ans = 0
for i in range(n // r + 1):
for j in range((n - i * r) // g + 1):
if (n - r * i - g * j) / b == abs(int((n - r * i - g * j) / b)):
ans += 1
print(ans) | r, g, b, n = list(map(int, input().split()))
ans = 0
for i in range(n // r + 1):
for j in range((n - r * i) // g + 1):
if (n - r * i - g * j) % b == 0 and (n - r * i - g * j) // b >= 0:
ans += 1
print(ans) | p03048 |
import sys
input = sys.stdin.readline
def main():
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N // R + 1):
gGbB = N - r * R
for g in range(gGbB // G + 1):
bB = gGbB - g * G
if bB % B == 0:
ans += 1
p... | import sys
input = sys.stdin.readline
def main():
R, G, B, N = list(map(int, input().split()))
dp = [0] * (N + 1)
dp[0] = 1
for c in [R, G, B]:
for i in range(N - c + 1):
dp[i + c] += dp[i]
ans = dp[N]
print(ans)
if __name__ == "__main__":
main()... | p03048 |
R,G,B,N =list(map(int,input().split()))
cnt =0
for r in range(N+1):
for g in range(N+1-r*R):
ball = r*R+g*G
res = N-ball
if res >=0 and res%B ==0:
cnt+=1
print(cnt)
| R,G,B,N =list(map(int,input().split()))
cnt =0
for r in range(N+1):
for g in range(N+1-r*R):
res = N- (r*R+g*G)
if res >=0 and res%B ==0:
cnt+=1
print(cnt)
| p03048 |
R,G,B,N=list(map(int,input().split()))
dp=[0]*(N+1)
dp[0]=1
for C in (R,G,B):
for i in range(len(dp)-C):
if dp[i]!=-1:
dp[i+C]=dp[i]+dp[i+C]
print((dp[N]))
| R,G,B,N=list(map(int,input().split()))
dp=[0]*(N+1)
dp[0]=1
for C in (R,G,B):
for i in range(len(dp)-C):
dp[i+C]=dp[i]+dp[i+C]
print((dp[N]))
| p03048 |
r,g,b,n=list(map(int,input().split()))
c=0
for i in range(-(-n//r)+1):
for j in range(-(-n//g)+1):
x=n-(i*r+j*g)
if x>=0 and x%b==0:
c+=1
print(c) | r,g,b,n=list(map(int,input().split()))
c=0
for i in range(-(-n//r)+1):
for j in range(-(-n//g)+1):
x=n-(i*r+j*g)
if x<0:
break
elif x%b==0:
c+=1
print(c) | p03048 |
import math
R, G, B, N = list(map(int, input().split()))
rg_lis = []
ans = 0
cr = math.ceil(N/R)
cg = math.ceil(N/G)
cb = math.ceil(N/B)
for i in range(cr + 1):
for j in range(cg + 1):
tmp = i * R + j * G
if N - tmp >= 0:
rg_lis.append(tmp)
else:
break
fo... | import math
R, G, B, N = list(map(int, input().split()))
ans = 0
cr = math.ceil(N/R)
cg = math.ceil(N/G)
cb = math.ceil(N/B)
for i in range(cr + 1):
for j in range(cg + 1):
tmp = i * R + j * G
if N - tmp >= 0 and (N - tmp) % B == 0:
ans += 1
elif N - tmp < 0:
... | p03048 |
R, G, B, N = list(map(int, input().split()))
ans = 0
for i in range(int(N / R) + 1):
for j in range(int((N - i * R) / G) + 1):
if (N - (i * R + j * G)) % B == 0 and (N - (i * R + j * G)) >= 0:
ans += 1
print(ans)
| R, G, B, N = list(map(int, input().split()))
ans = 0
for i in range(int(N / R) + 1):
for j in range(int((N - i * R) / G) + 1):
if ((N - (i * R + j * G)) % B == 0):
ans += 1
print(ans)
| p03048 |
R,G,B,N=list(map(int,input().split()))
RL=(N+R-1)//R
if RL*R>N:
RL=RL-1
cnt=0
for r in range(RL+1):
GL=(N-r*R+G-1)//G
for g in range(GL+1):
if (r*R+g*G)>N:continue
if (N-r*R-g*G)%B==0:
cnt+=1
print(cnt) | R,G,B,N=list(map(int,input().split()))
RL=(N+R-1)//R
if RL*R>N:
RL=RL-1
cnt=0
for r in range(RL+1):
GL=(N-r*R+G-1)//G
if (r*R+GL*G)>N:
GL=GL-1
for g in range(GL+1):
if (N-r*R-g*G)%B==0:
cnt+=1
print(cnt) | p03048 |
R, G, B, N = list(map(int, input().split()))
cnt = 0
for r in range(N//R+1):
for g in range(N+1):
b = (N - R * r - G * g) / B
if b.is_integer() and b >= 0:
cnt += 1
print(cnt) | R, G, B, N = list(map(int, input().split()))
cnt = 0
for r in range(N//R+1):
for g in range((N-R*r)//G+1):
if (N - R * r - G * g) % B == 0:
cnt += 1
print(cnt) | p03048 |
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
input = sys.stdin.readline
# bisect_left(lists, 3)
# bisect_right(lists, 3)
def main():
R, G, B, N = list(map(int, input().split(" ")))
ans = 0
for i in r... | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
input = sys.stdin.readline
# bisect_left(lists, 3)
# bisect_right(lists, 3)
def main():
R, G, B, N = list(map(int, input().split(" ")))
ans = 0
for i in r... | p03048 |
def b_rgb_boxes(R, G, B, N):
"""Rr+Gg+Bb=N となる整数(r, g, b)の組はいくつか。"""
ans = 0
for r in range(N + 1):
for g in range(N + 1):
t = N - R * r - G * g
if t >= 0 and (t % B == 0):
ans += 1
return ans
R, G, B, N = [int(i) for i in input().split()]
prin... | def b_rgb_boxes(R, G, B, N):
"""Rr+Gg+Bb=N となる非負整数(r, g, b)の組はいくつか。"""
# dp[i]: Rr+Gg+Bb=i となる非負整数(r, g, b)の組はいくつか
dp = [0] * (N + 1)
dp[0] = 1
for c in (R, G, B):
for i in range(N + 1):
if i + c <= N:
# Rr+Gg+Bb=i を達成する組のそれぞれに対して、
# R,G,B... | p03048 |
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
# import math
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_... |
r,g,b,n=list(map(int,input().split()))
ans=0
r,g,b=sorted([r,g,b])[::-1]
for i in range(n//r+1):
for j in range(n//g+1):
k=n-i*r-j*g
if(k<0):
break
if(k>=0 and k%b==0):
ans+=1
print(ans) | p03048 |
r, g, b, n = list(map(int, input().split()))
cnt = 0
for red in range(n // r + 1):
for green in range(n // g + 1):
blue = n - red * r - green * g
if blue >= 0 and blue % b == 0:
cnt += 1
print(cnt) | r, g, b, n = list(map(int, input().split()))
cnt = 0
for red in range(n // r + 1):
for green in range((n - r * red) // g + 1):
blue = n - red * r - green * g
if blue >= 0 and blue % b == 0:
cnt += 1
print(cnt) | p03048 |
import math
r,g,b,n=list(map(int, input().split()))
count=0
k=[]
for i in range(n+1):
for j in range(n+1):
if n-(i*g+j*r)>=0:
k.append(i*g+j*r)
else:
break
for i in range(len(k)):
if (n-k[i])%b==0:
count+=1
print(count)
... | r,g,b,n= list(map(int, input().split()))
x=n//r
y=n//g
ans=0
for i in range(x+1):
for j in range(y+1):
v=n-r*i-g*j
if v<0:
continue
else:
if v%b==0:
ans+=1
print(ans) | p03048 |
def main():
R, G, B, N = [int(x) for x in input().split()]
ct = 0
for r in range(N + 1):
for g in range(N + 1):
b = (N-R*r-G*g) / B
if b < 0: continue
if (b % 1) == 0:
ct += 1
print(ct)
if __name__ == "__main__":
main() | def main():
R, G, B, N = [int(x) for x in input().split()]
ct = 0
for r in range(N + 1):
for g in range(N + 1):
b = (N-R*r-G*g) / B
if b < 0: break
if (b % 1) == 0:
ct += 1
print(ct)
if __name__ == "__main__":
main() | p03048 |
# 2019/05/12
# diverta 2019 Programming Contest - B
# Input
r, g, b, n = list(map(int, input().split()))
cnt = 0
for i in range(n+1):
rcnt = r * i
if rcnt > n:
break
for j in range(n+1):
gcnt = g * j
rgcnt = rcnt + gcnt
if rgcnt > n:
b... | # 2019/05/12
# diverta 2019 Programming Contest - B
# Input
r, g, b, n = list(map(int, input().split()))
# Init
cnt = 0
# Calc
for i in range(n+1):
rcnt = r * i
if rcnt > n:
break
for j in range(n+1):
rgcnt = rcnt + g * j
if rgcnt > n:
break
... | p03048 |
# 2020/07/26
# diverta 2019 Programming Contest - B
# Input
r, g, b, n = list(map(int,input().split()))
ans = 0
# Calc
for ir in range(n+1):
vr = r * ir
if vr > n:
break
for ig in range(n+1):
vg = g * ig
if vg > n:
break
cb = n - r * ir - v... | # 2020/07/26
# diverta 2019 Programming Contest - B
# Input
r, g, b, n = list(map(int,input().split()))
ans = 0
# Calc
for ir in range(n+1):
vr = r * ir
if vr > n:
break
for ig in range(n+1):
vg = g * ig
if vg > n:
break
cb = n - vr - vg
... | p03048 |
# 2020/07/26
# diverta 2019 Programming Contest - B
# Input
r, g, b, n = list(map(int,input().split()))
ans = 0
# Calc
for ir in range(n+1):
vr = r * ir
if vr > n:
break
for ig in range(n+1):
vg = g * ig
if vg > n:
break
cb = n - vr - vg
... | # 2020/07/26
# diverta 2019 Programming Contest - B
# Input
r, g, b, n = list(map(int,input().split()))
ans = 0
# Calc
for ir in range(n+1):
vr = r * ir
if vr > n:
break
for ig in range(n+1):
vg = g * ig
if vg + vr > n:
break
cb = n - vr - ... | p03048 |
r, g, b, n = list(map(int, input().split()))
counter = 0
for s in range(n+1):
for t in range(n-s+1):
u = n - r*s - g*t
if u >= 0 and u % b == 0:
counter += 1
print(counter) | R, G, B, N = list(map(int, input().split()))
counter = 0
r = N // R + 1
for s in range(r):
g = (N - s*R) // G + 1
for t in range(g):
u = N - R*s - G*t
if u >= 0 and u % B == 0:
counter += 1
print(counter) | p03048 |
r,g,b,n = list(map(int, input().split()))
cnt = 0
i=0
while r*i <= n:
j=0
while (r*i+g*j) <= n:
if ( (n-(r*i+g*j)) % b ) == 0 :
cnt += 1
j += 1
i += 1
print((str(cnt))) | r,g,b,n = list(map(int, input().split()))
cnt = 0
for i in range(0, n+1, r):
if i == n:
cnt += 1
continue
for j in range(0, n-i+1, g):
if ( (n-(i+j)) % b ) == 0 :
cnt += 1
print((str(cnt))) | p03048 |
from sys import stdin
def main():
point = 0
r,g,b,n = [int(x) for x in stdin.readline().rstrip().split()]
for i in range(n//r+1):
for j in range(n//g+1):
if n-r*i-g*j >= 0:
if (n-r*i-g*j)%b == 0:
point += 1
print(point)
if __name__ ==... | from sys import stdin
def main():
point = 0
r,g,b,n = [int(x) for x in stdin.readline().rstrip().split()]
for i in range(n//r+1):
for j in range((n-r*i)//g+1):
if n-r*i-g*j >= 0:
if (n-r*i-g*j)%b == 0:
point += 1
print(point)
if __nam... | p03048 |
R, G, B, n = list(map(int, input().split()))
ans = 0
r = 0
while r*R <= n:
g = 0
while r*R + g*G <= n:
b = (n - r*R - g*G) // B
if (r*R + g*G + b*B == n) and (b >= 0):
ans += 1
g += 1
r += 1
print(ans)
| r, g, b, n = list(map(int, input().split()))
ans = 0
for i in range(0, n+1, r):
for j in range(i, n+1, g):
if (n-j) % b == 0:
ans += 1
print(ans)
| p03048 |
R, G, B, N = list(map(int, input().split()))
cnt = 0
for i in range(N//R+1):
for j in range(N//G+1):
b = N - R*i - G*j
if(b >= 0 and b%B == 0):
cnt += 1
print(cnt) | R, G, B, N = list(map(int, input().split()))
cnt = 0
for i in range(N//R+1):
for j in range(N//G+1):
b = N - R*i - G*j
if(b < 0):
break
if(b%B == 0):
cnt += 1
print(cnt) | p03048 |
MOD = 10 ** 9 + 7
fac = [1] * (10 ** 5 * 3)
def nCr(n, r):
return fac[n] * pow(fac[n - r], MOD - 2, MOD) * pow(fac[r], MOD - 2, MOD) % MOD
for i in range(len(fac) - 1):
fac[i + 1] = fac[i] * (i + 1) % MOD
b, w = list(map(int, input().split()))
n = b + w
p = [0] * n
q = [0] * n
for i in range(b... | MOD = 10 ** 9 + 7
fac = [1] * (10 ** 5 * 3)
def nCr(n, r):
return fac[n] * pow(fac[n - r], MOD - 2, MOD) * pow(fac[r], MOD - 2, MOD) % MOD
for i in range(len(fac) - 1):
fac[i + 1] = fac[i] * (i + 1) % MOD
b, w = list(map(int, input().split()))
n = b + w
p = [0] * n
q = [0] * n
for i in range(b... | p03083 |
B,W=list(map(int,input().split()))
mod=10**9+7
kaijo=[1]
Xdiv=[1]
two=pow(2,mod-2,mod)
for i in range(1,1+B+W):
kaijo.append((kaijo[-1])*i%mod)
Xdiv.append((Xdiv[-1]*two)%mod)
from collections import deque
gyaku=deque()
gyaku.append(pow(kaijo[B+W],mod-2,mod))
for i in range(B+W,0,-1):
gyaku.appe... | B,W=list(map(int,input().split()))
mod=10**9+7
kaijo={0:1}
Xdiv={0:1}
two=pow(2,mod-2,mod)
for i in range(1,1+B+W):
kaijo[i]=(kaijo[i-1]*i)%mod
Xdiv[i]=(Xdiv[i-1]*two)%mod
gyaku={B+W:pow(kaijo[B+W],mod-2,mod)}
for i in range(B+W,0,-1):
gyaku[i-1]=(gyaku[i]*i)%mod
def conb(a,b):
if a<b:return... | p03083 |
Q = 10**9+7
def getInv(N):#Qはmod
inv = [0] * (N + 1)
inv[0] = 1
inv[1] = 1
for i in range(2, N + 1):
inv[i] = (-(Q // i) * inv[Q%i]) % Q
return inv
B, W = list(map( int, input().split()))
Z = getInv(B+W)
I = [1]*(B+W+1)
for i in range(1,B+W+1):
I[i] = (I[i-1]*Z[i])%Q
F =... | Q = 10**9+7
def getInv(N):#Qはmod
inv = [0] * (N + 1)
inv[0] = 1
inv[1] = 1
for i in range(2, N + 1):
inv[i] = (-(Q // i) * inv[Q%i]) % Q
return inv
B, W = list(map( int, input().split()))
Z = getInv(B+W)
I = [1]*(B+W+1)
for i in range(1,B+W+1):
I[i] = (I[i-1]*Z[i])%Q
F =... | p03083 |
b, w = list(map(int, input().split()))
MOD = 10 ** 9 + 7
list_size = 200001
f_list = [1] * list_size
f_r_list = [1] * list_size
for i in range(list_size - 1):
f_list[i + 1] = int((f_list[i] * (i + 2)) % MOD)
def power(n, x):
if x == 1:
return n
elif x % 2 == 0:
return power(int((n * n) % MOD), i... | b, w = list(map(int, input().split()))
MOD = 10 ** 9 + 7
list_size = 200001
f_list = [1] * list_size
f_r_list = [1] * list_size
for i in range(list_size - 1):
f_list[i + 1] = int((f_list[i] * (i + 2)) % MOD)
f_r_list[-1] = pow(f_list[-1], MOD - 2, MOD)
for i in range(2, list_size + 1):
f_r_list[-i] =... | p03083 |
import sys
B, W = list(map(int, sys.stdin.readline().split()))
MOD = 10**9 + 7
L = B+W
fact = [1]*(L+1)
rfact = [1]*(L+1)
for i in range(L):
fact[i+1] = r = fact[i] * (i+1) % MOD
rfact[i+1] = pow(r, MOD-2, MOD)
rev2 = pow(2, MOD-2, MOD)
p = q = 0
base = 1
ans = ["%d\n" % rev2]
for i in rang... | import sys
B, W = list(map(int, sys.stdin.readline().split()))
MOD = 10**9 + 7
L = B+W
fact = [1]*(L+1)
rfact = [1]*(L+1)
for i in range(L):
fact[i+1] = r = fact[i] * (i+1) % MOD
rfact[i+1] = pow(r, MOD-2, MOD)
rev2 = pow(2, MOD-2, MOD)
p = q = 0
base = 1
ans = ["%d\n" % rev2]
for i in rang... | p03083 |
import sys
B, W = list(map(int, sys.stdin.readline().split()))
MOD = 10**9 + 7
L = B+W
fact = [1]*(L+1)
rfact = [1]*(L+1)
for i in range(L):
fact[i+1] = r = fact[i] * (i+1) % MOD
rfact[i+1] = pow(r, MOD-2, MOD)
rev2 = pow(2, MOD-2, MOD)
p = q = 0
L = min(B, W)
r2 = "%d\n" % rev2
for i in ... | import sys
write = sys.stdout.write
B, W = list(map(int, sys.stdin.readline().split()))
MOD = 10**9 + 7
L = B+W
fact = [1]*(L+1)
rfact = [1]*(L+1)
for i in range(L):
fact[i+1] = r = fact[i] * (i+1) % MOD
rfact[L] = pow(fact[L], MOD-2, MOD)
for i in range(L, 0, -1):
rfact[i-1] = rfact[i] * i % MOD... | p03083 |
mod=10**9+7
inv2=5*10**8+4
B,W=list(map(int,input().split()))
Factorial=[1]*(B+W+1)
for i in range(1,B+W+1):
Factorial[i]=Factorial[i-1]*(i)%mod
def power(x,y):
if y==0:
return 1
elif y==1:
return x%mod
elif y%2==0:
return power(x,y//2)**2%mod
else:
return (power(x,y//2)**2)*x... | mod=10**9+7
inv2=5*(10**8)+4
B,W=list(map(int,input().split()))
Factorial=[1]*(B+W+1)
for i in range(1,B+W+1):
Factorial[i]=Factorial[i-1]*(i)%mod
def power(x,y):
if y==0:
return 1
elif y==1:
return x%mod
elif y%2==0:
return power(x,y//2)**2%mod
else:
return (power(x,y//2)**2)... | p03083 |
B, W = list(map(int, input().split()))
mod = 1000000007
def mul(a, b):
return ((a % mod) * (b % mod)) % mod
def power(x, y):
#print(x,y)
if y == 0 : return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y/2)**2 % mod
else : return power(x, y//2)**2 * x %... | B, W = list(map(int, input().split()))
mod = 1000000007
def mul(a, b):
return ((a % mod) * (b % mod)) % mod
memo={0:1,1:2}
def power2(y):
if y in memo:
pass
elif y % 2 == 0 :
memo[y] = power2(y/2)**2 % mod
else :
memo[y] = power2(y//2)**2 * 2 % mod
return memo[y]
... | p03083 |
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def POW(x, y):
if y == 0:
return 1
elif y == 1:
return x
elif y % 2 == 0:
return POW(x, y // 2) ** 2 % MOD
else:
return POW(x, y // 2) ** 2 * x % MOD
def mod_factorial(x, y): return x * ... | import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def POW(x, y):
if y == 0:
return 1
elif y == 1:
return x
elif y % 2 == 0:
return POW(x, y // 2) ** 2 % MOD
else:
return POW(x, y // 2) ** 2 * x % MOD
def mod_factorial(x, y): return x * ... | p03083 |
MOD = 10**9+7
fact = [1]
invfact = [1]
for i in range(1,2*10**5 + 100):
fact.append((fact[i-1] * i) % MOD)
invI = pow(i,MOD-2,MOD)
invfact.append((invfact[i-1] * invI) % MOD)
B,W = list(map(int,input().split()))
N = B+W
pcSum = [1 for _ in range(B+W+1)]
qcSum = [1 for _ in range(B+W+1)]
def m... | MOD = 10**9+7
fact = [1]
invfact = [1]
for i in range(1,2*10**5 + 100):
fact.append((fact[i-1] * i) % MOD)
invI = pow(i,MOD-2,MOD)
invfact.append((invfact[i-1] * invI) % MOD)
B,W = list(map(int,input().split()))
N = B+W
pcSum = [1 for _ in range(B+W+1)]
qcSum = [1 for _ in range(B+W+1)]
def m... | p03083 |
def cmb(n, r, mod):#コンビネーションの高速計算
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N = 2*10**5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod ... | def cmb(n, r, mod):#コンビネーションの高速計算
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N = 2*10**5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod ... | p03083 |
from functools import lru_cache
import sys
sys.setrecursionlimit(2*10**5)
# 入力
B, W = list(map(int, input().split()))
# ModInt定義
MOD = 10**9 + 7
class ModInt:
def __init__(self, x):
self.x = x % MOD
def __str__(self):
return str(self.x)
def __repr__(self):
... | # 入力
B, W = list(map(int, input().split()))
# ModInt定義
MOD = 10**9 + 7
class ModInt:
def __init__(self, x):
self.x = x % MOD
def __str__(self):
return str(self.x)
def __repr__(self):
return str(self.x)
def __add__(self, other):
return (
... | p03083 |
B,W = list(map(int, input().split()))
N = B+W
factorial = [1]
for i in range(N+1):
factorial.append( factorial[-1] * (i+1))
# print(factorial)
mod = 10**9+7
de_factorial = [0] * (N+1)
de_factorial[N] = pow( factorial[N] , mod-2, mod )
for i in range( N, 0, -1):
de_factorial[i-1] = de_factori... | B,W = list(map(int, input().split()))
N = B+W
mod = 10**9+7
factorial = [1]
for i in range(N+1):
factorial.append( factorial[-1] * (i+1) % mod)
# print(factorial)
de_factorial = [0] * (N+1)
de_factorial[N] = pow( factorial[N] , mod-2, mod )
for i in range( N, 0, -1):
de_factorial[i-1] = de... | p03083 |
B, W = list(map(int,input().split()))
Mod = 10**9+7
magick = 500000004
inv_t = [0]+[1]
for i in range(2,B+W+1):
inv_t += [inv_t[Mod % i] * (Mod - int(Mod / i)) % Mod]
consts_B, consts_W = [0]*(B-1)+ [1], [0]*(W-1)+[1]
for i in range(B+W):
if i >= B: consts_B += [consts_B[-1]*(i)*inv_t[i-B+1]%Mod]
if... | B, W = list(map(int,input().split()))
Mod = 10**9+7
magick = 500000004
inv_t = [0]+[1]
inv_2 = [0]+[magick]
for i in range(2,B+W+1):
inv_t += [inv_t[Mod % i] * (Mod - int(Mod / i)) % Mod]
inv_2 += [inv_2[-1]*magick % Mod]
consts_B, consts_W = [0]*(B-1)+ [1], [0]*(W-1)+[1]
for i in range(B+W):
if i >... | p03083 |
from fractions import Fraction
B, W = list(map(int, input().split()))
def ExtendedEuclidianAlgorithms(a, b):
"""
返り値: 自然数a, bの最小公倍数d, ax+by=gcd(a, b)を満たす(x, y)が、
(d, x, y)のtuple
d = 1ならxはaの逆元(inverse element)
"""
d, c1 = a, b
x0, x1 = 1, 0
y0, y1 = 0, 1
while c1 != 0:
... | from fractions import Fraction
B, W = list(map(int, input().split()))
def ExtendedEuclidianAlgorithms(a, b):
"""
返り値: 自然数a, bの最小公倍数d, ax+by=gcd(a, b)を満たす(x, y)が、
(d, x, y)のtuple
d = 1ならxはaの逆元(inverse element)
"""
d, c1 = a, b
x0, x1 = 1, 0
y0, y1 = 0, 1
while c1 != 0:
... | p03083 |
b,w=list(map(int,input().split()))
dp=[0]*(b+w)
dp[0]=1/2
mod=pow(10,9)+7
def cmb(n,r,mod):
if (r<0 or r>n):
return 0
r=min(r,n-r)
return g1[n]*g2[r]*g2[n-r]%mod
g1=[1,1] # g1[i]=i! % mod :階乗
g2=[1,1] # g2[i]=(i!)^(-1) % mod :階乗の逆元
inverse=[0,1]
for i in range(2,b+w+1):
g1.append((g1[-1]*i)%m... | b,w=list(map(int,input().split()))
dp=[0]*(b+w)
dp[0]=1/2
mod=pow(10,9)+7
def cmb(n,r,mod):
if (r<0 or r>n):
return 0
r=min(r,n-r)
return g1[n]*g2[r]*g2[n-r]%mod
g1=[1,1] # g1[i]=i! % mod :階乗
g2=[1,1] # g2[i]=(i!)^(-1) % mod :階乗の逆元
inverse=[0,1]
for i in range(2,b+w+1):
g1.append((g1[-1]*i)%m... | p03083 |
U = 2*10**5
MOD = 10**9+7
fact = [1]*(U+1)
fact_inv = [1]*(U+1)
two = [1]*(U+1)
two_inv = [1]*(U+1)
for i in range(1,U+1):
fact[i] = (fact[i-1]*i)%MOD
two[i] = (two[i-1]*2)%MOD
fact_inv[U] = pow(fact[U], MOD-2, MOD)
two_inv[U] = pow(two[U], MOD-2, MOD)
for i in range(U,0,-1):
fact_inv[i... | def main():
U = 2*10**5
MOD = 10**9+7
fact = [1]*(U+1)
fact_inv = [1]*(U+1)
two = [1]*(U+1)
two_inv = [1]*(U+1)
for i in range(1,U+1):
fact[i] = (fact[i-1]*i)%MOD
two[i] = (two[i-1]*2)%MOD
fact_inv[U] = pow(fact[U], MOD-2, MOD)
two_inv[U] = pow(two[U], MOD-2, MOD)
for... | p03083 |
U = 2*10**5
MOD = 10**9+7
fact = [1]*(U+1)
fact_inv = [1]*(U+1)
two = [1]*(U+1)
two_inv = [1]*(U+1)
for i in range(1,U+1):
fact[i] = (fact[i-1]*i)%MOD
two[i] = (two[i-1]*2)%MOD
fact_inv[U] = pow(fact[U], MOD-2, MOD)
two_inv[U] = pow(two[U], MOD-2, MOD)
for i in range(U,0,-1):
fact_inv[i... | def main():
U = 2*10**5
MOD = 10**9+7
fact = [1]*(U+1)
fact_inv = [1]*(U+1)
two = [1]*(U+1)
two_inv = [1]*(U+1)
for i in range(1,U+1):
fact[i] = (fact[i-1]*i)%MOD
two[i] = (two[i-1]*2)%MOD
fact_inv[U] = pow(fact[U], MOD-2, MOD)
two_inv[U] = pow(two[U], MOD-2, MOD)
for... | p03083 |
B, W = list(map(int, input().split()))
MOD = 10**9+7
facts = [1,1]
invs = [1,1]
invfacts = [1,1]
for ind in range(1, B+W):
i = ind+1
facts += [ facts[-1]*i % MOD ]
invs += [ -(MOD//i)*invs[MOD%i] % MOD ]
invfacts += [ invfacts[-1]*invs[i] % MOD ]
y_pi = 0 #i回目までにBを食べ尽くした確率piの分子
y_qi = 0 #... | B, W = list(map(int, input().split()))
MOD = 10**9+7
facts = [1,1] #階乗
invs = [1,1] #整数の逆元
invfacts = [1,1] #階乗の逆元
for ind in range(1, B+W):
i = ind+1
facts.append(facts[-1]*i % MOD)
invs.append( -(MOD//i)*invs[MOD%i] % MOD )
invfacts.append( invfacts[-1]*invs[i] % MOD )
def Comb(n, r, M... | p03083 |
from collections import Counter
from itertools import product
N, W = list(map(int, input().split()))
items = {}
weight = []
for i in range(N):
w, v = list(map(int, input().split()))
weight.append(w)
if items.get(w, None) is None:
items[w] = []
items[w].append(v)
items[w]... | N, W = list(map(int, input().split()))
w, v = [], []
for _ in range(N):
a, b = list(map(int, input().split()))
w.append(a)
v.append(b)
memo = {}
def nap(i, j):
if i == N:
return 0
if (i, j) in memo:
return memo[i, j]
elif j < w[i]:
temp = nap(i+... | p03732 |
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
mod = 10**9+7
N,W = list(map(int,input().split()))
w = [0 for i in range(N)]
v = [0 for i in range(N)]
for i in range(N):
w[i],v[i] = list(map(int,input().split()))
dp... | # encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
mod = 10**9+7
N,W = list(map(int,input().split()))
w = [0 for i in range(N)]
v = [0 for i in range(N)]
for i in range(N):
w[i],v[i] = list(map(int,input().split()))
w_... | p03732 |
import sys
input = sys.stdin.readline
def read_values():
return list(map(int, input().split()))
def read_list():
return list(read_values())
def func(N, mod):
F = [1]
for i in range(1, N + 1):
F.append(F[-1] * i % mod)
return F
INV = {}
def inv(a, mod):
... | import sys
input = sys.stdin.readline
def read_values():
return list(map(int, input().split()))
def read_list():
return list(read_values())
def func(N, mod):
F = [1]
for i in range(1, N + 1):
F.append(F[-1] * i % mod)
return F
INV = {}
def inv(a, mod):
... | p03732 |
N, W = list(map(int, input().split()))
w, v = [], []
for _ in range(N):
x, y = list(map(int, input().split()))
w.append(x)
v.append(y)
from collections import defaultdict
dp = defaultdict(lambda: 0)
dp[0,0] = 0
for i in range(N):
for weight in range(W+1):
if weight >= w[i]:
... | N, W = list(map(int, input().split()))
Items = [tuple(map(int, input().split())) for _ in range(N)]
from collections import defaultdict as dd
Bag = dd(lambda:0)
Bag[0] = 0
for w,v in Items:
temp = [(key+w,Bag[key]+v) for key in Bag if key + w <= W]
for key,value in temp:
Bag[key] = max(Bag[key],... | p03732 |
N, W = list(map(int, input().split()))
wv = [list(map(int, input().split())) for i in range(N)]
v = [[] for i in range(4)]
standard = wv[0][0]
for wi, vi in wv:
plus = wi - standard
v[plus].append(vi)
for i in range(4):
v[i].sort(reverse=True)
for j in range(len(v[i])-1):
v[i][j+1]... | from itertools import accumulate
N, W = list(map(int, input().split()))
w0, w1, w2, w3 = [], [], [], []
base_w = -1
for i in range(N):
w, v = list(map(int, input().split()))
if base_w < 0:
base_w = w
# 重みごとの箱にいれる
w -= base_w
if w == 0:
w0.append(v)
elif w == 1:
... | p03732 |
# ABC060D - Simple Knapsack (ARC073D)
# exhaustive search
from itertools import accumulate
def main():
N, W, *A = list(map(int, open(0).read().split()))
V, x = [[] for _ in range(4)], A[0] # x: w1 (W1 ≤ wi ≤ w1 + 3)
for i in range(0, 2 * N, 2): # group by weight
w, v = A[i : i + 2]
... | # ABC060D - Simple Knapsack (ARC073D)
from itertools import accumulate as acc
def main():
N, W, *A = list(map(int, open(0).read().split()))
V, x = [[] for _ in range(4)], A[0] # x: w1 (W1 ≤ wi ≤ w1 + 3)
for w, v in zip(*[iter(A)] * 2): # group by weight
V[w - x].append(v)
for i in r... | p03732 |
def resolve():
N, W = list(map(int, input().split()))
WV = [[0, 0]]+[list(map(int, input().split())) for _ in range(N)]
dp = [[0 for _ in range(W+1)] for ___ in range(N+1)]
for i in range(1, N+1):
for j in range(W+1):
w, v = WV[i]
if j >= w:
... | def resolve():
N, W = list(map(int, input().split()))
WV = [list(map(int, input().split())) for _ in range(N)]
wbase = WV[0][0]
d = {
wbase: [0],
wbase+1: [0],
wbase+2: [0],
wbase+3: [0],
}
for w, v in WV:
d[w].append(v)
for v in list(d.val... | p03732 |
import sys
def input(): return sys.stdin.readline().strip()
offset = 10**10
def main():
N, W = list(map(int, input().split()))
w0, v0 = list(map(int, input().split()))
item = [0, w0 * offset + v0]
weight_sum, value_sum = w0, v0
for _ in range(1, N):
w, v = list(map(int, input().sp... | import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()
offset = 10**10
def main():
"""
ナップサックで重さを飛び飛びにしてdpを軽くしなくても、
そもそも重さが４パターンだから全探索で解けたのか。。。。。。
"""
N, W = list(map(int, input().split()))
item = [[] for _ in range(4)]
length = [1, 0, 0, 0]... | p03732 |
def main():
N, W = list(map(int, input().split()))
w1 = [0, 0]
w2 = [0, 0]
w3 = [0, 0]
w4 = [0, 0]
v1 = []
v2 = []
v3 = []
v4 = []
i = 0
while i < N:
w, v = list(map(int, input().split()))
if i == 0 or w == w1[0]:
w1[0] = w
... | def main():
N, W = list(map(int, input().split()))
w1 = [0, 0]
w2 = [0, 0]
w3 = [0, 0]
w4 = [0, 0]
v1 = []
v2 = []
v3 = []
v4 = []
i = 0
while i < N:
w, v = list(map(int, input().split()))
if i == 0 or w == w1[0]:
w1[0] = w
... | p03732 |
#060_D
n, w_ = list(map(int, input().split()))
w, v = [], []
for _ in range(n):
a, b = list(map(int, input().split()))
w.append(a)
v.append(b)
dp = [[0 for _ in range(w_+1)] for _ in range(n+1)]
for i in range(1, n+1):
for j in range(1, w_+1):
if j < w[i-1]:
dp[i][... | #060_D
n, W = list(map(int, input().split()))
w1, w2, w3, w4 = [], [], [], []
w, v = list(map(int, input().split()))
w1.append(v)
for _ in range(n-1):
a, b = list(map(int, input().split()))
if a == w: w1.append(b)
if a == w+1: w2.append(b)
if a == w+2: w3.append(b)
if a == w+3: w4.append(b... | p03732 |
from itertools import accumulate
N,W = list(map(int,input().split()))
w0,v0 = list(map(int,input().split()))
W0,W1,W2,W3 = [],[],[],[]
W0.append(v0)
for i in range(1,N):
w,v = list(map(int,input().split()))
if w == w0:
W0.append(v)
elif w == w0+1:
W1.append(v)
elif w == w0+2... | from itertools import accumulate
N,W = list(map(int,input().split()))
V = [[] for _ in range(4)]
w0 = 0
for i in range(N):
w,v = list(map(int,input().split()))
if i==0:
V[0].append(v)
w0 = w
else:
V[w - w0].append(v)
# 降順ソート
for i in range(4):
V[i].sort(reverse=Tru... | p03732 |
def solve(N, W, WVs):
Ws = {}
# print(N, ",", W, ",", WVs)
for w, v in WVs:
Ws.setdefault(w, []).append(v)
for w, v in list(Ws.items()):
Ws[w] = sorted(v, key=lambda x: -x)
wkeys = sorted(Ws.keys())
m = 0
for n1 in range(N + 1):
w1 = n1 * wkeys[0]
... | def solve(N, W, WVs):
Ws = {}
for w, v in WVs:
Ws.setdefault(w, []).append(v)
for w, v in list(Ws.items()):
Ws[w] = sorted(v, key=lambda x: -x)
wkeys = sorted(Ws.keys())
m = 0
for n1 in range(N + 1):
w1 = n1 * wkeys[0]
if w1 > W:
break
... | p03732 |
N, W = list(map(int, input().split()))
items = [tuple(map(int, input().split())) for i in range(N)]
w0 = items[0][0]
sizeX = min(W, sum([items[i][0] for i in range(N)])) // w0 + 1
sizeY = min(w0, 3 * (N - 1) + 1)
memo = [[[-1 for y in range(sizeY)] for x in range(sizeX)] for i in range(N + 1)]
memo[0][0][0] =... | N, W = list(map(int, input().split()))
items = [tuple(map(int, input().split())) for i in range(N)]
memo = [{} for i in range(N + 1)]
memo[0] = {0: 0}
for i, (wi, vi) in enumerate(items):
for w, v in list(memo[i].items()):
if w + wi <= W:
memo[i + 1][w + wi] = max(memo[i + 1].get(w ... | p03732 |
N,W = list(map(int, input().split()))
knap = [0 for i in range(W+1)]
mono = []
for i in range(N):
w,v = list(map(int, input().split()))
mono.append([w,v])
mono.sort(key = lambda x:x[1], reverse=True)
for w, v in mono:
for i in range(w, W+1)[::-1]:
if knap[i] < knap[i-w] + v:
... | from itertools import accumulate
n,w=list(map(int, input().split()))
items = {}
for _ in range(n):
u,v = list(map(int, input().split()))
if u not in items:
items[u] = []
items[u].append(v)
cost = 0
acc = []
minkey = min(items.keys())
for i in range(4):
if minkey + i in items:
... | p03732 |
#coding:utf-8
from collections import defaultdict
import itertools
if __name__ == "__main__":
N, W = list(map(int, input().split(" ")))
items = defaultdict(list)
item_num = defaultdict(int)
for i in range(N):
w, v = list(map(int, input().split(" ")))
if i == 0:
... | #coding:utf-8
N, W = list(map(int, input().split(" ")))
items = [tuple(map(int, input().split(" "))) for _ in range(N)]
dic = {}
def search(i, j):
if i == N:
return 0
if (i, j) not in dic:
dic[(i, j)] = search(i + 1, j)
w, v = items[i]
if j + w <= W:
di... | p03732 |
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
AtoZ = [chr(i) for i in range(65,65+26)]
atoz = [chr(i) for i in range(97,97+26)]
N,W = list(map(int,(input().split())))
ww = []
vv = []
for i in range(N):
w,v ... | from collections import defaultdict
import sys,heapq,bisect,math,itertools,string
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
AtoZ = [chr(i) for i in range(65,65+26)]
atoz = [chr(i) for i in range(97,97+26)]
N,W = list(map(int,(input().split())))
wv = [[] for i in range(4)]
w,v = list(m... | p03732 |
from sys import stdin
from itertools import accumulate
readline = stdin.readline
N, W = list(map(int, input().split()))
vs = [[] for _ in range(4)]
w, v = list(map(int, input().split()))
w1 = w
vs[0].append(v)
for _ in range(N - 1):
w, v = list(map(int, input().split()))
vs[w - w1].append(v)
for ... | from sys import stdin
from itertools import accumulate
readline = stdin.readline
N, W = list(map(int, input().split()))
vs = [[] for _ in range(4)]
w, v = list(map(int, input().split()))
w1 = w
vs[0].append(v)
for _ in range(N - 1):
w, v = list(map(int, input().split()))
vs[w - w1].append(v)
for ... | p03732 |
from collections import defaultdict
N, W = list(map(int, input().split()))
MAX_NUM = []
len_weights = 0
def dfs(nums):
if len(nums) == len_weights:
sum_w = 0
value = 0
for i in range(len_weights):
sum_w += weights[i] * nums[i]
value += sum(items[weights[... | from collections import defaultdict
N, W = list(map(int, input().split()))
MAX_NUM = []
len_weights = 0
def dfs(nums):
if len(nums) == len_weights:
sum_w = 0
value = 0
for i in range(len_weights):
sum_w += weights[i] * nums[i]
if nums[i] >= 1:
... | p03732 |
from collections import defaultdict
def main():
n, w = list(map(int, input().split()))
items = [list(map(int, input().split())) for _ in range(n)]
DP = defaultdict(int)
DP[0] = 0
for weight, value in items:
exists = list(DP.items())
for key, total in exists:
... | from collections import defaultdict
def main():
n, w = list(map(int, input().split()))
items = [list(map(int, input().split())) for _ in range(n)]
DP = defaultdict(int)
DP[0] = 0
for weight, value in items:
exists = list(DP.items())
for key, total in exists:
... | p03732 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
from collections import defaultdict
def resolve():
n,W=list(map(int,input().split()))
WV=[tuple(map(int,input().split())) for _ in range(n)]
weight=set()
for i in range(n+1... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,W=list(map(int,input().split()))
w0,v=list(map(int,input().split()))
V=[[] for _ in range(4)]
V[0].append(v)
for _ in range(n-1):
w,v=list(map(int... | p03732 |
N, WW = list(map(int, input().split()))
l = [list(map(int, input().split())) for _ in range(N)]
W, V = list(zip(*l))
M = [{} for i in range(N + 1)]
def cal(i, w):
if w in M[i]:
return M[i][w]
if i == N:
v = 0
elif w < W[i]:
v = cal(i + 1, w)
else:
v = max(cal(i + 1, w), cal(i + 1, w ... | N, W = list(map(int, input().split()))
d = {0:0}
for _ in range(N):
w, v = list(map(int, input().split()))
for dw, dv in list(d.copy().items()):
if dw + w <= W:
d[dw + w] = max(d.get(dw + w, 0), dv + v)
print((max(d.values()))) | p03732 |
N,W=list(map(int,input().split()));d={0:0}
for _ in [0]*N:
w,v=list(map(int,input().split()))
for x,y in list(d.copy().items()):
if x+w<=W:d[x+w]=max(d.get(x+w,0),y+v)
print((max(d.values()))) | N,W,*A=list(map(int,open(0).read().split()));d={0:0}
for w,v in zip(A[::2],A[1::2]):
for x,y in list(d.copy().items()):
if x+w<=W:d[x+w]=max(d.get(x+w,0),y+v)
print((max(d.values()))) | p03732 |
N,W,*A=list(map(int,open(0).read().split()));d={0:0}
for w,v in zip(A[::2],A[1::2]):
for x,y in list(d.copy().items()):
if x+w<=W:d[x+w]=max(d.get(x+w,0),y+v)
print((max(d.values()))) | N,W,*A=list(map(int,open(0).read().split()));d={0:0}
while A:
v,w=A.pop(),A.pop()
for x,y in list(d.copy().items()):
if x+w<=W:d[x+w]=max(d.get(x+w,0),y+v)
print((max(d.values()))) | p03732 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.