input
stringlengths 20
127k
| target
stringlengths 20
119k
| problem_id
stringlengths 6
6
|
|---|---|---|
r,g,b,n = list(map(int, input().split()))
ans = 0
for i in range(n//r+1):
t = n - r*i
for j in range(t//g+1):
if (n - (r*i + g*j)) % b == 0: ans += 1
print(ans)
|
r,g,b,n = list(map(int, input().split()))
ans = 0
for i in range(n//r+1):
t = n - r*i
for j in range(t//g+1):
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(3001):
for g in range(3001):
if (R*r+G*g) > N:
break
if (N-(R*r+G*g)) % B == 0 or R*r+G*g == N:
ans += 1
print(ans)
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(3001):
for g in range(3001):
tmp = (R*r+G*g)
if tmp > N:
break
if (N-tmp) % B == 0 or tmp == N:
ans += 1
print(ans)
|
p03048
|
R, G, B, N = list(map(int,input().split()))
cnt = 0
for r in range(N//R + 1):
for g in range(N//G + 1):
x = N - R*r - G*g
if x >= 0 and x % 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):
x = N - R*r - G*g
if x >= 0 and x % B == 0:
cnt += 1
print(cnt)
|
p03048
|
r, g, b, n = list(map(int, input().split()))
count=0
for i in range(0,(int)(n/r)+1):
for j in range(0, (int)(n/g)+1):
if (n-i*r-j*g)%b == 0 and (n-i*r-j*g)>=0:
count+=1
print(count)
|
r, g, b, n = list(map(int, input().split()))
count=0
for i in range(0,(int)(n/r)+1):
for j in range(0, (int)((n-i*r)/g)+1):
v = n-i*r-j*g
if v%b == 0 and v>=0:
count+=1
print(count)
|
p03048
|
a,b,c,n=list(map(int,input().split()))
q=0
for i in range(n//a+1):
for j in range((n-a*i)//b+1):
t=n-i*a-j*b
if t%c==0and t//c>=0:
q+=1
print(q)
|
a,b,c,n=list(map(int,input().split()))
q=0
for i in range(n//a+1):
for j in range((n-a*i)//b+1):
t=n-i*a-j*b
if t%c==0:
q+=1
print(q)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
count = 0
for i in range(N//R+1):
for j in range(N//G+1):
if (N - R*i - G*j) % B == 0 and (N-R*i-G*j)>=0:
count += 1
print(count)
|
R, G, B, N = list(map(int, input().split()))
count = 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:
count += 1
print(count)
|
p03048
|
R, G, B, N = list(map(int,input().split()))
cnt = 0
for r in range(0,N//R+1):
for g in range(0,(N-R*r)//G+1):
if (N - (R*r + G*g)) % B == 0 and N - (R*r + G*g) >= 0:
#print(r,g,(N-r-g))
cnt += 1
print(cnt)
|
R, G, B, N = list(map(int,input().split()))
cnt = 0
for r in range(0,N//R+1):
for g in range(0,(N-R*r)//G+1):
if (N - R*r - G*g) % B == 0 :
#print(r,g,(N-r-g))
cnt += 1
print(cnt)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
num = 0
for i in range(N + 1):
for j in range(N + 1):
if N - R * i - G * j < 0:
break
if 0 <= N - R * i - G * j and (N - R * i - G * j) % B == 0:
num += 1
print(num)
|
R, G, B, N = list(map(int, input().split()))
num = 0
for i in range(N + 1):
if N - R * i < 0:
break
for j in range(N + 1):
if N - R * i - G * j < 0:
break
if 0 <= N - R * i - G * j and (N - R * i - G * j) % B == 0:
num += 1
print(num)
|
p03048
|
from bisect import bisect_left
def index(a, x):
i = bisect_left(a,x)
if i != len(a) and a[i] == x:
return True
return False
R, G, B, N = list(map(int,input().split()))
listB = [ i for i in range(N//B+1) ]
cnt = 0
for r in range(N//R+1):
for g in range((N-R*r)//G+1):
v = R*r+G*g
if (N - v)%B == 0 and index(listB,(N - v)//B):
cnt += 1
print(cnt)
|
*j, N = list(map(int,input().split()))
j.sort()
a,b,c = j
cnt = 0
for r in range(N//b+1):
for g in range((N-b*r)//c+1):
v = b*r+c*g
if (N-v)%a == 0:
cnt += 1
print(cnt)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
count = 0
for i in range(N // R + 1):
tmp = N - i * R
for j in range(N // G + 1):
tmp2 = tmp - j * G
if tmp2 < 0:
continue
if tmp2 % B == 0:
count += 1
print(count)
|
R, G, B, N = list(map(int, input().split()))
count = 0
tmp1 = N + R
for i in range(N // R + 1):
tmp1 -= R
tmp2 = tmp1 + G
for j in range(N // G + 1):
tmp2 -= G
if tmp2 < 0:
continue
if tmp2 % B == 0:
count += 1
print(count)
|
p03048
|
data = list(map(int, input().split()))
R = data[0]
G = data[1]
B = data[2]
N = data[3]
# R * a + G * b + B * c
a = N // R + 1
b = N // G + 1
# c = N // B + 1
res = 0
for Ri in range(a):
Rx = Ri * R
if Rx > N:
break
for Gi in range(b):
Gx = Gi * G
if Rx + Gx > N:
break
if (N - Rx - Gx) % B == 0:
res = res + 1
print(res)
|
data = list(map(int, input().split()))
R = data[0]
G = data[1]
B = data[2]
N = data[3]
# R * a + G * b + B * c
a = N // R + 1
b = N // G + 1
# c = N // B + 1
res = 0
def check(Ri):
global res
Rx = Ri * R
if Rx > N:
return
for Gi in range(b):
Gx = Gi * G
if Rx + Gx > N:
break
if (N - Rx - Gx) % B == 0:
res = res + 1
[check(Ri) for Ri in range(a)]
print(res)
|
p03048
|
R, G, B, N = list(map(int,input().split()))
count = 0
for i in range (N//R+1):
for j in range (N//G+1):
if (N - i*R - j*G)%B == 0 and (N - i*R - j*G)>=0:
count += 1
print(count)
|
R, G, B, N = list(map(int,input().split()))
count = 0
i_range = N//R+1
j_range = N//G+1
for i in range (N//R+1):
for j in range (N//G+1):
if (N - i*R - j*G)%B == 0 and (N - i*R - j*G)>=0:
count += 1
print(count)
|
p03048
|
# -*- coding: utf-8 -*-
def main():
r, g, b, n = list(map(int, input().split()))
comb = list()
ans = 0
for i in range(3000 + 1):
for j in range(3000 + 1):
comb.append(r * i + g * j)
for c in comb:
if (n - c) >= 0 and (n - c) % b == 0:
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
# -*- coding: utf-8 -*-
def main():
r, g, b, n = list(map(int, input().split()))
ans = 0
for i in range(3000 + 1):
for j in range(3000 + 1):
diff = n - (r * i + g * j)
if diff >= 0 and (diff % b == 0):
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N+1):
if N < R*r:
break
for g in range(N+1):
if N < R*r + G*g:
break
if (N - R*r - G*g) % B == 0:
ans += 1
print(ans)
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(0, N+1, R):
for g in range(0, N-r+1, G):
if (N - r - g) % B == 0:
ans += 1
print(ans)
|
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):
k = (n-i*r-j*g)
if k%b == 0 and k >= 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-i*r)//g+1):
k = (n-i*r-j*g)
if k%b == 0 and k >= 0:
c += 1
print(c)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
cnt = 0
for r in range(N//R+1):
Rr = R*r
for g in range((N-Rr)//G+1):
if (N-(R*r + G*g)) % B == 0:
cnt += 1
print(cnt)
|
R, G, B, N = list(map(int, input().split()))
cnt = 0
for r in range(N//R+1):
Rr = R*r
for g in range((N-Rr)//G+1):
if (N-(Rr + G*g)) % B == 0:
cnt += 1
print(cnt)
|
p03048
|
R,G,B,N=[int(c) for c in input().split()]
C=sorted([R,G,B])
if(C==[1,1,1]):
print(((N+2)*(N+1)//2))
count=0
for i in range(N//C[2]+1):
for j in range(N//C[1]+1):
if(N-C[2]*i-C[1]*j>=0 and (N-C[2]*i-C[1]*j)%C[0]==0):
count+=1
print(count)
|
R,G,B,N=[int(c) for c in input().split()]
C=sorted([R,G,B])
if(C==[1,1,1]):
print(((N+2)*(N+1)//2))
exit()
count=0
for i in range(N//C[2]+1):
for j in range(N//C[1]+1):
if(N-C[2]*i-C[1]*j>=0 and (N-C[2]*i-C[1]*j)%C[0]==0):
count+=1
print(count)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N//R+1):
if R * r > N: continue
for g in range((N-r*R)//G+1):
if R*r + G*g > N: break
if (N - R*r - G*g) % B == 0:
ans += 1
print(ans)
|
R, G, B, N = list(map(int, input().split()))
ans = 0
a = max(R, G, B)
if a == R:
b = max(G, B)
elif a == G:
b = max(B, R)
else:
b = max(R, G)
c = min(R, G, B)
for i in range(N//a+1):
for j in range((N-a*i)//b+1):
if ((N-a*i)-b*j)%c == 0:
ans += 1
print(ans)
|
p03048
|
import itertools
R,G,B,n = list(map(int, input().split()))
ans = 0
for r in range(n//R+1):
if R*r > n: break
for g in range(n//G+1):
ball = R*r + G*g
if ball > n or (n-ball)%B!=0: continue
ans += 1
print(ans)
|
R,G,B,n = list(map(int, input().split()))
ans = 0
for r in range(n//R+1):
if R*r > n: break
for g in range(n//G+1):
ball = R*r + G*g
if ball > n: break
if (n-ball)%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):
r,g = i*R, j*G
if (N-r-g)%B!=0 or r+g > N: continue
cnt += 1
print(cnt)
|
R,G,B,N = list(map(int, input().split()))
cnt = 0
for r in range(0,N+1,R):
for g in range(0,N+1,G):
if r+g > N:break
if (N-r-g)%B==0: cnt += 1
print(cnt)
|
p03048
|
r,g,b,n=list(map(int,input().split()))
count=0
for ri in range(int(n/r)+1):
for gi in range(int(n/g)+1):
sumc=n-ri*r-gi*g
if sumc<0:
break
if sumc%b==0 and sumc/b>=0:
count+=1
print(count)
|
r,g,b,n=list(map(int,input().split()))
count=0
for ri in range(int(n/r)+1):
for gi in range(int((n-ri*r)/g)+1):
sumc=n-ri*r-gi*g
if sumc<0:
break
if sumc%b==0:
count+=1
print(count)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
cnt = 0
for r in range(N//R+1):
for g in range(N//G+1):
if (N - r*R - g*G) >= 0 and (N - r*R - g*G)%B == 0 :
cnt +=1
#print(r,g,(N - r*R - g*G)//B)
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//G+1):
if (N - r*R - g*G) < 0:
break
if (N - r*R - g*G)%B == 0 :
cnt +=1
#print(r,g,(N - r*R - g*G)//B)
print(cnt)
|
p03048
|
from math import floor
r, g, b, n = list(map(int, input().split()))
cnt = 0
for r0 in range(floor(n // r)+1):
for g0 in range(floor(n // g)+1):
sum = r * r0 + g * g0
if sum > n:
continue
if (n - sum) % b == 0:
cnt += 1
print(cnt)
|
from math import floor
r, g, b, n = list(map(int, input().split()))
r, g, b = sorted([r, g, b])[::-1]
cnt = 0
for r0 in range(floor(n // r)+1):
for g0 in range(floor((n-r*r0)// g)+1):
sum = r * r0 + g * g0
if sum > n:
continue
if (n - sum) % b == 0:
cnt += 1
print(cnt)
|
p03048
|
R,G,B,n=list(map(int,input().split()))
i=0
ans=0
while(R*i<=n):
j=0
while(R*i+G*j<=n):
if((n-R*i-G*j)%B==0):
ans+=1
j+=1
i+=1
print(ans)
|
R,G,B,n=list(map(int,input().split()))
i=0
ans=0
for i in range(int(n/R)+1):
for j in range(int((n-i*R)/G)+1):
if((n-R*i-G*j)%B==0):
ans+=1
print(ans)
|
p03048
|
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)<0: continue
if (N-R*r-G*g)%B==0:
cnt=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=cnt+1
print (cnt)
|
p03048
|
# diverta 2019 Programming Contest: B – RGB Boxes
R, G, B, N = [int(i) for i in input().split()]
bingo = 0
for r in range(0, 3001):
for g in range(0, 3001):
b = (N -(R * r + G * g)) // B
if b >= 0 and R * r + G * g + B * b == N:
bingo += 1
print(bingo)
|
# diverta 2019 Programming Contest: B – RGB Boxes
R, G, B, N = [int(i) for i in input().split()]
bingo = 0
for r in range(0, 3001):
for g in range(0, 3001):
b = (N -(R * r + G * g)) // B
if b < 0:
break
elif R * r + G * g + B * b == N:
bingo += 1
print(bingo)
|
p03048
|
# diverta 2019 Programming Contest: B – RGB Boxes
R, G, B, N = [int(i) for i in input().split()]
bingo = 0
for r in range(0, 3001):
for g in range(0, 3001):
b = (N -(R * r + G * g)) // B
if b < 0:
break
elif R * r + G * g + B * b == N:
bingo += 1
print(bingo)
|
# diverta 2019 Programming Contest: B – RGB Boxes
R, G, B, N = [int(i) for i in input().split()]
bingo = 0
for r in range(0, 3001):
if R * r > N:
break
else:
for g in range(0, 3001):
b = (N -(R * r + G * g)) // B
if b < 0:
break
elif R * r + G * g + B * b == N:
bingo += 1
print(bingo)
|
p03048
|
# diverta 2019 Programming Contest: B – RGB Boxes
R, G, B, N = [int(i) for i in input().split()]
bingo = 0
for r in range(N + 1):
if R * r > N:
break
for g in range(N + 1):
b = (N - (R * r + G * g)) // B
if b >= 0 and R * r + G * g + B * b == N:
bingo += 1
print(bingo)
|
# diverta 2019 Programming Contest: B – RGB Boxes
R, G, B, N = [int(i) for i in input().split()]
bingo = 0
for r in range(N + 1):
if R * r > N:
break
for g in range(N + 1):
b = (N - (R * r + G * g)) // B
if b < 0:
break
if R * r + G * g + B * b == N:
bingo += 1
print(bingo)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for g in range(N//G+1):
for b in range(N//B+1):
s = N-g*G-b*B
if s>=0 and s%R == 0:
ans += 1
print(ans)
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for g in range(N//G+1):
for b in range(N//B+1):
s = N-g*G-b*B
if s < 0:
break
if s%R == 0:
ans += 1
print(ans)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for g in range(N//G+1):
for b in range(N//B+1):
s = N-g*G-b*B
if s < 0:
break
if s%R == 0:
ans += 1
print(ans)
|
r, g, b, n = list(map(int, input().split()))
dp = [0 for i in range(n+1)]
dp[0] = 1
for i in range(r, n+1, r):
dp[i] = 1
for i in range(g, n+1):
dp[i] += dp[i-g]
for i in range(b, n+1):
dp[i] += dp[i-b]
print((dp[-1]))
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(3001):
for g in range(3001):
v = R * r + G * g
if N >= v and (N - v) % B == 0:
ans += 1
print(ans)
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(min(3000, 3000 // R) + 1):
for g in range(min(3000, 3000 // G) + 1):
v = R * r + G * g
if N >= v and (N - v) % B == 0:
ans += 1
print(ans)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(min(3000, 3000 // R) + 1):
for g in range(min(3000, 3000 // G) + 1):
v = R * r + G * g
if N >= v and (N - v) % B == 0:
ans += 1
print(ans)
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(min(3000, 3000 // R) + 1):
if R * r <= N:
for g in range(min(3000, 3000 // G) + 1):
v = R * r + G * g
if N >= v and (N - v) % B == 0:
ans += 1
print(ans)
|
p03048
|
a,b,c,n=list(map(int,input().split()))
d=[a,b,c]
d.sort()
a=d[0]
b=d[1]
c=d[2]
e=0
for i in range(0,int(n/c)+1):
f=n-c*i
for k in range(0,int(f/b)+1):
g=f-b*k
if g/a-int(g/a)==0:
e=e+1
print(e)
|
a,b,c,n=list(map(int,input().split()))
d=[a,b,c]
d.sort()
a=d[0]
b=d[1]
c=d[2]
e=0
for i in range(0,n//c+1):
for k in range(0,(n-c*i)//b+1):
if ((n-c*i-b*k)%a)==0:
e=e+1
print(e)
|
p03048
|
import sys, re
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
R, G, B, N = MAP()
count = 0
for i in range(N+1):
for j in range(int((N-i*R)//G)+1):
# print(r, g, b)
if R*i + G*j + B*int(max(0, (N - i*R - j*G))/B) == N:
count += 1
print(count)
|
import sys, re
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
R, G, B, N = MAP()
count = 0
for i in range(N+1):
for j in range(int((N-i*R)//G)+1):
# print(r, g, b)
# if R*i + G*j + B*int(max(0, (N - i*R - j*G))/B) == N:
# count += 1
if (N - i*R - j*G) % B == 0:
count += 1
print(count)
|
p03048
|
R, G, B, N = tuple(map(int, input().split()))
ans = 0
for i in range(N//R+1):
for j in range(N//G+1):
rest = (N - R * i - G * j)
if (0 <= rest) and rest % B == 0:
ans += 1
print(ans)
|
R, G, B, N = tuple(map(int, input().split()))
ans = 0
for i in range(N//R+1):
for j in range(N//G+1):
rest = (N - R * i - G * j)
if rest < 0:
break
if rest % B == 0:
ans += 1
print(ans)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
count = 0
for r in range(int(N / R) + 1):
for g in range(int(N / G) + 1):
x = N - r * R - g * G
if x >= 0 and x % B == 0:
count = count + 1
print(count)
|
R, G, B, N = list(map(int, input().split()))
count = 0
for r in range(int(N / R) + 1):
for g in range(int(N / G) + 1):
x = N - r * R - g * G
if x < 0:
break
if x >= 0 and x % B == 0:
count = 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):
b=(N-r*R-g*G)/B
if b.is_integer() and b>=0:
ans+=1
#print(r,g,b)
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()))
num = 0
ans = 0
for r in range(N+1):
numR = R*r
if numR > N: continue
for g in range(N+1):
numG = numR + G*g
if numG > N: continue
b = (N-numG) / B
if int(b) == b and b >= 0:
ans += 1
print(ans)
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N+1):
for g in range((N-r*R)//G+1):
b0 = N-r*R-g*G
if b0 % B == 0:
ans += 1
print(ans)
|
p03048
|
*lst,N = list(map(int, input().split()))
lst.sort(reverse=True)
#print(lst)
count = 0
for i in range(N // lst[0] + 1):
for j in range((N - i * lst[0]) // lst[1] + 1):
if (N - i * lst[0] - j * lst[1]) % lst[2] == 0:
count += 1
print(count)
|
r,g,b,n = list(map(int,input().split()))
a = [0]*(n+1)
a[0] = 1
for j in range(0,n+1-r,r):
a[j+r]=1
for j in range(n+1-b):
a[j+b]+=a[j]
for j in range(n+1-g):
a[j+g]+=a[j]
#print(a)
print((a[n]))
|
p03048
|
r,g,b,n = list(map(int,input().split()))
a = [0]*(n+1)
a[0] = 1
for j in range(0,n+1-r,r):
a[j+r]=1
for j in range(n+1-b):
a[j+b]+=a[j]
for j in range(n+1-g):
a[j+g]+=a[j]
#print(a)
print((a[n]))
|
r,g,b,n = list(map(int,input().split()))
a = [0]*(n+1)
a[0] = 1
for j in range(n+1-r):
a[j+r]=a[j]
for j in range(n+1-b):
a[j+b]+=a[j]
for j in range(n+1-g):
a[j+g]+=a[j]
#print(a)
print((a[n]))
|
p03048
|
R, G, B, n = list(map(int, input().split()))
cnt = 0
for r in range(int(n//R)+1):
for g in range(int(n//G)+1):
if (n - (r*R + g*G)) % B == 0 and n - (r*R + g*G) >= 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//G)+1):
if (n - (r*R + g*G)) % B == 0 and n - (r*R + g*G) >= 0:
cnt +=1
print(cnt)
|
p03048
|
r, g, b, n = list(map(int, input().split()))
ans=0
for i in range(3001):
for j in range(3001):
if n-(r*i+g*j)>=0 and (n-(r*i+g*j))%b==0:
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+1):
p=n-(r*i+g*j)
if p>=0 and p%b==0:
ans+=1
print(ans)
|
p03048
|
r,g,b,n=list(map(int,input().split()))
tmp=0
A=0
B=0
for i in range(3001):
if(r*i>3001):break
for j in range(3001):
A=r*i+g*j
B=n-A
if(A>3001|B<0):break
if(((B%b)==0)&((B/b)<3001)):
tmp+=1
print(tmp)
|
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
|
def main():
R, G, B, N = (int(i) for i in input().split())
ans = 0
for r in range(0, N+1):
for g in range(0, N+1):
b = (N - r*R - g*G)//B
if b >= 0 and r*R + g*G + b*B == N:
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
def main():
R, G, B, N = (int(i) for i in input().split())
ans = 0
for r in range(N+1):
for g in range(N+1):
need = N - r*R - g*G # 必要ボール数
if need < 0:
continue
b = 0--need//B
if r*R + g*G + b*B == N:
ans += 1
# print(r, g, b)
print(ans)
if __name__ == '__main__':
main()
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(0, N+1):
balls = R*r
if N < balls:
break
for g in range(0, N+1):
balls = R*r + G*g
if N < balls:
break
left = N - balls
if left % B == 0:
ans += 1
print(ans)
|
R, G, B, N = list(map(int, input().split()))
ans = 0
rsum = 0
for r in range(0, N+1):
if N < rsum:
break
rgsum = rsum
for g in range(0, N+1):
if N < rgsum:
break
left = N - rgsum
if left % B == 0:
ans += 1
rgsum += G
rsum += R
print(ans)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
count = 0
for a in range(N+1):
for b in range(N-a+1):
c = N-a-b
if a%R == 0 and b%G == 0 and c%B == 0:
count +=1
print(count)
|
R,G,B,N = list(map(int,input().split()))
count = 0
for a in range(0,N+1,R):
for b in range(0,N-a+1,G):
c = N-a-b
if a%R == 0 and b%G == 0 and c%B == 0:
count +=1
print(count)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
count = 0
for a in range(0,N+1,R):
for b in range(0,N-a+1,G):
c = N-a-b
if a%R == 0 and b%G == 0 and c%B == 0:
count +=1
print(count)
|
R,G,B,N = list(map(int,input().split()))
count = 0
for a in range(0,N+1,R):
if a%R == 0:
for b in range(0,N-a+1,G):
if b%G == 0:
c = N-a-b
if c%B == 0:
count +=1
print(count)
|
p03048
|
R,G,B,N=list(map(int,input().split()))
ans=[]
for r in range(int(N/R)+1):
for g in range(int((N-r*R)/G)+1):
b=((N-r*R-g*G)/B)
if b.is_integer():
ans.append([r,g,b])
print((len(ans)))
|
R,G,B,N=list(map(int,input().split()))
ans=[]
count=0
for r in range(int(N/R)+1):
for g in range(int((N-r*R)/G)+1):
if (N-r*R-g*G)%B==0:
count+=1
#ans.append([r,g,(N-r*R-g*G)/B])
#print(ans)
print(count)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
res = 0
for i in range(N // R + 1):
for j in range(N // G + 1):
b = N - (i * R + j * G)
if b >= 0 and b % B == 0:
res += 1
print(res)
|
R, G, B, N = list(map(int, input().split()))
res = 0
for i in range(N // R + 1):
for j in range((N - i * R) // G + 1):
if (N - (i * R + j * G)) % B == 0:
res += 1
print(res)
|
p03048
|
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
R,G,B,N =[int(x) for x in input().split()]
a = 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:
a += 1
print(a)
|
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
R,G,B,N =[int(x) for x in input().split()]
a = 0
for i in range(N//R+1):
for j in range(((N-(i*R))//G)+1):
if (N -i*R-j*G)%B == 0:
a += 1
print(a)
|
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):
t = (N-i*r-j*g)
if t%b ==0 and t>=0:
#print(i,j,t//b)
c+=1
print(c)
|
*s,n=list(map(int,input().split()))
s.sort()
c=0
for i in range(n//s[2]+1):
for j in range(n//s[1]+1):
if (n-s[2]*i-s[1]*j)%s[0] == 0 and 0<=(n-s[2]*i-s[1]*j):
#print(i,j,n-s[2]*i-s[1]*j)
c+=1
print(c)
|
p03048
|
R,G,B,N=list(map(int,input().split()))
ans=0
for r in range(0,int(N//R)+1):
for g in range(0,int(N//G)+1):
if (N-R*r-G*g)%B==0 and R*r+G*g<=N:
ans+=1
#print(r,g)
print(ans)
|
R,G,B,N=list(map(int,input().split()))
ans=0
for r in range(0,int(N//R)+1):
for g in range(0,int((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()))
cnt=0
for i in range(N//R +2):
if R*i>N:
break
for j in range((N-R*i)//G +2):
if R*i+G*j>N:
break
if (N-(R*i+G*j))%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-R*i)//G+1):
if (N-(R*i+G*j))%B==0:
cnt+=1
print(cnt)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
ans = 0
#R>G and G>B
if R<B:
x = R
R = B
B = x
for r in range(N+1):
if r*R>N:
break
for g in range(N+1):
if r*R+g*G>N:
break
if (N-r*R-g*G)%B==0:
ans+=1
print(ans)
|
R,G,B,N = list(map(int,input().split()))
ans = 0
for r in range(N+1):
if r*R>N:
break
for g in range(N+1):
S = N-r*R-g*G
if S<0:
break
elif S%B==0:
ans+=1
print(ans)
|
p03048
|
import math
R,G,B,N = list(map(int,input().split()))
cnt = 0
for i in range(math.ceil(N/G)+1):
for j in range(math.ceil(N/R)+1):
tmp = N - i * G - j * R
if tmp >=0 and tmp % B == 0:
cnt += 1
print(cnt)
|
import math
R,G,B,N = list(map(int,input().split()))
cnt = 0
for i in range(math.ceil(N/G)+1):
for j in range(math.ceil(N/R)+1):
tmp = N - i * G - j * R
if tmp < 0:
break
if tmp % B == 0:
cnt += 1
print(cnt)
|
p03048
|
r, g, b, n = list(map(int, input().split()))
c = sorted([r, g, b])[::-1]
ans = 0
for i in range(n // c[0] + 1):
for j in range((n - i * r) // c[1] + 1):
x = n - i * c[0] - j * c[1]
if x >= 0 and x % c[2] == 0:
ans += 1
print(ans)
|
r, g, b, n = list(map(int, input().split()))
c = sorted([r, g, b])[::-1]
ans = 0
for i in range(n // c[0] + 1):
x = n - i * c[0]
for j in range(x // c[1] + 1):
y = x - j * c[1]
if y < 0:
break
elif y % c[2] == 0:
ans += 1
print(ans)
|
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):
num=(n-(i*r+j*g))%b
if num==0 and n-(i*r+j*g)>=0:
ans+=1
print(ans)
|
def solve():
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):
num=n-(i*r+j*g)
if num%b==0 and num>=0:
ans+=1
print(ans)
solve()
|
p03048
|
R,G,B,n=list(map(int,input().split()))
c=0
for i in range(n+1):
r=R*i
if r>n:
break
for j in range(n+1):
g=G*j
if r+g>n:
break
b=n-r-g
if b%B==0:
c+=1
print(c)
|
R,G,B,n=list(map(int,input().split()))
def cou(R,G,B,n):
c=0
for i in range(n+1):
r=R*i
if r>n:
break
for j in range(n+1):
g=G*j
if r+g>n:
break
b=n-r-g
if b%B==0:
c+=1
return c
print((cou(R,G,B,n)))
|
p03048
|
r,g,b,n=list(map(int,input().split()))
ans=0
for i in range(n//r+1):
for j in range(n//g+1):
if (n-(r*i+g*j))%b==0:
if (n-(r*i+g*j))//b>=0:
ans+=1
print(ans)
|
a,b,c,d=list(map(int,input().split()))
ans=0
for x in range(d//a+1):
for y in range(d//b+1):
# print(x,y,(d-(x*a+y*b))//c)
if (d-(x*a+y*b))%c==0 and (d-(x*a+y*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):
c = n - i * r - j * g
if c % b == 0 and c >= 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):
c = n - i * r - j * g
if c < 0:
break
if c % b == 0:
cnt += 1
print(cnt)
|
p03048
|
r, g, b, n = list(map(int, input().split()))
cnt = 0
for i in range(n // r + 1):
for j in range((n - i) // g + 1):
k = (n - i * r - j * g) / b
if k >= 0 and k // 1 == k:
cnt += 1
print(cnt)
|
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 - i + 1, g):
if (n - i - j) % b == 0:
cnt += 1
print(cnt)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
number = [R, G, B]
number = sorted(number)
M = N // number[2]
ans = 0
for i in range(0, M+1):
value1 = i * number[2]
L = (N-value1) // number[1]
for j in range(0, L+1):
value2 = j * number[1]
if N-value1-value2 >= 0 and (N-value1-value2) % number[0] == 0:
ans += 1
continue
print(ans)
|
R, G, B, N = list(map(int, input().split()))
number = [R, G, B]
number = sorted(number)
M = N // number[2]
ans = 0
if number[2] == 1:
print(((N+2)*(N+1)//2))
else:
for i in range(0, M+1):
value1 = i * number[2]
L = (N-value1) // number[1]
for j in range(0, L+1):
value2 = j * number[1]
if N-value1-value2 >= 0 and (N-value1-value2) % number[0] == 0:
ans += 1
continue
print(ans)
|
p03048
|
#B問題
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(0, N // R + 1):
for g in range(0, N // G + 1):
if (N - R*r - G*g) % B == 0 and (N - R*r - G*g)/B >=0:
ans += 1
print(ans)
|
#B問題
import math
R, G, B, N = list(map(int, input().split()))
ans = 0
if R == G == B == 1:
print((int((N+2)*(N+1)/2)))
else:
for r in range(0, N // R + 1):
for g in range(0, N // G + 1):
if (N - R*r - G*g) % B == 0 and (N - R*r - G*g)/B >=0:
ans += 1
print(ans)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
r = 0
g = 0
X = N - r*R - g*G
num = 0
while X >= 0:
while X >= 0:
if X % B == 0:
num += 1
r += 1
X = N - r*R - g*G
g += 1
r = 0
X = N - r * R - g * G
print(num)
|
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 = list(map(int, input().split()))
count = 0
len_r = N // R + 2
len_g = N // G + 2
for ix in range(len_r):
for iy in range(len_g):
sum = N - (R * ix + G * iy)
if sum >= 0 and sum % B == 0:
count += 1
if R * ix + G + iy > N:
break
print(count)
|
R, G, B, N = list(map(int, input().split()))
count = 0
len_r = N // R + 2
for ix in range(len_r):
len_g = (N - (R * ix)) // G + 2
for iy in range(len_g):
t = N - (R * ix + G * iy)
if t >= 0 and t % B == 0:
count += 1
print(count)
|
p03048
|
# coding: utf-8
# Your code here!
R, G, B, N = list(map(int, input().split()))
answer = 0
for x in range(N // R + 1):
for y in range(N // G + 1):
if (N - R * x - G * y) % B == 0 & 0 <= (N - R * x - G * y) // B <= N // B:
answer += 1
print(answer)
|
# coding: utf-8
# Your code here!
R, G, B, N = list(map(int, input().split()))
answer = 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:
answer += 1
print(answer)
|
p03048
|
r, g, b, n = list(map(int, input().split()))
ans = 0
nr = n // r
ng = n // g
for i in range(nr + 1):
for j in range(ng + 1):
tmp = n - i * r - j * g
if tmp % b == 0 and tmp >= 0:
ans += 1
print(ans)
|
r, g, b, n = list(map(int, input().split()))
ans = 0
nr = n // r
ng = n // g
for i in range(nr + 1):
for j in range(ng + 1):
tmp = n - i * r - j * g
if tmp >= 0 and tmp % b == 0:
ans += 1
print(ans)
|
p03048
|
ans = 0
R, G, B, N = list(map(int, input().split()))
for r in range(N//R + 1):
for g in range(N//G + 1):
rg = r*R + g*G
if rg <= N and (N-rg)%B == 0:
ans += 1
print(ans)
|
ans = 0
R, G, B, N = list(map(int, input().split()))
rl = (N+R-1)//R+1
gl = (N+G-1)//G+1
bl = (N+B-1)//B
for r in range(rl):
for g in range(gl):
tmp = N - (r*R) - (g*G)
if tmp < 0:
break
if tmp == 0:
ans += 1
elif tmp%B == 0 and tmp%B <= bl:
ans += 1
print(ans)
|
p03048
|
r,g,b,n = list(map(int,input().split()))
cnt = 0
for i in range(0,n//r + 1):
for j in range(0,n//g + 1):
if (n - i*r - j*g)%b == 0 and (n - i*r - j*g)/b >= 0:
cnt += 1
print(cnt)
|
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-i,g):
if (n - i - j)%b == 0 and (n - i - j)%b >= 0:
cnt += 1
print(cnt)
|
p03048
|
r,g,b,n = list(map(int, input().split()))
ans = 0
for i in range((n+1)//r+1):
for j in range((n+1)//g+1):
k = n - (i*r + j*g)
if k < 0:
break
elif k >= 0 and k%b == 0:
ans += 1
print(ans)
|
r,g,b,n = list(map(int, input().split()))
ans = 0
for i in range(n+1):
for j in range(n+1):
k = n - (i*r + j*g)
if k < 0:
break
elif k >= 0 and k%b == 0:
ans += 1
print(ans)
|
p03048
|
r,g,b,n=list(map(int,input().split()))
lst=[r,g,b]
lst.sort()
r=lst[2]
g=lst[1]
b=lst[0]
rlim=n//r
glim=n//g
blim=n//b
"""
blist = [i*b for i in range(blim+1)]
glist = [i*g for i in range(glim+1)]
def binary_search(list, item):
low = 0
high = len(list) - 1
while low <= high:
mid = (low + high) //2
guess = list[mid]
if guess == item:
return True
if guess > item:
high = mid -1
else:
low = mid + 1
return False
"""
cnt=0
for i in range(rlim+1):
glim=(n-i*r)//g
for j in range(glim+1):
if (n-i*r-j*g)%b==0:
cnt+=1
print(cnt)
|
r, g, b, n = list(map(int, input().split()))
lst = [r, g, b]
lst.sort()
r = lst[2]
g = lst[1]
b = lst[0]
rlim = n//r
glim = n//g
cnt = 0
for i in range(rlim+1):
glim = (n-i*r)//g
for j in range(glim+1):
if (n-i*r-j*g) % b == 0:
cnt += 1
print(cnt)
|
p03048
|
r,g,b,n = list(map(int, input().split()))
ans = 0
rgb = sorted([r,g,b])
n_rgb = []
for e in rgb:
n_rgb.append(n//e)
for i in range(n_rgb[2]+1):
for j in range(n_rgb[1]+1):
N = n - i*rgb[2] - j*rgb[1]
if N>=0 and N%rgb[0]==0:
ans+=1
print(ans)
|
r,g,b,n = list(map(int, input().split()))
ans = 0
rgb = sorted([r,g,b])
n_rgb = []
for e in rgb:
n_rgb.append(n//e)
for i in range(n_rgb[2]+1):
N2 = n-i*rgb[2]
for j in range(n_rgb[1]+1):
N = N2 - j*rgb[1]
if N>=0 and N%rgb[0]==0:
ans+=1
print(ans)
|
p03048
|
r,g,b,n = list(map(int,input().split()))
r1 = 0
count = 0
while r*r1 <= n:
g1 = 0
while r*r1+g*g1 <= n:
if (n-(r*r1+g*g1))%b==0:
count += 1
g1 += 1
r1 += 1
print(count)
|
R,G,B,N = list(map(int,input().split()))
ans = 0
for r in range(1+N//R):
for g in range(1+N//G):
#print(N-(r*R+g*G),r*R, g*G)
if N-(r*R+g*G) < 0:
break
if (N-(r*R+g*G))%B==0:
ans += 1
print(ans)
|
p03048
|
# -*- coding: utf-8 -*-
# 標準入力の取得
R, G, B, N = list(map(int, input().split()))
# 求解処理
r_max = N // R
g_max = N // G
result = 0
for r in range(r_max+1):
n_r = r * R
for g in range(g_max+1):
n_rg = n_r + g*G
if N < n_rg:
continue
if (N - n_rg) % B == 0:
result += 1
# 結果出力
print(result)
|
# -*- coding: utf-8 -*-
# 標準入力の取得
R, G, B, N = list(map(int, input().split()))
def main() -> None:
# 求解処理
r_max = N // R
g_max = N // G
result = 0
for r in range(r_max+1):
n_r = r * R
for g in range(g_max+1):
n_rg = n_r + g*G
if N < n_rg:
continue
if (N - n_rg) % B == 0:
result += 1
# 結果出力
print(result)
if __name__ == "__main__":
main()
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N//R+2):
for g in range((N-r*R)//G+2):
if N - r*R - g*G >= 0 and (N - r*R - g*G) % 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()))
count=0
for p1 in range(0,N+1,R):
for p2 in range(0,N-p1+1,G):
rR = p1
gG = p2
bB = N-p1-p2
if rR%R==0 and gG%G==0 and bB%B==0:
count+=1
print(count)
|
R,G,B,N=list(map(int, input().split()))
count=0
for p1 in range(0,N+1,R):
for p2 in range(0,N-p1+1,G):
rR = p1
gG = p2
bB = N-p1-p2
if bB%B==0:
count+=1
print(count)
|
p03048
|
r,g,b,n = list(map(int, input().split()))
count = 0
c0,c1,c2 = sorted([r,g,b])
for i in range(1+n//c2):
rest1 = n - i*c2
if rest1 < 0:
break
for j in range(1+rest1//c1):
rest = n - i*c2 - j*c1
if rest <0:
break
if rest%c0 == 0 and rest >= 0:
count += 1
print(count)
|
r,g,b,n = list(map(int, input().split()))
count = 0
c0,c1,c2 = sorted([r,g,b])
for i in range(1+n//c2):
rest1 = n - i*c2
if rest1 < 0:
break
for j in range(1+rest1//c1):
rest = n - i*c2 - j*c1
if rest <0:
break
elif rest%c0 == 0:
count += 1
print(count)
|
p03048
|
r,g,b,n=list(map(int, input().split()))
sum=0
for i in range((n//r)+1):
for j in range((n-(i*r)//g)+1):
if (n-(i*r)-(j*g))%b==0 and (n-(i*r)-(j*g))//b>=0:
sum=sum+1
# print(i*r,j*g,(n-(i*r)-(j*g))%b)
print(sum)
|
r,g,b,n=list(map(int, input().split()))
sum=0
for i in range(n//r+1):
for j in range((n-i*r)//g+1):
if (n-i*r-j*g)%b==0:
sum=sum+1
# print(i*r,j*g,(n-(i*r)-(j*g))%b)
print(sum)
|
p03048
|
r, g, b, n = list(map(int,input().split()))
ans = 0
for i in range(n+1):
if (i*r) > n:
break
for j in range(n+1):
if (i*r) + (j*g) > n:
break
if n-(i*r)-(j*g) >= 0 and (n-(i*r)-(j*g))%b == 0:
ans += 1
print(ans)
|
r, g, b, n = list(map(int,input().split()))
ans = 0
for i in range(n+1):
x = i*r
if x > n:
break
for j in range(n+1):
y = j*g
z = n-x-y
if x+y > n:
break
if z >= 0 and z%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) :
if N - R*i - G*j >= 0 :
if (N - R*i - G*j) % 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 - R*i)//G + 1) :
if (N - R*i - G*j) % B == 0:
cnt += 1
print(cnt)
|
p03048
|
R, G, B, N =list(map(int, input().split()))
# R = 13
# G = 1
# B = 4
# N = 3000
X, Y, Z = sorted([R, G, B], reverse=True)
cnt = 0
for i in range(N//X+1):
for j in range(N+1):
if (X*i+Y*j>N): break
cnt += ((N-X*i-Y*j)%Z == 0)
print(cnt)
|
R, G, B, N =list(map(int, input().split()))
# R = 13
# G = 1
# B = 4
# N = 3000
X, Y, Z = sorted([R, G, B], reverse=True)
cnt = 0
for i in range(N//X+1):
for j in range(N+1):
tmp = X*i+Y*j
if (tmp>N): break
cnt += ((N-tmp)%Z == 0)
print(cnt)
|
p03048
|
R,G,B,N = list(map(int, input().split()))
count=0
for i in range(N//R+1):
for j in range(N//G+1):
if (N-(R*i+G*j))>=0 and (N-(R*i+G*j))%B==0:
count=count+1
print(count)
|
R,G,B,N = list(map(int, input().split()))
count=0
for i in range(N//R+1):
for j in range(N//G+1):
if (N-(R*i+G*j))<0:
break
if (N-(R*i+G*j))%B==0:
count=count+1
print(count)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
r_max = N//R+1
g_max = N//G+1
b_max = N//B+1
ans = 0
for r in range(r_max):
g_max = (N-r*R)//G+1
for g in range(g_max):
if (N-r*R-g*G)%B == 0 and N-r*R-g*G >= 0:
ans += 1
print(ans)
|
R,G,B,N = list(map(int,input().split()))
r_max = N//R+1
ans = 0
for r in range(r_max):
g_max = (N-r*R)//G+1
for g in range(g_max):
if (N-r*R-g*G)%B == 0:
ans += 1
print(ans)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
box = sorted([R,G,B],reverse=True)
count = 0
for x in range(0,N+1,box[0]):
for y in range(0,N+1,box[1]):
if x + y > N:
continue
z = (N - x - y) / box[2]
if z >= 0 and z.is_integer():
count += 1
print(count)
|
R, G, B, N = list(map(int, input().split()))
box = sorted([R,G,B],reverse=True)
count = 0
for x in range(0,N+1,box[0]):
for y in range(0,N+1 - x ,box[1]):
z = (N - x - y) / box[2]
if z >= 0 and z.is_integer():
count += 1
print(count)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
C = sorted([R, G, B], reverse=True)
cnt = 0
for p0 in range(N//C[0]+1):
p0v = p0*C[0]
for p1 in range((N-p0v)//C[1]+1):
p1v = p1*C[1]
if (N - p0v - p1v)%C[2] == 0:
cnt += 1
print(cnt)
|
R, G, B, N = list(map(int, input().split()))
C = sorted([R, G, B], reverse=True)
print((sum((1 for c1 in range(0, N+1, C[0]) for c12 in range(c1, N+1, C[1]) if (N - c12) % C[2] == 0 ))))
|
p03048
|
R, G, B, N = list(map(int,input().split()))
ans = 0
for i in range(N//R+1):
if N - R*i < 0:
break
for j in range(N//G+1):
if N - R * i - G * j < 0:
break
if N -R*i -G*j == 0:
ans += 1
elif N -R*i -G*j > 0 and (N -R*i -G*j) % B == 0:
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:
ans += 1
print(ans)
|
p03048
|
def main():
R,B,G,N = list(map(int,input().split(' ')))
cnt = 0
for i in range(N//R+1):
for j in range(N//G+1):
if R*i+G*j > N:
break
if (N-(R*i+G*j))//B == (N-(R*i+G*j))/B and (N-(R*i+G*j))/B >=0:
cnt +=1
print(cnt)
if __name__ =='__main__':
main()
|
def main():
R,B,G,N = list(map(int,input().split(' ')))
cnt = 0
for r in range(N//R+1):
for g in range(N//G+1):
if R*r+G*g > N:
break
if (N-(R*r+G*g))%B ==0:
cnt +=1
print(cnt)
if __name__ =='__main__':
main()
|
p03048
|
from itertools import product
R, G, B, N = list(map(int, input().split()))
colors = sorted([(N // R, R), (N // G, G), (N // B, B)])
ans = 0
for i, j in product(list(range(colors[1][0]+1)), list(range(colors[2][0]+1))):
I = colors[1][1]; J = colors[2][1];
if N >= i*I + j*J and (N - (i*I + j*J)) % colors[0][1] == 0: ans += 1
print(ans)
|
from itertools import product
R, G, B, N = list(map(int, input().split()))
R_max = N // R
G_max = N // G
ans = 0
for r, g in product(list(range(R_max+1)), list(range(G_max+1))):
if N >= r*R + g*G and (N - (r*R + g*G)) % B == 0: ans += 1
print(ans)
|
p03048
|
from itertools import product
R, G, B, N = list(map(int, input().split()))
R_max = N // R
G_max = N // G
ans = 0
for r, g in product(list(range(R_max+1)), list(range(G_max+1))):
b, r = divmod((N - (r*R + g*G)), B)
if r == 0 and b >= 0: ans += 1
print(ans)
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N // R + 1):
N1 = N - r*R
for g in range(N1 // G + 1):
N2 = N1 - g*G
if N2 % B == 0: ans += 1
print(ans)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
c = sorted([R,G,B])
R = c[1]
G = c[2]
B = c[0]
ans = 0
for r in range(N//R+1):
tmp = N - r*R
for g in range(N//G+1):
ttmp = tmp - g*G
ans += int(ttmp%B == 0 and ttmp >= 0)
print(ans)
|
R,G,B,N = list(map(int,input().split()))
c = sorted([R,G,B])
R = c[1]
G = c[2]
B = c[0]
ans = 0
for r in range(N//R+1):
tmp = N - r*R
for g in range(N//G+1):
ttmp = tmp - g*G
ans += (ttmp%B == 0 and ttmp >= 0)
print(ans)
|
p03048
|
r,g,b,n=list(map(int,input().split()))
ctr=0
num_r=n//r+1
num_g=n//g+1
for i in range(num_r):
for k in range((n-i*r)//g+1):
if n-r*i-g*k>=0 and (n-r*i-g*k)%b==0:
ctr+=1
print(ctr)
|
r,g,b,n=list(map(int,input().split()))
ctr=0
l=[r,g,b]
l.sort()
num_1=n//l[2]+1
for i in range(num_1):
for k in range((n-i*l[2])//l[1]+1):
if (n-i*l[2]-k*l[1])%l[0]==0:
ctr+=1
print(ctr)
|
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 i * r + j * g > n:
break
k = n - (i * r + j * g)
if k % b == 0:
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 - i * r) // g + 1):
k = n - (i * r + j * g)
if k % 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//G+1):
bB=N-r*R-g*G
if bB >= 0 and bB%B == 0:
ans += 1
print(ans)
|
R,G,B,N = list(map(int,input().split()))
ans = 0
if R == 1 and G == 1:
for b in range(N//B+1):
ans += N-b*B+1
else:
for r in range(N//R+1):
for g in range(N//G+1):
bB=N-r*R-g*G
if bB >= 0 and bB%B == 0:
ans += 1
print(ans)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
org_list = [R, G, B]
org_list.sort()
first_num = org_list[2]
second_num = org_list[1]
third_num = org_list[0]
count = 0
for i in range(N // first_num + 1):
if i*first_num > N:
break
for j in range((N-i*first_num) // second_num + 1):
if i*first_num + j*second_num > N:
break
if (N - i*first_num - j*second_num) % third_num == 0:
count += 1
print(count)
|
R, G, B, N = list(map(int, input().split()))
org_list = [R, G, B]
org_list.sort()
first_num = org_list[2]
second_num = org_list[1]
third_num = org_list[0]
count = 0
for i in range(N // first_num + 1):
for j in range((N-i*first_num) // second_num + 1):
if (N - i*first_num - j*second_num) % third_num == 0:
count += 1
print(count)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for i in range(3000 // R + 1):
for j in range(3000 // G + 1):
tmp = (N - i * R - j * G)
if tmp % B == 0 and tmp >= 0:
ans += 1
print(ans)
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for i in range(3000 // R + 1):
for j in range(3000 // G + 1):
tmp = (N - i * R - j * G)
if tmp % B == 0 and tmp >= 0:
ans += 1
elif tmp < 0:
break
print(ans)
|
p03048
|
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 (N-i-j) % B == 0 and N >= (i+j):
count += 1
print(count)
|
R, G, B, N = list(map(int, input().split()))
count = len([1 for i in range(0, N+1, R) for j in range(0, N+1, G) if (N-i-j) % B == 0 and N >= (i+j)])
print(count)
|
p03048
|
# coding: utf-8
# Your code here!
from collections import defaultdict
R, G, B, N = list(map(int, input().rstrip().split(' ')))
A = [R, G, B]
dp = defaultdict(lambda: defaultdict(lambda: -1))
def rec(i, n):
if dp[i][n] != -1:
return dp[i][n]
if n == 0:
return 1
if i > 2:
return 0
#print(i, n)
temp = 0
for j in range(n // A[i] + 1):
temp += rec(i + 1, n - j * A[i])
dp[i][n] = temp
return temp
print((rec(0, N)))
|
# coding: utf-8
# Your code here!
from collections import defaultdict
R, G, B, N = list(map(int, input().rstrip().split(' ')))
A = [R, G, B]
dp = defaultdict(lambda: defaultdict(lambda: -1))
def rec(i, n):
if dp[i][n] != -1:
return dp[i][n]
if n == 0:
return 1
if i == 2:
return n % A[2] == 0
temp = 0
for j in range(n // A[i] + 1):
temp += rec(i + 1, n - j * A[i])
dp[i][n] = temp
return temp
print((rec(0, N)))
|
p03048
|
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 - i*R - j*G) / B >= 0 and (N - i*R - j*G) % B == 0:
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 - i*R - j*G) % 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-i*R)//G+1):
if i*R + j*G +((N-i*R-j*G)//B)*B==N:
cnt+=1
print(cnt)
|
def main():
R,G,B,N=list(map(int,input().split()))
cnt=0
for i in range(N//R+1):
cnt+=sum([1 for j in range((N-i*R)//G+1) if i*R + j*G +((N-i*R-j*G)//B)*B==N])
print(cnt)
main()
|
p03048
|
r, g, b, n = list(map(int, input().split()))
ans = 0
for i in range(n // r + 1):
for j in range(n // g + 1):
m = r * i + g * j
if m <= n and (n - m) % b == 0:
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 // g + 1):
m = r * i + g * j
if m <= n and (n - m) % b == 0:
ans += 1
elif m > n:
break
print(ans)
|
p03048
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.