input
stringlengths 20
127k
| target
stringlengths 20
119k
| problem_id
stringlengths 6
6
|
---|---|---|
r,g,b,n = list(map(int,input().split()))
rgb = sorted([r,g,b])
ans=0
for i in range(n//rgb[2]+1):
for j in range((n-i*rgb[2])//rgb[1]+1):
d = n-i*rgb[2]-j*rgb[1]
if d%rgb[0]==0 and d>=0:
ans+=1
print(ans)
|
rgb = [0]*3
rgb[0],rgb[1],rgb[2],n = list(map(int,input().split()))
rgb.sort()
ans=0
for i in range(n//rgb[2]+1):
for j in range((n-i*rgb[2])//rgb[1]+1):
d = n-i*rgb[2]-j*rgb[1]
if d%rgb[0]==0 and d>=0:
ans+=1
print(ans)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(int(N/R)+1):
for g in range(int(N/G)+1):
if r*R + g*G <= N:
if (N - (r*R + g*G))%B == 0:
ans += 1
else:
break
print(ans)
|
R, G, B, N = list(map(int, input().split()))
ans = 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:
ans += 1
print(ans)
|
p03048
|
R,G,B,N=list(map(int,input().split()))
ans=[]
if 1<=R<=3000 and 1<=G<=3000 and 1<=B<=3000 and 1<=N<=3000:
limR=N//R
for r in range(limR+1)[::-1]:
zanGB=N-r*R
limG=zanGB//G
for g in range(limG+1):
zanB=zanGB-g*G
if zanB%B==0:
b=zanB//B
ans.append([r,g,b])
print((len(ans)))
|
R,G,B,N=list(map(int,input().split()))
ans=0
if 1<=R<=3000 and 1<=G<=3000 and 1<=B<=3000 and 1<=N<=3000:
limR=N//R
for r in range(limR+1)[::-1]:
zanGB=N-r*R
limG=zanGB//G
for g in range(limG+1):
zanB=zanGB-g*G
if zanB%B==0:
b=zanB//B
ans+=1
print(ans)
|
p03048
|
R, G, B, N = (int(i) for i in input().split())
c = 0
for r in range(N//R, -1, -1):
new1 = N - r*R
for g in range(new1//G, -1, -1):
new2 = new1 - g*G
if new2%B == 0:
c +=1
print(c)
|
def main(R, G, B, N):
arr = [R, G, B]
arr.sort(reverse=True)
R, G, B = arr
c = 0
for r in range(N//R, -1, -1):
new1 = N - r*R
for g in range(new1//G, -1, -1):
if (new1 - g*G)%B == 0:
c +=1
print(c)
R, G, B, N = (int(i) for i in input().split())
main(R, G, B, N)
|
p03048
|
R,G,B,N = list(map(int, input().split()))
index = 0
ans = 0
for_sort = [R,G,B]
for_sort.sort()
r = for_sort[2]
g = for_sort[1]
b = for_sort[0]
while N >= r*index:
middle = N - r*index
index += 1
index2 = 0
while middle >= g*index2:
end = middle - g*index2
index2 += 1
if end % b == 0:
ans += 1
print(ans)
|
R,G,B,N = list(map(int, input().split()))
index = 0
ans = 0
for_sort = [R,G,B]
for_sort.sort()
r = for_sort[2]
g = for_sort[1]
b = for_sort[0]
while N >=0:
mid = N
N -= r
while mid >= 0:
if mid % b == 0:
ans += 1
mid -= g
print(ans)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
cnt = 0
for r in range(3001):
if r*R > N:
break
for g in range(3001):
if r*R + g*G > N:
break
diff = N - (r*R + g*G)
if divmod(diff, B)[1] == 0:
cnt += 1
print(cnt)
|
R, G, B, N = list(map(int, input().split()))
cnt = 0
r, g, b = 0, 0, 0
while r*R <= N:
tank = N - r*R
while True:
if divmod(tank, B)[1] == 0:
cnt += 1
tank -= G
if tank < 0:
break
r += 1
print(cnt)
|
p03048
|
R, G, B, n = list(map(int, input().split()))
cnt = 0
for r in range(n+1):
for g in range(n+1):
bb = n - r*R - g*G
if bb >= 0 and bb%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):
bb = n - r*R - g*G
if bb < 0:
break
elif bb%B == 0:
cnt += 1
print(cnt)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
ans = 0
for i in range(0,N//R+1):
for j in range(0,N//G+1):
k = N - i*R -j*G
if k%B == 0 and k>= 0:
ans += 1
print(ans)
|
R,G,B,N = list(map(int,input().split()))
ans = 0
for i in range(0,N//R+1):
for j in range(0,(N-i*R)//G+1):
k = N - i*R -j*G
if k%B == 0 and k>= 0:
ans += 1
print(ans)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
ans = 0
for i in range(0,N//R+1):
for j in range(0,N//G+1):
k = N - i*R -j*G
if k%B == 0 and k>= 0:
ans += 1
print(ans)
|
R,G,B,N = list(map(int,input().split()))
ans = 0
for i in range(0,N//R+1):
for j in range(0,(N-i*R)//G+1):
k = N - i*R -j*G
if k%B == 0 and k>= 0:
ans += 1
print(ans)
|
p03048
|
r, g, b, n = list(map(int, input().split()))
if r >= g and g >= b:
pass
elif r >= b and b >= g:
temp = g
g = b
b = temp
else:
temp = r
r = g
g = temp
rg = {}
ri = 0
while ri <= n:
gi = 0
while gi <= n - ri:
if (n - ri - gi) % b == 0:
total = rg.get(ri + gi, 0)
rg[ri + gi] = total + 1
else:
pass
gi += g
ri += r
bi = 0
result = 0
while bi <= n:
total = rg.get(n - bi, 0)
result += total
bi += b
print(result)
|
r, g, b, n = list(map(int, input().split()))
if r >= g and g >= b:
pass
elif r >= b and b >= g:
temp = g
g = b
b = temp
else:
temp = r
r = g
g = temp
if (r == 1 and g == 1) or (r == 1 and b == 1) or (g == 1 and b == 1):
rg = [i + 1 for i in range(n + 1)]
elif (r == 1 and g == 2) or (r == 1 and b == 2) or (g == 1 and b == 2) or (r == 2 and g == 1) or (r == 2 and b == 1) or (g == 2 and b == 1):
rg = [1 + i // 2 for i in range(n + 1)]
else:
rg = [0 for _ in range(n + 1)]
ri = 0
while ri <= n:
gi = 0
while gi <= n - ri:
rg[ri + gi] += 1
gi += g
ri += r
bi = 0
result = 0
while bi <= n:
total = rg[n - bi]
result += total
bi += b
print(result)
|
p03048
|
r,g,b,n = list(map(int,input().split()))
count = 0
rr = n // r
for i in range(rr+1):
for j in range((n-i*r)//g+1):
if n >= i*r + j*g and (n - (i*r + j*g)) % b == 0:
count += 1
print(count)
|
r,g,b,n = list(map(int,input().split()))
count = 0
rr = n // r
for i in range(rr+1):
for j in range((n-i*r)//g+1):
tmp = n - (i*r + j*g)
if tmp >= 0 and tmp % b == 0:
count += 1
print(count)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ans = sum(
(N - r * R - g * G) >= 0 and (N - r * R - g * G) % B == 0
for r in range(N + 1) for g in range(N - r * R + 1)
)
print(ans)
|
# 入力
R, G, B, N = list(map(int, input().split()))
# とりうるすべてのr, gの組に関して、条件を満たすbが存在するかを数え上げる
ans = sum(
N - r * R - g * G >= 0 and (N - r * R - g * G) % B == 0
for r in range(N // R + 1)
for g in range((N - r * R) // G + 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):
if r * R + g * G < N and (N - r * R - g * G) % B == 0:
ans += 1
if r * R + g * G == N:
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()))
ans = 0
for i in range(n//r+1):
for j in range((n-r*i)//g+1):
if (n-r*i-g*j) < 0:
break
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):
for j in range((n-r*i)//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 i in range(3001):
for j in range(3001):
v = i * R + j * 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 i in range(N // R + 1):
for j in range((N - i * R) // G + 1):
ball = i * R + j * G
if N == ball:
ans += 1
elif (N - ball) % B == 0:
ans += 1
print(ans)
|
p03048
|
import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
R,G,B,N = LI()
ans = 0
for i in range(N+1):
for j in range(N+1):
temp = N-(R*i+G*j)
if temp>=0 and temp%B==0:
ans += 1
print(ans)
|
import itertools,sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
R,G,B,N = LI()
dp = [0]*(N+1)
dp[0] = 1
for x,i in itertools.product([R,G,B],list(range(N+1))):
if i-x>=0:
dp[i] += dp[i-x]
print((dp[-1]))
|
p03048
|
R,G,B,N = list(map(int,input().split()))
ans = 0
for i in range(0,int(N/R)+1):
for j in range(0,int(N/G)+1):
if i*R+j*G<=N 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(0,N+1,R):
for j in range(0,N+1,G):
if i+j<=N and (N-i-j)%B == 0:
ans+=1
print(ans)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
ans = 0
for i in range(0,N+1,R):
for j in range(0,N+1,G):
if i+j<=N and (N-i-j)%B == 0:
ans+=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(0,N+1,G):
if i+j<=N:
if (N-i-j)%B == 0:
ans+=1
print(ans)
|
p03048
|
def resolve():
'''
code here
'''
R, G, B, N = [int(item) for item in input().split()]
cnt = 0
for i in range(N+1):
for j in range(N+1):
_b = N - (i * R + j * G)
if _b % B == 0 and _b >= 0:
cnt += 1
print(cnt)
if __name__ == "__main__":
resolve()
|
def resolve():
'''
code here
'''
R, G, B, N = [int(item) for item in input().split()]
cnt = 0
for i in range(N+1):
for j in range(N+1-i):
_b = N - (i * R + j * G)
if _b % B == 0 and _b >= 0:
cnt += 1
print(cnt)
if __name__ == "__main__":
resolve()
|
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):
if N-r*R-g*G < 0:
break
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()))
"""
3000以下なので全探索を考える。
まず,全探索できるものは全探索から考える必要がある。
"""
count = 0
for r in range(N//R+1):
for g in range(N//G+1):
n_b = (N - r*R - g*G)
if n_b % B == 0 and n_b >= 0:
count += 1
print(count)
|
R, G, B, N = list(map(int, input().split()))
"""
3000以下なので全探索を考える。
まず,全探索できるものは全探索から考える必要がある。
オーダーを計算し,いけそうならそれで行くべき。今回は固定を順にしていくので間に合う
そこから探索する範囲を絞り込んで
"""
count = 0
for r in range(N//R+1):
rest = N - r*R
for g in range(rest//G+1):
n_b = (rest - g*G)
if n_b % B == 0 and n_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//G+1):
x = i * R
y = j*G
z = N - x-y
if z>= 0 and z%B == 0:
ans += 1
print((int(ans)))
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for i in range(N//R+1):
x = i * R
for j in range((N-x)//G+1):
y = j*G
z = N - x-y
if z>= 0 and z%B == 0:
ans += 1
print((int(ans)))
|
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-R*i-G*j)%B == 0 and (N-R*i-G*j)>=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
|
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 - ( i * r + j * g )) % b == 0 and i * r + j * g <= n:
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):
if ( n - ( i * r + j * g )) % b == 0:
ans += 1
print(ans)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
c = 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
x = (N - r * R - g * G)
if not x % B and (0 <= (x // B)):
#print(r, g, b)
c += 1
print(c)
|
R, G, B, N = list(map(int, input().split()))
c = 0
for r in range(0, N + 1, R):
for g in range(0, N + 1, G):
if N < r + g:
break
d = N - r - g
if not d % B:
c += 1
"""
for g in range(N + 1):
if N < r * R + g * G:
break
x = (N - r * R - g * G)
if not (x % B) and (0 <= (x // B)):
#print(r, g, b)
c += 1
"""
print(c)
|
p03048
|
r, g, b, n = [int(i) for i in input().split()]
ans = 0
for i in range(n + 1):
for j in range(n + 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 = (int(i) for i in input().split())
ans = 0
for i in range(n//r+1):
for j in range((n-(i*r))//g+1):
k = (n-r*i-j*g)//b
if r*i+j*g+abs(k*b) == n:
ans += 1
print(ans)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
cnt = 0
for i in range(N//R+1):
M = N-R*i
for j in range(M//G+1):
L = M-G*j
if L % B == 0:
cnt += 1
print(cnt)
|
def main():
r,g,b,n = list(map(int,input().split()))
c = 0
for i in range(n//r+1):
m = n - r * i
for j in range(m//g+1):
l = m - g * j
if l % b == 0:
c += 1
print(c)
main()
|
p03048
|
import sys
from collections import deque
sys.setrecursionlimit(10*5)
ans=0
r,g,b,n=list(map(int,input().split()))
for i in range(n//r+2):
for j in range(n//g+2):
k=n-i*r-j*g
if k>=0 and k%b==0:
ans+=1
print(ans)
|
ans=0
r,g,b,n=list(map(int,input().split()))
for i in range(n//r+2):
for j in range(n//g+2):
k=n-i*r-j*g
if k>=0 and k%b==0:
ans+=1
print(ans)
|
p03048
|
ans=0
r,g,b,n=list(map(int,input().split()))
for i in range(n//r+2):
for j in range(n//g+2):
k=n-i*r-j*g
if k>=0 and k%b==0:
ans+=1
print(ans)
|
# coding: utf-8
#-------------------------------------------------------------------
import sys
def p(*a):
s=" ".join(map(str,a))
#print(s)
sys.stderr.write(s+"\n")
#-------------------------------------------------------------------
R,G,B,N = list(map(int, input().split()))
if R<G: R,G=G,R
if G<B: G,B=B,G
if R<G: R,G=G,R
r=g=b=0
ans=0
#p(N//R+2)
#p(N//G+2)
#X=[]
#p(r,g,b)
for r in range(N//R+2):
if (R*r)>N: break
for g in range(N//G+2):
if (R*r)+(G*g)>N:
break
X.append("break")
b = (N-(R*r)-(G*g))//B
n = (R*r)+(G*g)+(B*b)
if n==N:
ans+=1
# X.append([r,g,b])
# p(r,g,b,n,N,ans)
print(ans)
#p(X)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
answer = 0
for r in range(N//R+1):
for g in range(N//G+1):
if r*R + g*G > N or (N-r*R-g*G)%B != 0:
continue
else:
answer += 1
print(answer)
|
R, G, B, N = list(map(int, input().split()))
answer = 0
for r in range(N//R+1):
for g in range(N//G+1):
if r*R + g*G > N:
break
elif (N-r*R-g*G)%B != 0:
continue
else:
answer += 1
print(answer)
|
p03048
|
#!/usr/bin/env python3
import sys
def solve(R: int, G: int, B: int, N: int):
cnt= 0
for r in range(0, N+1, R):
for g in range(0, N + 1 - r, G):
if N - r - g < 0:
break
b = (N - r - g) / B
if b % 1 == 0 and b >= 0:
cnt += 1
else:
continue
print(cnt)
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()
R = int(next(tokens)) # type: int
G = int(next(tokens)) # type: int
B = int(next(tokens)) # type: int
N = int(next(tokens)) # type: int
solve(R, G, B, N)
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
import sys
def solve(R: int, G: int, B: int, N: int):
cnt= 0
for r in range(0, N + 1, R):
upper = N + 1 - r
for g in range(0, upper, G):
temp = upper-1-g
if temp < 0:
break
b = temp / B
if b % 1 == 0 and b >= 0:
cnt += 1
else:
continue
print(cnt)
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()
R = int(next(tokens)) # type: int
G = int(next(tokens)) # type: int
B = int(next(tokens)) # type: int
N = int(next(tokens)) # type: int
solve(R, G, B, N)
if __name__ == '__main__':
main()
|
p03048
|
'''
B - RGB Boxes
'''
r_weight, g_weight, b_weight, N = list(map(int, input().split()))
ans = 0
for r in range(N+1):
if r*r_weight > N:
break
for g in range(N-r*r_weight+1):
if r*r_weight + g*g_weight > N:
break
b = (N - r*r_weight - g*g_weight) // b_weight
if r*r_weight + g*g_weight + b*b_weight == N and b >= 0:
ans += 1
print(ans)
|
'''
B - RGB Boxes
'''
r_weight, g_weight, b_weight, N = list(map(int, input().split()))
ans = 0
for r in range(N+1):
for g in range(N-r*r_weight+1):
rem = N - r*r_weight - g*g_weight
if rem % b_weight == 0 and rem >= 0:
ans += 1
print(ans)
|
p03048
|
R,G,B,N = list(map(int, input().split()))
count = 0
for r in range(N+1):
for g in range(N+1-r):
if (N-R*r-G*g) % B ==0 and -1 < N-R*r-G*g :
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 = list(map(int, input().split()))
ans = int(0)
x = int(N//R)
for i in range(x+1):
t = N-i*R
y = int(t//G)
for j in range(y+1) :
s = int(N-R*i-G*j)
if s%B==0 : ans +=1
print(ans)
|
R,G,B,N = list(map(int, input().split()))
ans = int(0)
x = int(N//R)
for i in range(x+1):
t = N-i*R
y = int(t//G)
for j in range(y+1) :
s = int(t-G*j)
if s%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):
if r*R+g*G <= N 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//G+1):
tmp = r*R+g*G
if tmp <= N and (N-tmp) % B == 0:
ans += 1
print(ans)
|
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):
b=N-(R*i+G*j)
if B==0 or (b>=0 and b%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):
b=N-(R*i+G*j)
if b==0 or b%B==0:
ans+=1
print(ans)
|
p03048
|
a,b,c,d=list(map(int,input().split()))
e=[a,b,c]
w,r,t=e[0],e[1],e[2]
u=0
for i in range(d//a+1):
y=d-(a*i)
for o in range(y+1):
x=y-(b*o)
if y==0 or x==0 or x%c==0 and x>=0:
u+=1
print(u)
|
a,b,c,d=list(map(int,input().split()))
e=[a,b,c]
w,r,t=e[0],e[1],e[2]
u=0
for i in range(d//a+1):
y=d-(a*i)
for o in range(y+1):
x=y-(b*o)
if x%c==0 and x>=0:
u+=1
print(u)
|
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):
n = N-r*R-g*G
if n>=0 and n%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
|
R,G,B,N= list(map(int,input().split()))
cnt = 0
a = 3000//R
b = 3000//G
c = 3000//B
for i in range(0,a+1):
for j in range(0,b + 1):
if(R*i+G*j)<=N and (N-R*i - G*j )%B==0:
cnt += 1
# print(cnt)
# if(R*i + G*j) < == N:
# cnt += (N-R*i + G*j )//B
# # for k in range(0,c + 1):
# # if (R*i + G*j + B * k) == N:
# # cnt += 1
print(cnt)
|
R,G,B,N= list(map(int,input().split()))
cnt = 0
a = 3000//R
for i in range(0,a+1):
b = (3000-R*i)//G
for j in range(0,b + 1):
if(R*i+G*j)<=N and (N-R*i - G*j )%B==0:
cnt += 1
# print(cnt)
# if(R*i + G*j) < == N:
# cnt += (N-R*i + G*j )//B
# # for k in range(0,c + 1):
# # if (R*i + G*j + B * k) == N:
# # cnt += 1
print(cnt)
|
p03048
|
r, g, b, n = list(map(int, input().split()))
count = 0
for i_r in range(0,int(n/r)+1):
if (n - r*i_r)<0:continue
for i_g in range(0,int(n/g)+1):
if (n - r*i_r - g*i_g)<0:continue
if 0==((n - r*i_r - g*i_g)%b):
count +=1
print(count)
|
r, g, b, n = list(map(int, input().split()))
count = 0
for i_r in range(0,int(n)+1):
if (n - r*i_r)<0:continue
for i_g in range(0,int(n)+1):
if (n - r*i_r - g*i_g)<0:continue
if 0==((n - r*i_r - g*i_g)%b):
count +=1
print(count)
|
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):
r = i*R
for j in range(int(N/G)+1):
g = j*G
b = N - g - r
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(int(N/R)+1):
r = i*R
for j in range(int(N/G)+1):
g = j*G
b = N - g - r
if b >= 0 and b % B == 0:
cnt += 1
print(cnt)
|
p03048
|
# from pprint import pprint
# import math
# import collections
# n = int(input())
R, G, B, N = list(map(int, input().split(' ')))
# a = list(map(int, input().split(' ')))
max_r, max_g, max_b = N // R, N // G, N // B
ans = []
r, g, b = 0, 0, 0
cnt = 0
for r in range(3000):
if R * r > N:
break
max_g = (N - R * r) // G
for g in range(max_g + 1):
if R * r + G * g > N:
break
x = (N - (R * r + G * g))
if x % B == 0 and x >= 0:
b = x // B
a = (r, g, b)
cnt += 1
# ans.append(a)
# print(len(ans))
print(cnt)
|
# from pprint import pprint
# import math
# import collections
# n = int(input())
R, G, B, N = list(map(int, input().split(' ')))
# a = list(map(int, input().split(' ')))
# max_r, max_g, max_b = N // R, N // G, N // B
ans = []
r, g, b = 0, 0, 0
cnt = 0
max_r = N // R
for r in range(max_r + 1):
if R * r > N:
break
max_g = (N - R * r) // G
for g in range(max_g + 1):
if R * r + G * g > N:
break
x = (N - (R * r + G * g))
if x % B == 0 and x >= 0:
# b = x // B
# a = (r, g, b)
cnt += 1
# ans.append(a)
# print(len(ans))
print(cnt)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
RGB = sorted([R, G, B], reverse=True)
max1 = N // RGB[0]
count = 0
for r in range(max1+1):
max2 = min([N-r, (N-r*RGB[0])//RGB[1]])
for g in range(max2+1):
Bb = N - (r*RGB[0] + g*RGB[1])
if Bb >= 0 and Bb % RGB[2] == 0:
count += 1
print(count)
|
R, G, B, N = list(map(int, input().split()))
RGB = sorted([R, G, B], reverse=True)
max1 = N // RGB[0]
count = 0
for r in range(max1+1):
max2 = min([N-r, (N-r*RGB[0])//RGB[1]])
for g in range(max2+1):
if (N - (r*RGB[0] + g*RGB[1])) % RGB[2] == 0:
count += 1
print(count)
|
p03048
|
from sys import exit
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 < 0:
break
if (N - r * R - g * G) % B == 0:
count += 1
print(count)
|
from sys import exit
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()))
ans = 0
for i in range(1+n//r):
for j in range(1+n//g):
div = (n - g*j - r*i)//b
mod = (n - g*j - r*i)%b
if div >= 0 and mod == 0:
ans += 1
print(ans)
|
r, g, b, n = list(map(int, input().split()))
ans = 0
for i in range(1+n//r):
tmp = n - r*i
for j in range(1+tmp//g):
mod = (n - g*j - r*i)%b
if mod == 0:
ans += 1
print(ans)
|
p03048
|
R,G,B,n=list(map(int, input().split()))
ans=0
for r in range(n+1):
for g in range(n+1-r):
b = n-r-g
if b%B==0 and r%R==0 and g%G==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==0:
for g in range(n+1-r):
b = n-r-g
if b%B==0 and r%R==0 and g%G==0:
ans+=1
print(ans)
|
p03048
|
import collections
r, g, b, n = list(map(int, input().split()))
sum_rg = collections.Counter()
for i in range(n + 1):
if n < r*i:
break
for j in range(n + 1):
if n < r*i + g*j:
break
sum_rg[r*i + g*j] += 1
ans = 0
for k in range(n + 1):
if n < b*k:
break
ans += sum_rg[n - b*k]
#print(sum_rg)
print(ans)
|
import collections
r, g, b, n = list(map(int, input().split()))
#sum_rg = collections.Counter() # TLE
sum_rg = collections.defaultdict(int)
for i in range(n + 1):
if n < r*i:
break
for j in range(n + 1):
if n < r*i + g*j:
break
sum_rg[r*i + g*j] += 1
ans = 0
for k in range(n + 1):
if n < b*k:
break
ans += sum_rg[n - b*k]
#print(sum_rg)
print(ans)
|
p03048
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
r, g, b, n = list(map(int, read().split()))
cnt = 0
for i in range(n + 1):
for j in range(n + 1):
check = n - (r * i + g * j)
if check >= 0:
if check % b == 0:
cnt += 1
else:
break
print(cnt)
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
r, g, b, n = list(map(int, read().split()))
cnt = 0
for i in range(n // r + 1):
for j in range(n // g + 1):
check = n - (r * i + g * j)
if check >= 0:
if check % b == 0:
cnt += 1
else:
break
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//g + 1):
nb = (n - (i*r+j*g))/b
if (nb >= 0) and (nb % 1 == 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):
nb = (n - (i*r+j*g))
if (nb >= 0):
if (nb % b == 0):
cnt += 1
else:
break
print(cnt)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ok = 0
for r in range(N // R + 1):
for g in range(N // G + 1):
last_num = N - (r * R) - (g * G)
if last_num >= 0 and last_num % B == 0:
ok += 1
print(ok)
|
R, G, B, N = list(map(int, input().split()))
ok = 0
for r in range(N // R + 1):
for g in range((N - r * R) // G + 1):
last_num = N - (r * R) - (g * G)
if last_num >= 0 and last_num % B == 0:
ok += 1
print(ok)
|
p03048
|
R,G,B,N= list(map(int,input().split()))
cnt = 0
for i in range(N+1):
for j in range(N+1):
k = N - R*i- G*j
if k<0 or k % B != 0 : continue
k /= B
cnt += 1
print(cnt)
|
R,G,B,N= list(map(int,input().split()))
cnt = 0
for i in range(N+1):
for j in range(N+1):
k = N - R*i- G*j
if k<0 or k % B != 0 : continue
cnt += 1
print(cnt)
|
p03048
|
r,g,b,n = list(map(int, input().split(" ")))
l = sorted([r,g,b])
count=0
for i in range(int(n/l[2])+1):
for j in range(int(n/l[1])+1):
x = l[2]*i
y = l[1]*j
if (n-x-y) >= 0 and (n-x-y)%l[0] == 0:
count = count + 1
print(count)
|
r,g,b,n = list(map(int, input().split(" ")))
l = sorted([r,g,b])
count=0
for i in range(int(n/l[2])+1):
for j in range(int(n/l[1])+1):
x = l[2]*i
y = l[1]*j
if (n-x-y) < 0:
break
if (n-x-y) >= 0 and (n-x-y)%l[0] == 0:
count = count + 1
print(count)
|
p03048
|
r, g, b, n = list(map(int, input().split()))
cnt = 0
for i in range(3001):
for j in range(3001):
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(n//r+1):
for j in range(n//g+1):
if (n-i*r-j*g) % b == 0 and (n-i*r-j*g) // b >= 0:
cnt += 1
print(cnt)
|
p03048
|
r0,g0,b0,n=list(map(int,input().split()))
ans=0
l=[r0,g0,b0]
l.sort(reverse=True)
r=l[0]
g=l[1]
b=l[2]
x=0
while x*r<=n:
y=0
while y*g<=n-x*r:
if (n-x*r-y*g) % b == 0:
ans+=1
y+=1
x+=1
print(ans)
|
r0,g0,b0,n=list(map(int,input().split()))
ans=0
l=[r0,g0,b0]
l.sort(reverse=True)
r=l[0]
g=l[1]
b=l[2]
x=0
while x*r<=n:
y=0
if g==1:
ans+=1+n-x*r
x+=1
continue
if b==1:
ans+=1+(n-x*r)//g
x+=1
continue
while y*g<=n-x*r:
if (n-x*r-y*g) % b == 0:
ans+=1
y+=1
x+=1
print(ans)
|
p03048
|
r,g,b,n=list(map(int,input().split()))
ans=0
x=0
while x*r<=n:
y=0
while y*g<=n-x*r:
aaa = (n-x*r-y*g) / b
if aaa.is_integer():
ans+=1
y+=1
x+=1
print(ans)
|
r,g,b,n=list(map(int,input().split()))
ans=0
for x in range(n//r+1):
for y in range((n-x*r)//g+1):
if (n-x*r-y*g)%b==0:
ans+=1
print(ans)
|
p03048
|
r,g,b,n=list(map(int,input().split()))
ans=0
for x in range(n//r+1):
for y in range((n-x*r)//g+1):
if (n-x*r-y*g)%b==0:
ans+=1
print(ans)
|
R,G,B,N=list(map(int,input().split()))
R,G,B=sorted([R,G,B])
ans=0
for b in range(1+N//B):
for g in range(1+(N-b*B)//G):
if (N-b*B-g*G)%R==0:
ans+=1
print(ans)
|
p03048
|
R,G,B,N = list(map(int, input().split()))
count = 0
for r in range(N//R+1):
if R*r> N:
break
for g in range(N//G+1):
if R*r + G*g > N:
break
if (N - (R*r + G*g)) %B == 0 :
count += 1
print(count)
|
R,G,B,N = list(map(int, input().split()))
count = 0
for r in range(N//R+1):
if R*r> N:
break
for g in range(N//G+1):
aa = N-R*r- G*g
if aa < 0:
break
if aa %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):
v = R * r + G * g
if v > N:
continue
if (N - v) % 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):
for g in range((N//G)+1):
v = R * r + G * g
if v > N:
break
if (N - v) % 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//G+1):
tmp = (N-(r*R+g*G))
if tmp>=0:
if tmp%B==0:
cnt += 1
print(cnt)
|
R,G,B,N=list(map(int, input().split()))
arr = [R,G,B]
arr = sorted(arr, reverse=True)
R,G,B = arr
cnt = 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>=0:
if tmp%B==0:
cnt += 1
print(cnt)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
rmax = N // R
gmax = N // G
bmax = N // B
ans = 0
for r in range(rmax+1):
for g in range(gmax+1):
if (N - (R*r + G*g)) % B == 0:
if 0 <= (N - (R*r + G*g) )// B <= bmax:
ans += 1
print(ans)
|
R,G,B,N = list(map(int,input().split()))
rmax = N // R
gmax = N // G
bmax = N // B
ans = 0
for r in range(rmax+1):
for g in range(gmax+1):
if (N - (R*r + G*g)) % B == 0 and 0 <= (N - (R*r + G*g) )// B <= bmax:
ans += 1
print(ans)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
li = [R,G,B]
li.sort(reverse=True)
R = li[0]
G = li[1]
B = li[2]
#print(R,G,B)
ans = 0
for b in range(N//B+1):
for g in range((N-B*b)//G+1):
if N-B*b-G*g >= 0 and (N-B*b-G*g)%R == 0:
ans += 1
print(ans)
|
R,G,B,N = list(map(int,input().split()))
li = [R,G,B]
li.sort()
R = li[0]
G = li[1]
B = li[2]
#print(R,G,B)
ans = 0
for b in range(N//B+1):
for g in range((N-B*b)//G+1):
if N-B*b-G*g >= 0 and (N-B*b-G*g)%R == 0:
ans += 1
print(ans)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
ans = 0
for b in range(N+1):
for g in range(N+1):
if N-B*b-G*g >= 0 and (N-B*b-G*g)%R == 0:
ans += 1
print(ans)
|
R,G,B,N = list(map(int,input().split()))
ans = 0
for b in range(N+1):
for g in range(N+1):
if N-B*b-G*g < 0:
break
if (N-B*b-G*g)%R == 0:
ans += 1
print(ans)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
ans = 0
for b in range(N+1):
for g in range(N+1):
if N-B*b-G*g < 0:
break
if (N-B*b-G*g)%R == 0:
ans += 1
print(ans)
|
R,G,B,N = list(map(int,input().split()))
ans = 0
for b in range(N//B+1):
for g in range((N-B*b)//G+1):
Rr = N-B*b-G*g
if Rr >= 0 and Rr%R == 0:
ans += 1
print(ans)
|
p03048
|
r, g, b, n = list(map(int, input().split()))
a1, a2, a3 = sorted([r, g, b])
r = 0
I = n//a3+1
J = n//a2+1
for i in range(I):
for j in range(J):
t = n-i*a3-j*a2
if t>=0 and t%a1==0:
r += 1
print(r)
|
r, g, b, n = list(map(int, input().split()))
a1, a2, a3 = sorted([r, g, b])
r = 0
I = n//a3+1
for i in range(I):
for j in range((n-i)//a2+1):
t = n-i*a3-j*a2
if t>=0 and t%a1==0:
r += 1
print(r)
|
p03048
|
# coding: utf-8
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 n-i*r-j*g>=0 and (n-i*r-j*g)%b==0:
cnt+=1
print(cnt)
|
# coding: utf-8
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 (n-i*r-j*g)%b==0:
cnt+=1
print(cnt)
|
p03048
|
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return eval(input())
def k(): return int(eval(input()))
def S(): return input().split()
def I(): return list(map(int,input().split()))
def X(): return list(eval(input()))
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")
r,g,b,n = I()
a = []
a.append(r)
a.append(g)
a.append(b)
a.sort()
a[0],a[1],a[2] = r,g,b
mx_b = n//b
amari = n%b
for i in range(n//r + 1):
for j in range(n//g + 1):
if (r*i+g*j) % b == amari and (r*i+g*j)//b <= mx_b:
cnt += 1
print(cnt)
|
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return eval(input())
def k(): return int(eval(input()))
def S(): return input().split()
def I(): return list(map(int,input().split()))
def X(): return list(eval(input()))
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")
r,g,b,n = I()
a = []
a.append(r)
a.append(g)
a.append(b)
a.sort()
a[0],a[1],a[2] = r,g,b
mx_b = n//b
amari = n%b
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,y,n=list(map(int,input().split()))
a=0
b=0
c=0
count=0
m=n
for i in range((n//r)+1):
a=i
m=m-r*i
for j in range((n//g)+1):
b=j
c=m-j*g
if c%y==0 and c>=0 :
count+=1
m=n
print(count)
|
r,g,y,n=list(map(int,input().split()))
a=0
b=0
c=0
count=0
m=n
for i in range((n//r)+1):
m=m-r*i
for j in range((m//g)+1):
c=m-j*g
if c%y==0 and c>=0 :
count+=1
m=n
print(count)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
counter = 0
r_max = N//R+1
g_max = N//G+1
for r in range(r_max+1):
for g in range(g_max+1):
temp = N - R*r - G*g
if temp% B == 0 and temp//B >= 0:
counter +=1
print(counter)
|
R, G, B, N = list(map(int, input().split()))
counter = 0
r_max = N//R+1
g_max = N//G+1
for r in range(r_max+1):
temp = N - R*r
for g in range(g_max+1):
now = temp - G*g
if now% B == 0 and now//B >= 0:
counter +=1
print(counter)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
counter = 0
r_max = N//R+1
g_max = N//G+1
for r in range(r_max+1):
temp = N - R*r
for g in range(g_max+1):
now = temp - G*g
if now% B == 0 and now//B >= 0:
counter +=1
print(counter)
|
R, G, B, N = list(map(int, input().split()))
counter = 0
r_max = N//R+1
for r in range(r_max+1):
temp = N - R*r
for g in range(temp//G+1):
now = temp - G*g
if now% B == 0 and now//B >= 0:
counter +=1
print(counter)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
ans = 0
balls = N
for r in range(0,(balls//R)+1):
balls_r = balls - R*r
for g in range(0,(balls//G)+1):
balls_g = balls_r - G*g
if (balls_g >= 0) and (balls_g % B == 0):
ans += 1
print(ans)
|
R,G,B,N = list(map(int,input().split()))
ans = 0
balls = N
for r in range(0,(balls//R)+1):
balls_r = balls - R*r
for g in range(0,(balls_r//G)+1):
balls_g = balls_r - G*g
if (balls_g >= 0) and (balls_g % 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):
if (n - r * R - g * G) % B == 0:
b = (n - r * R - g * G) / B
if 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[i + j] += a[j]
print((a[n]))
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N + 1):
for g in range(N + 1):
b = (N - r * R - g * G) / 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 + 1):
b = (N - R * r - G * g) / B
if b >= 0 and int(b) == b:
ans += 1
print(ans)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N + 1):
for g in range(N + 1):
b = (N - R * r - G * g) / B
if b >= 0 and int(b) == b:
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 // G + 1):
b = (N - R * r - G * g) / B
if b == int(b) and 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):
b = (N - R * r - G * g) / B
if b == int(b) 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):
for g in range((N - R*r)//G + 1):
b = (N - (R*r+G*g)) / B
if b == int(b):
ans += 1
print(ans)
|
p03048
|
def solve():
R,G,B,N=list(map(int,input().split()))
ans=0
for i in range(N+1):
for j in range(N+1):
tmp=N-(R*i+G*j)
if tmp%B==0 and tmp>=0:
ans+=1
print(ans)
solve()
|
def solve():
R,G,B,N=list(map(int,input().split()))
ans=0
for i in range(N+1):
for j in range(N+1):
tmp=N-(R*i+G*j)
if tmp>=0 and tmp%B==0:
ans+=1
print(ans)
solve()
|
p03048
|
def solve():
R,G,B,N=list(map(int,input().split()))
ans=0
for i in range(N+1):
for j in range(N+1):
tmp=N-(R*i+G*j)
if tmp>=0 and tmp%B==0:
ans+=1
print(ans)
solve()
|
def solve():
R,G,B,N=list(map(int,input().split()))
ans=0
for i in range(N+1):
for j in range(N+1):
tmp=N-R*i-G*j
if tmp>=0 and tmp%B==0:
ans+=1
print(ans)
solve()
|
p03048
|
R, G,B,N = list(map(int, input().split()))
l=[R, G, B]
l.reverse()
r_max=N//l[0]
g_max=N//l[1]
RR=l[0]
GG=l[1]
BB=l[2]
ans=0
for r in range(r_max+1):
res=N-r*RR
for g in range(g_max+1):
x=res-GG*g
if x>=0 and x%BB==0:
ans+=1
print(ans)
|
R, G,B,N = list(map(int, input().split()))
l=[R, G, B]
l.reverse()
r_max=N//l[0]
g_max=N//l[1]
RR=l[0]
GG=l[1]
BB=l[2]
ans=0
for r in range(r_max+1):
res=N-r*RR
for g in range(g_max+1):
x=res-GG*g
if x<0:
break
if x%BB==0:
ans+=1
print(ans)
|
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):
rg = i * r + j * g
rest = n - rg
if rest < 0:
continue
elif rest == 0:
count += 1
elif rest % b == 0:
count += 1
print(count)
|
r, g, b, n = list(map(int, input().split()))
count = 0
a = n // r
t = n // g
for i in range(a+1):
for j in range(t+1):
rg = i * r + j * g
rest = n - rg
if rest < 0:
continue
elif rest % b == 0:
count += 1
print(count)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
R,G,B = reversed([R,G,B])
r = 0
count = 0
r_max = N // R
while r <= r_max:
g_max = (N-r*R)//G
g = 0
while g <= g_max:
b = (N-r*R-g*G)/B
if b.is_integer() and b >= 0:
count += 1
g += 1
r += 1
print(count)
|
R,G,B,N = list(map(int,input().split()))
count = 0
for r in range(0,N+1,R):
for g in range(r,N+1,G):
b = (N-g)/B
if b.is_integer() and b >= 0:
count += 1
print(count)
|
p03048
|
R,G,B,N=list(map(int,input().split()))
counter=0
for r in range(N+1):
for g in range(N+1):
b=(N-r*R-g*G)/B
if b.is_integer() and b>=0:
counter += 1
print(counter)
|
R,G,B,N=list(map(int,input().split()))
counter=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:
counter += 1
print(counter)
|
p03048
|
R,G,B,N=list(map(int,input().split()))
counter=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:
counter += 1
print(counter)
|
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=list(map(int,input().split()))
ans=0
for i in range(1+n//r):
red=i*r
for j in range(1+n//g):
green=j*g
if((n-red-green)%b==0 and (n-red-green)>=0):
ans+=1
print(ans)
|
r,g,b,n=list(map(int,input().split()))
ans=0
for i in range(1+n//r):
red=i*r
for j in range(1+(n-red)//g):
green=j*g
if((n-red-green)%b==0 and (n-red-green)>=0):
ans+=1
print(ans)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for i in range((N//R)+1):
r = i
for j in range(((N-R*r)//G)+1):
g = j
if (N-R*r-G*g) % B == 0 and N-R*r-G*g >= 0:
ans += 1
print(ans)
|
def main():
R, G, B, N = list(map(int, input().split()))
ans = 0
for i in range((N//R)+1):
r = i
for j in range(((N-R*r)//G)+1):
g = j
if (N-R*r-G*g) % B == 0 and N-R*r-G*g >= 0:
ans += 1
print(ans)
if __name__=='__main__':
main()
|
p03048
|
from collections import defaultdict, deque, Counter
def inpl(): return list(map(int, input().split()))
R, G, B, N = inpl()
ans = 0
for r in range(N//R + 1):
for g in range(N//G + 1):
tmp = N - R*r - G*g
if tmp >= 0 and (tmp%B == 0):
ans += 1
print(ans)
|
from collections import defaultdict, deque, Counter
def inpl(): return list(map(int, input().split()))
R, G, B, N = inpl()
ans = 0
for r in range(N//R + 1):
for g in range(N//G + 1):
tmp = N - R*r - G*g
if tmp < 0:
break
if (tmp%B == 0):
ans += 1
print(ans)
|
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 - R * i - G * j
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 - R * i) // G + 1):
b = N - R * i - G * j
if b >= 0 and b % B == 0:
res += 1
print(res)
|
p03048
|
I=lambda:list(map(int,input().split()))
R,G,B,N=I()
r=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:
r+=1
# print(i,j,N-i-j)
print(r)
|
I=lambda:list(map(int,input().split()))
R,G,B,N=I()
r=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:
r+=1
print(r)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N // R + 1):
if N - r * R < 0:
break
for g in range((N - R * r) // G + 1):
tmp = N - r * R - g * G
if tmp < 0:
break
if tmp % B == 0 and 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):
tmp = N - r * R - g * G
if tmp % B == 0:
ans += 1
print(ans)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
c = 0
for r in range(0, N+1):
for g in range(0, N+1):
n = N-r*R-g*G
if n < 0:
continue
if n%B == 0:
c += 1
print(c)
|
R, G, B, N = list(map(int, input().split()))
R, G, B = sorted([R, G, B], reverse=True)
if B == 1:
c = 0
for r in range(0, N+1):
if r*R > N:
break
n = N-r*R
c += 1+n//G
print(c)
exit()
c = 0
for r in range(0, N+1):
if r*R > N:
break
for g in range(0, N+1):
if r*R+g*G > N:
break
n = N-r*R-g*G
if n%B == 0:
c += 1
print(c)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
r = N//R
g = N//G
ans = 0
for i in range(r+1):
for j in range(g+1):
tmp = N - R*i - G*j
if tmp >= 0 and tmp%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):
b=N-(R*i+G*j)
if b==0 or b%B==0:
ans+=1
print(ans)
|
p03048
|
R,G,B,N=list(map(int,input().split()))
tmp=0
for i in range(N//R+1):
for j in range((N-R*i)//G+1):
if (R*i+G*j)<=N and (N-(R*i+G*j))%B==0:
tmp+=1
print(tmp)
|
R,G,B,N=list(map(int,input().split()))
tmp=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:
tmp+=1
print(tmp)
|
p03048
|
R, G, B ,N = list(map(int, input().split()))
cnt = 0
NR = N//R
NG = N//G
for r in range(NR + 1):
for g in range(NG + 1):
NrRgG = N - (r*R + g*G)
if NrRgG < 0:
break
elif NrRgG >= 0:
if NrRgG % B == 0:
cnt += 1
print(cnt)
|
R, G, B ,N = list(map(int, input().split()))
RGB = [R, G, B]
RGB.sort(reverse=True)
R = RGB[0]
G = RGB[1]
B = RGB[2]
cnt = 0
NR = N//R
NG = N//G
for r in range(NR + 1):
for g in range(NG + 1):
NrRgG = N - (r*R + g*G)
if NrRgG < 0:
break
elif NrRgG >= 0:
if NrRgG % 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//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()))
count = 0
for r in range(0, N+1, R):
for g in range(0, N+1-r, G):
val = (N - r - g)
if val % B == 0 and val >= 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-r*R)//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-r*R)//G + 1):
val = N - (r*R + g*G)
if val % B == 0 and val >= 0:
cnt += 1
print(cnt)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
ret = 0
for r in range(N//R+1):
for g in range((N-r)//G+1):
if N - (R*r+G*g) >= 0:
if (N - (R*r+G*g)) % B == 0:
ret += 1
print(ret)
|
R, G, B, N = list(map(int, input().split()))
R, G, B = sorted([R, G, B], reverse=True)
ret = 0
for r in range(N//R+1):
if G == 1:
ret += N-r+1
else:
for g in range((N-r)//G+1):
if N - (R*r+G*g) >= 0:
if (N - (R*r+G*g)) % B == 0:
ret += 1
print(ret)
|
p03048
|
def main():
r,g,b,n = list(map(int, input().split()))
tmp = [r,g,b]
r,g,b = sorted(tmp, reverse=True)
res = 0
for i in range(n//r + 1):
for j in range(n//g + 1):
if r*i + g*j <= n:
if (n-(r*i + g*j)) % b==0:
res += 1
print(res)
if __name__ == '__main__':
main()
|
def main():
r,g,b,n = list(map(int, input().split()))
tmp = [r,g,b]
r,g,b = sorted(tmp, reverse=True)
res = 0
for i in range(n//r + 1):
if i*r > n:
break
for j in range(n//g + 1):
if r*i + g*j > n:
break
if (n-(r*i + g*j)) % b==0:
res += 1
print(res)
if __name__ == '__main__':
main()
|
p03048
|
r, g, b, n = list(map(int, input().split()))
cnt = 0
for i in range(n+1):
for j in range(n+1):
a = n - r*i - g*j
if a >= 0 and a % b == 0:
cnt += 1
print(cnt)
|
r, g, b, n = list(map(int, input().split()))
cnt = 0
for i in range(n+1):
for j in range(n-i+1):
a = n - r*i - g*j
if a >= 0 and a % b == 0:
cnt += 1
print(cnt)
|
p03048
|
R,G,B,N = list(map(int,input().split()))
ans = 0
for r in range(int(N/R)+1):
for g in range(int(N/G)+1):
if N-(r*R+g*G) >= 0 and (N-(r*R+g*G))%B == 0:
# print(r,g,(N-(r*R+g*G))%B)
ans += 1
print(ans)
|
R,G,B,N = list(map(int,input().split()))
ans = 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) >= 0 and (N-(r*R+g*G))%B == 0:
# print(r,g,(N-(r*R+g*G))%B)
ans += 1
print(ans)
|
p03048
|
# -*- coding: utf-8 -*-
r, g, b, n = list(map(int, input().split()))
count = 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) >= 0:
count += 1
# for i in range(0, n+1):
# for j in range(0, n+1):
# for k in range(0, n+1):
# if r*i + g*j + b*k == n:
# count += 1
print(count)
|
# -*- coding: utf-8 -*-
r, g, b, n = list(map(int, input().split()))
count = 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:
count += 1
# やってはいけないやつ
# for i in range(0, n+1):
# for j in range(0, n+1):
# for k in range(0, n+1):
# if r*i + g*j + b*k == n:
# count += 1
print(count)
|
p03048
|
r,g,b,n = list(map(int,input().split()))
result = 0
max_r = n // r
for i in range(max_r + 1):
max_g = (n - i * r) // g + 1
for j in range(max_g):
if i * r + j * g > n:
continue
if (n - i * r - j * g ) % b == 0:
result += 1
print(result)
|
r,g,b,n = list(map(int,input().split()))
result = 0
max_r = n // r
for i in range(max_r + 1):
max_g = (n - i * r) // g
for j in range(max_g + 1):
if (n - i * r - j * g ) % b == 0:
result += 1
print(result)
|
p03048
|
R, G, B, N = list(map(int, input().split()))
cnt = 0
for r in range(N//R + 1):
for b in range(N//B + 1):
res = (N - r*R - b*B)
if res >= 0 and res%G == 0:
cnt += 1
print(cnt)
|
def main():
R, G, B, N = list(map(int, input().split()))
cnt = 0
for r in range(N//R + 1):
for b in range(N//B + 1):
res = (N - r*R - b*B)
if res >= 0 and res%G == 0:
cnt += 1
print(cnt)
if __name__ == "__main__":
main()
|
p03048
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.