input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
iN = int(eval(input()))
iLim = int(iN**0.5) + 1
iMinMax = len(str(iN))
for i in range(iLim+1,0,-1):
if iN % i == 0:
iMax = len(str(max(i,iN//i)))
if iMinMax < iMax :
print(iMinMax)
exit()
else:
iMinMax = iMax
print(iMinMax)
| def 解():
iN = int(eval(input()))
iLim = int(iN**0.5) + 1
iMinMax = len(str(iN))
for i in range(iLim+1,0,-1):
if iN % i == 0:
iMax = len(str(max(i,iN//i)))
if iMinMax < iMax :
print(iMinMax)
exit()
else:
iMinMax = iMax
print(iMinMax)
解()
| p03775 |
n = int(eval(input()))
i = 1
divisor = (1 + n) // 2
min_value = 10 ** 10 + 1
while i <= divisor:
if n % i == 0:
divisor = min(n // i, divisor)
if max(len(str(i)),len(str(n // i))) > min_value:
break
min_value = min(min_value,max(len(str(i)),len(str(n // i))))
i += 1
print(min_value)
| n = int(eval(input()))
i = 1
divisor = n ** 0.5
min_value = 10 ** 10 + 1
while i < divisor + 1:
if n % i == 0:
min_value = min(min_value,max(len(str(i)),len(str(n // i))))
i += 1
print(min_value) | p03775 |
N = int(eval(input()))
x = round(N**0.5)
while N%x != 0:
x -= 1
print((len(str(N//x)))) |
import sys
stdin = sys.stdin
ns = lambda : stdin.readline().rstrip()
na = lambda : list(map(int, stdin.readline().split()))
ni = lambda : int(ns())
def main():
n = ni()
if n == 1:
print((1))
return
nagasa = lambda x: len(str(x))
def f(a, b):
x = nagasa(a)
y = nagasa(b)
return x if x > y else y
def divi(n):
res = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
res.append(i)
if i != n // i:
res.append(n // i)
return res
x = divi(n)
ans = 1e9
for a in x:
b = n // a
ans = min(ans, f(a, b))
print(ans)
main() | p03775 |
N = int(eval(input()))
ans = 10
for n in range(1, N+1):
q, r = divmod(N, n)
if n > q:
break
if r == 0:
d = max(len(str(n)), len(str(q)))
if ans > d:
ans = d
print(ans)
| N = int(eval(input()))
print((min([len(str(N//n)) for n in range(1, int(N**0.5) + 1) if N % n < 1])))
| p03775 |
n=int(eval(input()))
m=int((n**(1/2))//1+1)
l=[]
for i in list(range(m+1))[:0:-1]:
if n%i==0:
l.append(max(len(str(i)),len(str(n//i))))
if len(l)==3:
break
print((min(l))) | n=int(eval(input()))
m=int((n**(1/2))//1+1)
l=[]
for i in list(range(m+1))[:0:-1]:
if n%i==0:
l.append(max(len(str(i)),len(str(n//i))))
if len(l)==2:
break
print((min(l))) | p03775 |
n=int(eval(input()))
m=int((n**(1/2))//1+1)
l=[]
for i in list(range(m+1))[:0:-1]:
if n%i==0:
l.append(max(len(str(i)),len(str(n//i))))
if len(l)==2:
break
print((min(l))) | n=int(eval(input()))
m=int((n**(1/2))//1+1)
l=[]
for i in list(range(m+1))[:0:-1]:
if n%i==0:
l.append(max(len(str(i)),len(str(n//i))))
break
print((min(l))) | p03775 |
n=int(eval(input()))
m=int((n**(1/2))//1+1)
l=[]
for i in list(range(m+1))[:0:-1]:
if n%i==0:
l.append(max(len(str(i)),len(str(n//i))))
break
print((min(l))) | n=int(eval(input()))
a=0
l=[]
for i in range(int(n**(1/2))+1)[:0:-1]:
if n%i==0:
a+=1
l.append(max(len(str(i)),len(str(n//i))))
if a==3:break
print((min(l))) | p03775 |
n=int(eval(input()))
a=0
l=[]
for i in range(int(n**(1/2))+1)[:0:-1]:
if n%i==0:
a+=1
l.append(max(len(str(i)),len(str(n//i))))
if a==3:break
print((min(l))) | from math import sqrt
n=int(eval(input()))
for i in range(int(sqrt(n)),0,-1):
if n%i==0:
print((max(len(str(i)),len(str(n//i)))))
exit()
| p03775 |
N = int(eval(input()))
yaku = []
for i in range(1, N+1):
if N % i == 0:
if i in yaku:
break
if N/i <= i:
yaku.append(i)
break
yaku.append(i)
yaku.append(int(N/i))
yaku.sort()
ans = str(yaku[len(yaku)//2])
print((len(ans)))
| N = int(eval(input()))
yaku = []
for i in range(1, N+1):
if N % i == 0:
if i in yaku:
break
if N/i <= i:
yaku.append(i)
break
yaku.append(i)
yaku.append(N//i)
elif N/i < i:
break
yaku.sort()
ans = str(yaku[len(yaku)//2])
print((len(ans)))
| p03775 |
import math
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
n=int(eval(input()))
if is_prime(n):
print((len(str(n))))
exit()
ns=int(math.sqrt(n)//1)
for i in range(ns,n+1):
a=n/i
if a%1==0:
s=i
break
s=str(s)
print((len(s))) | from math import sqrt
n=int(eval(input()))
sn=int(sqrt(n)//1)
for i in range(sn,0,-1):
if n%i==0:
s=n//i
break
print((len(str(s)))) | p03775 |
import math
n = int(eval(input()))
s = int(math.sqrt(n))
for i in range(s,n+1):
if n%i == 0:
print((max(len(str(i)),len(str(n//i)))))
exit() | import math
n = int(eval(input()))
s = int(math.sqrt(n))
for i in range(s,0,-1):
if n%i == 0:
print((max(len(str(i)),len(str(n//i)))))
exit() | p03775 |
import sys
N=int(eval(input()))
ans=[]
if N==1:
print((1))
sys.exit()
for i in range(int(N**0.5)-1,N+1):
if N%i==0:
a=str(i)
print((len(a)))
sys.exit() | import sys
N=int(eval(input()))
ans=[]
if N==1:
print((1))
sys.exit()
for i in range(int(N**0.5),0,-1):
if N%i==0:
a=str(N//i)
print((len(a)))
sys.exit()
| p03775 |
from collections import defaultdict
n = int(eval(input()))
fact = defaultdict(int)
fact[1] = 1
f = 2
k = n
while f * f <= min(k * k, n):
if k % f == 0:
fact[f] += 1
k //= f
else:
f += 1
if k > 1:
fact[k] += 1
def digits(n):
ret = 0
while n > 0:
ret += 1
n //= 10
return ret
def dfs(index, mul, fact):
if index >= len(fact):
return max(digits(mul), digits(n // mul))
k, v = fact[index]
ret = 10
for i in range(v + 1):
ret = min(ret, dfs(index + 1, mul * pow(k, i), fact))
return ret
print((dfs(0, 1, list(fact.items())))) | n = int(eval(input()))
ans = 10
i = 1
def dig(n):
ret = 0
while n > 0:
ret += 1
n //= 10
return ret
while i*i <= n:
if n % i == 0:
ans = min(ans, max(dig(i), dig(n//i)))
i += 1
print(ans) | p03775 |
N = int(eval(input()))
def check(a, b):
return max(len(str(a)), len(str(b)))
n = int(N ** (1/2))
#arr =[]
res = check(1, N)
i = 1
while i <= n:
if N % i == 0:
res = min(res, check(i,int(N / i)))
i += 1
print(res) | N = int(eval(input()))
n = int(N**.5)
res = len(str(N))
for i in range(2,n+1):
if N % i == 0:
#print(len(str(i)),len(str(N/i)))
f = max(len(str(i)),len(str(N//i)))
res = min(res, f)
# print(i, len(str(i)),len(str(N/i)),res, f)
print(res)
| p03775 |
n = int(eval(input()))
def myfunc(a, b):
if len(str(a)) > len(str(b)):
return len(str(a))
return len(str(b))
ans = len(str(n))
i = 1
sqrt_n = n ** 0.5
while i <= sqrt_n:
if n % i == 0:
ans = min(ans, myfunc(i, n // i))
i += 1
print(ans) | n = int(eval(input()))
def myfunc(a, b):
len_a = len(str(a))
len_b = len(str(b))
return max(len_a, len_b)
n_sqrt = n ** 0.5
i = 1
MIN = n
while i <= n_sqrt:
if n % i == 0:
MIN = min(MIN, myfunc(i, n // i))
i += 1
print(MIN) | p03775 |
def main():
def f(a, b):
return max(len(str(a)), len(str(b)))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
n = int(eval(input()))
divisors = make_divisors(n)
ans = float('inf')
for a in divisors:
b = n // a
ans = min(ans, f(a, b))
print(ans)
if __name__ == '__main__':
main()
| def f(a, b):
return len(str(max(a, b)))
def main():
n = int(eval(input()))
ans = 100
for i in range(1, int(n ** 0.5 + 0.5) + 1):
if n % i == 0:
ans = min(ans, f(i, n // i))
print(ans)
if __name__ == '__main__':
main()
| p03775 |
N=int(eval(input()))
L=int(N**0.5)
for a in range(L+1,0,-1):
if N%a==0:
ans1=len(str(a))
ans2=len(str(str(N//a)))
print((max(ans1,ans2)))
exit()
| N=int(eval(input()))
L=int(N**0.5)
for a in range(L,0,-1):
if N%a==0:
ans1=len(str(a))
ans2=len(str(str(N//a)))
print((max(ans1,ans2)))
exit()
| p03775 |
import math
n = int(eval(input()))
rootn = int(math.sqrt(n))
ct = 0
for i in range(rootn,n+1):
if n%i == 0:
tmp = i
while tmp//10 != 0:
ct += 1
tmp = tmp//10
break
print((ct+1)) | import math
n = int(eval(input()))
rootn = int(math.sqrt(n))
ct = 0
for i in reversed(list(range(1,rootn+1))):
if n%i == 0:
tmp = n//i
while tmp//10 != 0:
ct += 1
tmp = tmp//10
break
print((ct+1)) | p03775 |
N = int(eval(input()))
A = 1
ans = len(str(N))
while A**2 <= N:
if N % A != 0:
# Bが整数にならない
A += 1
continue
B = N // A
cur = max(len(str(A)), len(str(B)))
ans = min(ans, cur)
A += 1
print(ans) | N = int(eval(input()))
ans = len(str(N)) # Fの値は高々この値
for A in range(1, int(N**0.5) + 1):
if N % A != 0: # AはNの約数でない
continue
B = N // A
f = len(str(max(A,B)))
ans = min(ans, f)
print(ans) | p03775 |
n = int(eval(input()))
a = 1
b = 1
mx = 10 ** 10
while (a <= b and a <= n):
if n % a == 0:
b = int(n / a)
mx = min(mx, max(a, b))
a += 1
print((len(str(mx))))
| n = int(eval(input()))
a = 1
b = 1
mx = 10 ** 10
while (a <= b and a <= 10**5):
if n % a == 0:
b = int(n / a)
mx = min(mx, max(a, b))
a += 1
print((len(str(mx)))) | p03775 |
n = int(eval(input()))
a = 1
b = 1
mx = 10 ** 10
while (a <= b and a <= 10**5):
if n % a == 0:
b = int(n / a)
mx = min(mx, max(a, b))
a += 1
print((len(str(mx)))) | n = int(eval(input()))
a = 1
b = 1
mx = 10 ** 10
while (a <= b and a * a <= n):
if n % a == 0:
b = int(n / a)
mx = min(mx, max(a, b))
a += 1
print((len(str(mx))))
| p03775 |
def PrimeDecomp(N,ConcFlag):
if ConcFlag:
if N<=1:
return [1],1
else:
I = 2
PrimeDec = []
DivCount = 1
while I*I<=N:
Cnt = 0
while N%I==0:
N //= I
PrimeDec.append(I)
if Cnt>=1:
DivCount *= (Cnt+1)
I += 1
if N>=2:
PrimeDec.append(N)
DivCount *= 2
return PrimeDec,DivCount
else:
if N<=1:
return [1],[1],1
else:
I = 2
PrimeDec = []
PrimeCnt = []
DivCount = 1
while I*I<=N:
Cnt = 0
while N%I==0:
N //= I
Cnt += 1
if Cnt>=1:
PrimeDec.append(I)
PrimeCnt.append(Cnt)
DivCount *= (Cnt+1)
I += 1
if N>=2:
PrimeDec.append(N)
PrimeCnt.append(1)
DivCount *= 2
return PrimeDec,PrimeCnt,DivCount
from itertools import combinations
from operator import mul
from functools import reduce
N = int(eval(input()))
PrimeDec,_ = PrimeDecomp(N,True)
FABMax = len(str(N))
for TR in range(1,len(PrimeDec)+1):
for A in set(reduce(mul,T) for T in combinations(PrimeDec,TR)):
B = N//A
FABMax = min(FABMax,max(len(str(A)),len(str(B))))
print(FABMax) | def Divisor(N):
Left,RightRev = [],[]
I = 1
while I*I<=N:
if N%I==0:
Left.append(I)
if I!=N//I:
RightRev.append(N//I)
I += 1
Div = Left+RightRev[::-1]
DivCount = len(Div)
return Div,DivCount
N = int(eval(input()))
Div,_ = Divisor(N)
FABMax = len(str(N))
for A in Div:
B = N//A
if A>B:
break
FABMax = min(FABMax,max(len(str(A)),len(str(B))))
print(FABMax) | p03775 |
n = int(eval(input()))
l = []
for a in range(1, int(n**0.5) + 1):
if n % a == 0:
b = n // a
f = max(len(str(a)), len(str(b)))
l.append(f)
print((min(l))) | n = int(eval(input()))
l = []
for a in range(1, int(n**0.5) + 1):
if n % a == 0:
b = n // a
l.append(max(len(str(a)), len(str(b))))
print((min(l))) | p03775 |
import itertools
def f(a, b):
return max(len(str(a)), len(str(b)))
def p(n):
l = []
a, b = 0, 2
while b * b <= n:
if n % b == 0:
n //= b
l += [b]
else:
b += 1 + a
a = 1
if n > 1 : l += [n]
return l
N = int(eval(input()))
l = p(N)
if len(l) < 2:
print((f(N, 1)))
else:
w = len(l)
ans = len(str(N))
for i in itertools.product([0, 1], repeat=w):
a = b = 1
for j in range(w):
if i[j] == 0:
a *= l[j]
else:
b *= l[j]
ans = min(ans, f(a, b))
print(ans) | import itertools
def f(a, b):
return max(len(str(a)), len(str(b)))
def p(n):
l = []
a, b = 0, 2
while b * b <= n:
if n % b == 0:
n //= b
l += [b]
else:
b += 1 + a
a = 1
if n > 1 : l += [n]
return l
def main():
N = int(eval(input()))
l = p(N)
if len(l) < 2:
print((f(N, 1)))
else:
w = len(l)
ans = len(str(N))
for i in itertools.product([0, 1], repeat=w):
a = b = 1
for j in range(w):
if i[j] == 0:
a *= l[j]
else:
b *= l[j]
ans = min(ans, f(a, b))
print(ans)
if __name__ == '__main__':
main()
| p03775 |
n = int(eval(input()))
ans = n
for a in range(1, n + 1):
if n % a == 0:
b = n // a
tmp = max(len(str(a)), len(str(b)))
ans = min(ans, tmp)
if a > b:
break
print(ans) | n = int(eval(input()))
ans = n
for a in range(int(n ** (0.5)), 0, -1):
if n % a == 0:
b = n // a
tmp = max(len(str(a)), len(str(b)))
ans = min(ans, tmp)
print(ans) | p03775 |
from math import sqrt
from copy import deepcopy
from functools import reduce
from operator import mul
n = int(eval(input()))
def pf(n):
pfs = []
while n % 2 == 0:
pfs.append(2)
n //= 2
for i in range(3, int(sqrt(n)+1), 2):
while n % i == 0:
pfs.append(i)
n //= i
if n > 2:
pfs.append(n)
return pfs
def partition(pfs):
subsets = [[]]
for i in range(len(pfs)):
for j in range(len(subsets)):
c = deepcopy(subsets[j])
subsets.append(c + [i])
return subsets
pfs = pf(n)
Asubs = partition(pfs)
def digits(n):
ans = 0
while n > 0:
ans += 1
n //= 10
return ans
def calculate(Asubs):
minSoFar = 10
for Asub in Asubs:
if Asub == []:
Asum = 1
else:
Asum = reduce(mul, [pfs[i] for i in Asub])
Bsub = [pfs[i] for i in range(len(pfs)) if i not in Asub]
if Bsub == []:
Bsum = 1
else:
Bsum = reduce(mul, Bsub)
if max(digits(Asum), digits(Bsum)) < minSoFar:
minSoFar = max(digits(Asum), digits(Bsum))
return minSoFar
print((calculate(Asubs))) | from math import sqrt
n = int (eval(input()))
nsqrt = int(sqrt(n))
for i in range(nsqrt, 0, -1):
if n % i == 0:
b = n // i
a = i
break
if i == 1:
b = 1
a = n
def digits(n):
ans = 0
while n > 0:
ans += 1
n //= 10
return ans
print((max(digits(a), digits(b))))
| p03775 |
from functools import reduce
n=int(eval(input()))
def sqdivlist(n):
lista=[]
for i in range(1,int((n**0.5)//1)+1):
if n%i==0:
lista.append(str(i))
return (lista)
lista2=[]
ans=[]
for j in range(len(sqdivlist(n))):
lista2.append(int(n/int((sqdivlist(n))[j])))
ans.append(max(len(str(sqdivlist(n)[j])),(len(str(lista2[j])))))
print((min(ans)))
| from functools import reduce
n=int(eval(input()))
def sqdivlist(n):
lista=[]
for i in range(1,int((n**0.5)//1)+1):
if n%i==0:
lista.append(str(i))
return (lista)
t=len(sqdivlist(n))
u=(sqdivlist(n))
lista2=[]
ans=[]
for j in range(t):
lista2.append(int(n/int(u[j])))
ans.append(max(len(str(u[j])),(len(str(lista2[j])))))
print((min(ans)))
| p03775 |
import math
n=int(eval(input()))
l=math.floor(math.sqrt(n))
k=math.floor(math.log10(n))+1
#print(k)
#print(math.log10(n))
for i in range(2,l+1):
if n%i==0:
a,b=i,n//i
x=max(math.floor(math.log10(a))+1,math.floor(math.log10(b))+1)
k=min(x,k)
print(k)
| import math
n=int(eval(input()))
l=math.floor(math.sqrt(n))
for i in range(l+1,0,-1):
if n%i==0:
a,b=i,n//i
k=max(math.floor(math.log10(a))+1,math.floor(math.log10(b))+1)
break
print(k)
| p03775 |
n = int(input())
s = input()
if n % 2 == 1:
print('No')
exit()
l = int(n/2)
print('Yes') if s[:l] == s[l:] else print('No')
| n = int(input())
s = input()
print('Yes') if s[:n//2] == s[n//2:] else print('No')
| p02860 |
N = int(eval(input()))
S = input().strip()
if N%2==1:
flag = "No"
else:
if S[:N//2]==S[N//2:]:
flag = "Yes"
else:
flag = "No"
print(flag) | N = int(eval(input()))
S = input().strip()
if N%2==1:
print("No")
else:
if S[:N//2]==S[N//2:]:
print("Yes")
else:
print("No") | p02860 |
import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
s = str(readline().rstrip().decode('utf-8'))
if n % 2 == 0:
print(("Yes" if s[:n//2] == s[n//2:] else "No"))
else:
print("No")
if __name__ == '__main__':
solve()
| import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n = int(input().rstrip('\n'))
s = str(input().rstrip('\n'))
if n % 2 == 0:
if s[:n // 2] == s[n//2:]:
print("Yes")
else:
print("No")
else:
print("No")
if __name__ == '__main__':
solve()
| p02860 |
r,g,b,n = list(map(int,input().split(' ')))
rmax, gmax = n//r, n//g
count = 0
i = 0
while i <= rmax:
j = 0
while j <= gmax:
if (n-i*r-j*g) >= 0 and (n-i*r-j*g)%b == 0:
count += 1
j += 1
i += 1
print(count) | r,g,b,n = list(map(int,input().split(' ')))
A = [r,g,b]
A.sort()
r,g,b = A[2], A[1], A[0]
rmax, gmax = n//r, n//g
count = 0
i = 0
while i <= rmax:
j = 0
if g == 1:
count += (n-i*r)+1
j += 30000
while (n-i*r-j*g) >= 0:
if (n-i*r-j*g)%b == 0:
count += 1
j += 1
i += 1
print(count) | 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 (N - R*i - G*j) >= 0 and (N - R*i - G*j) % B == 0:
count += 1
print(count)
| R, G, B, N = list(map(int, input().split()))
count = 0
for i in range(N // R + 1):
n = N - R * i
for j in range(n // G + 1):
if (n - G*j) >= 0 and (n - G*j) % B == 0:
count += 1
print(count)
| p03048 |
R, G, B, N = list(map(int, input().split()))
count = 0
for i in range(N // R + 1):
n = N - R * i
for j in range(n // G + 1):
if (n - G*j) >= 0 and (n - G*j) % B == 0:
count += 1
print(count)
| R, G ,B, N = list(map(int, input().split()))
tmp = [R, G, B]
tmp.sort()
R, G, B = tmp[2], tmp[1], tmp[0]
num_R = N // R + 1
num_G = N // G
RG = [[N - R*i for i in range(num_R)]]
for j in range(num_G):
RG.append([RG[-1][i] - G for i in range(num_R)])
check = lambda x: 0 if x < 0 else 1 if x == 0 else 1 if x%B == 0 else 0
a = []
count = 0
for i in range(len(RG)):
a = list(map(check, RG[i]))
count += sum(a)
print(count)
| p03048 |
r, g, b, n = list(map(int, input().split()))
cnt = 0
for i in range(3001):
for j in range(3001):
x = n - (r * i + g * j)
if x < 0:
continue
if x % 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_num = r * i
for j in range(int((n - r_num)//g)+1):
g_num = g * j
b_num = (n - r_num - g_num)
if b_num >= 0 and b_num % b == 0:
cnt += 1
print(cnt)
| p03048 |
r, g, b, n = list(map(int, input().split()))
cnt = 0
for i in range(int(n//r)+1):
r_num = r * i
for j in range(int((n - r_num)//g)+1):
g_num = g * j
b_num = (n - r_num - g_num)
if b_num >= 0 and b_num % b == 0:
cnt += 1
print(cnt)
|
def main():
r, g, b, n = list(map(int, input().split()))
cnt = 0
for i in range(int(n//r)+1):
r_num = r * i
for j in range(int((n - r_num)//g)+1):
g_num = g * j
b_num = (n - r_num - g_num)
if b_num >= 0 and b_num % b == 0:
cnt += 1
print(cnt)
if __name__ == "__main__":
main() | p03048 |
rn,gn,bn,n=list(map(int,input().split()))
nn=sorted([rn,gn,bn])
print((sum(n-nn[0]*r-nn[1]*g >=0 and (n-nn[0]*r-nn[1]*g)%nn[2]==0 for r in range(1+n//nn[0]) for g in range(1+n//nn[1])))) | rn,gn,bn,n=list(map(int,input().split()))
nn=sorted([rn,gn,bn])
c=0
for r in range(1+n//nn[0]):
rt=n-nn[0]*r
for g in range(1+rt//nn[1]):
gt=rt-nn[1]*g
if gt%nn[2]==0:
c+=1
print(c) | 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):
d = N - R * r - G * g
if d == 0 or (d > 0 and d % B == 0):
ans += 1
print(ans) | R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N // R + 1):
d = N - R * r
for g in range(d // G + 1):
dd = d - G * g
if dd == 0 or (dd > 0 and dd % B == 0):
ans += 1
print(ans) | p03048 |
def ii():return int(eval(input()))
def iim():return list(map(int,input().split()))
def iil():return list(map(int,input().split()))
def ism():return list(map(str,input().split()))
def isl():return list(map(str,input().split()))
r,g,b,n = iim()
ans = 0
for i in range(n//r+1):
for j in range(n//g+1):
num = n-i*r-j*g
if num%b == 0 and num//b >= 0:
# print(i,j,num//b)
ans += 1
print(ans) | def ii():return int(eval(input()))
def iim():return list(map(int,input().split()))
def iil():return list(map(int,input().split()))
def ism():return list(map(str,input().split()))
def isl():return list(map(str,input().split()))
#pythonだとTLE/pypyだとAC
'''
r,g,b,n = iim()
ans = 0
for i in range(n//r+1):
for j in range(n//g+1):
num = n-i*r-j*g
if num%b == 0 and num//b >= 0:
# print(i,j,num//b)
ans += 1
print(ans)
'''
#上を受けてpythonでも通るように改良
*num,n = iim()
a,b,c = list(map(int,sorted(num)))
ans = 0
for i in range(n//c+1):
if a!= 1:
for j in range(n//b+1):
num = n-i*c-j*b
if num%a == 0 and num//a >= 0:
ans += 1
else:
ret = n - i*c
ans += ret//b+1
print(ans)
| p03048 |
def main():
red_box, green_box, blue_box, target = list(map(int, input().split()))
answer = 0
for i in range(target // red_box + 1):
for j in range(target // green_box + 1):
now_balls = red_box * i + green_box * j
if (target - now_balls) % blue_box == 0 and target >= now_balls:
answer += 1
print(answer)
if __name__ == '__main__':
main()
| def main():
red_box, green_box, blue_box, target = list(map(int, input().split()))
answer = 0
for i in range(target // red_box + 1):
for j in range(target // green_box + 1):
now_balls = red_box * i + green_box * j
if (target - now_balls) % blue_box == 0 and target >= now_balls:
answer += 1
elif target < now_balls:
break
print(answer)
if __name__ == '__main__':
main()
| p03048 |
def main():
red_box, green_box, blue_box, target = list(map(int, input().split()))
answer = 0
for i in range(target // red_box + 1):
for j in range(target // green_box + 1):
now_balls = red_box * i + green_box * j
if (target - now_balls) % blue_box == 0 and target >= now_balls:
answer += 1
elif target < now_balls:
break
print(answer)
if __name__ == '__main__':
main()
| from math import ceil
def main():
r, g, b, n = list(map(int, input().split()))
answer = 0
for i in range(n + 1):
for j in range(n + 1 - i * r):
left = n - i * r - j * g
if left >= 0 and left % b == 0:
answer += 1
print(answer)
if __name__ == '__main__':
main()
| p03048 |
read = input
A = list(map(int, read().split()))
n = A[-1]
A = A[:3]
A.sort() # ascending
ans = 0
# print(A)
for i in range(n+1):
for j in range(n+1):
tmp = A[0]*i + A[1] * j
if tmp > n:break
tmp = n - tmp
if tmp % A[2] == 0:
# print(i, j, tmp//A[2])
ans += 1
print(ans) | read = input
A = list(map(int, read().split()))
n = A[-1]
A = A[:3]
A.sort(reverse=True) # descending
ans = 0
if A[1] == A[2] and A[1] == 1: #deal with 1 1
for i in range(n+1):
tmp = i*A[0]
if tmp > n:break
# print(ans, i, A)
ans += (n-tmp) - 0 + 1
else :
for i in range(n+1):
for j in range(n+1):
tmp = i * A[0] + j * A[1]
if tmp > n:break
tmp = n - tmp
if tmp % A[2] == 0:
# print(i, j, tmp//A[2])
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:
continue
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 |
#input
a = list(map(int,input().split())) #input from array of integer like "1 2 3"
n = a[3]
a = a[:3]
range_r = n//a[0]+1
range_g = n//a[1]+1
cnt = 0
for r in range(range_r):
for g in range(range_g):
rg = r*a[0]+g*a[1]
if rg > n:
break
if (n - rg)%a[2]==0:
cnt += 1
print(cnt) | #input
a = list(map(int,input().split())) #input from array of integer like "1 2 3"
n = a[3]
a = a[:3]
range_r = n//a[0]+1
range_g = n//a[1]+1
cnt = 0
for r in range(range_r):
for g in range((n-r*a[0])//a[1]+1):
rg = r*a[0]+g*a[1]
if (n - rg)%a[2]==0:
cnt += 1
print(cnt) | p03048 |
R,G,B,n=list(map(int,input().split()))
sum_rg=[]
for r in range(n+1):
for g in range(n+1):
Rr,Gg=R*r,G*g
if Rr+Gg>n:
break
else:
sum_rg.append(n-Rr-Gg)
count=0
for i in sum_rg:
if not i%B:
count+=1
print(count) | R,G,B,n=list(map(int,input().split()))
sum_rg=[0 for i in range(n+1)]
for r in range(n+1):
for g in range(n+1):
tmp=R*r+G*g
if tmp>n:
break
else:
#print(f'Bb:{n-tmp}')
sum_rg[n-tmp]+=1
#print(sum_rg)
count=0
for i in range(n//B+1):
count+=sum_rg[i*B]
print(count) | p03048 |
import math
line=input().split(" ")
n=int(line[3])
r=int(line[0])
g=int(line[1])
b=int(line[2])
nline=sorted([r,g,b])
x=int(nline[2])
y=int(nline[1])
z=int(nline[0])
answers=0
#print(x,y,z,n)
for i in range(math.ceil(n/x)+1):
a=i
for j in range(math.ceil(n/y)+1):
b=j
c=(n-a*x-b*y)/z
if c>=0 and (n-a*x-b*y)%z==0:
answers+=1
#print(a,b,c)
print(answers) | # coding: utf-8
# Your code here!
import math
line=input().split(" ")
n=int(line[3])
r=int(line[0])
g=int(line[1])
b=int(line[2])
nline=sorted([r,g,b])
x=int(nline[2])
y=int(nline[1])
z=int(nline[0])
answers=0
#print(x,y,z,n)
for i in range(math.ceil(n/x)+1):
a=i
if z!=1:
for j in range(math.ceil((n-a*x)/y)+1):
b=j
c=(n-a*x-b*y)/z
if c>=0 and (n-a*x-b*y)%z==0:
answers+=1
#print(a,b,c)
else:
if n-a*x>=0:
if n-a*x==0:
answers+=1
#print('a', 1)
elif (n-a*x)%y!=0:
answers+=math.ceil((n-a*x)/y)
#print('b', math.ceil((n-a*x)/y))
else:
answers+=(math.ceil((n-a*x)/y)+1)
#print('c', math.ceil((n-a*x)/y)+1)
print(answers) | p03048 |
R, G, B, N = list(map(int, input().split()))
count = 0
r_max = int(N / R)+1
g_max = int(N / G)+1
for r in range(r_max):
rest_val = N - R*r
for g in range(g_max):
rest_val2 = rest_val - G * g
if rest_val2 % B == 0 and rest_val2 >= 0:
# print "r="+str(r)+",g="+str(g)+",b="+str(rest_val2/B)
count += 1
print(count) | R, G, B, N = list(map(int, input().split()))
count = 0
r_max = int(N / R)+1
g_max = int(N / G)+1
for r in range(r_max):
rest_val = N - R*r
for g in range(g_max):
rest_val2 = rest_val - G * g
if rest_val2 < 0: break
if rest_val2 % B == 0:
# print "r="+str(r)+",g="+str(g)+",b="+str(rest_val2/B)
count += 1
print(count) | p03048 |
r,g,b,n = list(map(int,input().split()))
ans = 0
rmax = n//r
gmax = n//g
for i in range(rmax+1):
for j in range(gmax+1):
rest = n-r*i-g*j
flag = rest>=0 and rest%b==0
if flag: ans += 1
print(ans)
|
r,g,b,n = list(map(int,input().split()))
ans = 0
rmax = n//r
for i in range(rmax+1):
rest = n-r*i
gmax = rest//g
for j in range(gmax+1):
rest = n-r*i-g*j
if rest%b==0: ans += 1
print(ans)
| p03048 |
R, G, B, n = list(map(int, input().split()))
cnt = []
for r in range(n//R + 1):
nn = n - r*R
for g in range(nn//G + 1):
nnn = nn - g*G
if nnn % B == 0:
cnt.append([r, g, nnn // B])
print((len(cnt)))
| a, b, c, n = list(map(int, input().split()))
cnt = 0
for i in range(n//a+1):
an = n - a * i
for j in range(an//b+1):
num = an - b * j
if num >= 0 and num % c == 0:
cnt+=1
print(cnt) | p03048 |
a, b, c, n = list(map(int, input().split()))
cnt = 0
for i in range(n//a+1):
an = n - a * i
for j in range(an//b+1):
num = an - b * j
if num >= 0 and num % c == 0:
cnt+=1
print(cnt) | a, b, c, n = list(map(int, input().split()))
cnt = 0
for i in range(n//a+1):
an = n - a * i
if an >= 0:
for j in range(an//b+1):
num = an - b * j
if num >= 0 and num % c == 0:
cnt+=1
print(cnt)
| p03048 |
def main():
R, G, B, N = list(map(int, input().split()))
R, G, B = sorted([R, G, B])
result = 0
for i in range(N // G + 1):
for j in range(N // B + 1):
if (N - G*i - B*j) // R >= 0 and (N - G*i - B*j) % R == 0:
result += 1
print(result)
main() | def main():
R, G, B, N = list(map(int, input().split()))
R, G, B = sorted([R, G, B])
result = 0
for i in range(N // G + 1):
for j in range(N // B + 1):
if (N - G*i - B*j) < 0:
break
elif (N - G*i - B*j) % R == 0:
result += 1
print(result)
main() | p03048 |
# coding: utf-8
R, G, B, N = list(map(int, input().split()))
output = 0
for g in range(N // G + 1):
for b in range(N // B + 1):
if (N - g*G - b*B) % R == 0:
if N >= g*G + b*B:
output += 1
else:
break
print(output)
| # coding: utf-8
R, G, B, N = list(map(int, input().split()))
output = 0
# for g in range(N // G + 1):
# for b in range(N // B + 1):
# if (N - g*G - b*B) % R == 0:
# if N >= g*G + b*B:
# output += 1
# else:
# break
for r in range(N // R + 1):
C = N - r*R
for g in range(C // G + 1):
if (C - g*G) % B == 0:
if C >= g*G:
output += 1
else:
break
print(output)
| p03048 |
import sys,random
try: sys.stdin = open('in.in','r')
except: pass
R,G,B,N = list(map(int,input().split()))
ans = 0
for r in range(0,N+1):
if r*R > N: break
for b in range(0,N+1):
if b*B + r*R > N: break
if (N-b*B-r*R)%G != 0: continue
ans += 1
print(ans)
| import sys,random
try: sys.stdin = open('in.in','r')
except: pass
R,G,B,N = list(map(int,input().split()))
ans = 0
for r in range(0,N+1,R):
for b in range(0,N+1-r,B):
if (N-b-r)%G != 0: continue
ans += 1
print(ans)
| p03048 |
R,G,B,N=(int(i) for i in input().split())
import math
answer=0
for r in range(0,math.floor(N/R)+1):
for g in range(math.floor(N/G)+1):
if R*r+G*g>N:
break
if (N-R*r-G*g)%B==0:
answer+=1
print(answer)
| R,G,B,N=(int(i) for i in input().split())
import math
answer=0
for r in range(0,math.floor(N/R)+1):
for g in range(math.floor(N/G)+1):
sss=R*r+G*g
if sss>N:
break
if (N-sss)%B==0:
answer+=1
print(answer)
| p03048 |
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, G):
val = (N - r - g)
if val % B == 0 and val >= 0:
count += 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(0, N+1-r, G):
val = (N - r - g)
if val % B == 0 and val >= 0:
count += 1
print(count) | p03048 |
from sys import stdin
R, G, B, N = (int(i) for i in input().split())
count = 0
for i in range(N+1):
for j in range(N+1):
b = (N-i*R-j*G)/B
if b.is_integer() and b >= 0:
count +=1
print(count)
| from sys import stdin
R, G, B, N = (int(i) for i in input().split())
count = 0
for i in range(N+1):
N1 = N - i*R
for j in range(N1+1):
b = (N1 - j*G)/B
if b.is_integer() and b >= 0:
count +=1
print(count)
| p03048 |
from sys import stdin
R, G, B, N = (int(i) for i in input().split())
count = 0
for i in range(N+1):
for j in range(N+1):
b = (N-i*R-j*G)/B
if b.is_integer() and b >= 0:
count +=1
print(count)
| from sys import stdin
R, G, B, N = (int(i) for i in input().split())
dp = [0] * (N+1)
dp[0] = 1
for c in (R, G, B):
for i in range(N + 1):
if i + c <= N:
dp[i+c] += dp[i]
print((dp[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):
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()))
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()))
#def cnt2(sum, a, b):
cnt = 0
for rr in range(n // r + 1):
sum = r * rr
rest = n - sum
#cnt += cnt2(rest, g, b)
for gg in range(rest // g + 1):
sum = r * rr + g * gg
rest = n - sum
if rest < 0:
break
if rest % b == 0:
bb = (n-sum) // b
cnt += 1
print(cnt)
| r,g,b,n = list(map(int, input().split()))
cnt = 0
for rr in range(n // r + 1):
for gg in range((n - r * rr) // g + 1):
rest = n - r * rr - g * gg
cnt += (rest % b == 0)
print(cnt)
| 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: continue
if (N-R*r-G*g)%B!=0: continue
ans+=1
print(ans) | def input_list():
return list(map(int, input().split()))
def main():
r, g, b, n = input_list()
ans = 0
for x in range(n//r+1):
for y in range(n//g+1):
rr = r*x
gg = g*y
if rr + gg > n:
continue
bb = (n - rr - gg)
if bb % b != 0:
continue
ans += 1
print(ans)
main() | p03048 |
# -*- coding: utf-8 -*-
in_r, in_g, in_b, n = list(map(int, input().split()))
ans = 0
in_list= [in_r,in_g,in_b]
sorted_list = sorted(in_list)
r = sorted_list[-1]
g = sorted_list[-2]
b = sorted_list[-3]
max_r = n // r
for i in range(max_r+1):
tmp = n - (r * i)
max_g = tmp // g
after_r = tmp
for j in range(max_g+1):
tmp = after_r
tmp = tmp - (g * j)
max_b = tmp // b
after_g = tmp
if tmp%b == 0:
ans = ans + 1
print(ans) | # -*- coding: utf-8 -*-
in_r, in_g, in_b, n = list(map(int, input().split()))
ans = 0
in_list= [in_r,in_g,in_b]
sorted_list = sorted(in_list)
r = sorted_list[-1]
g = sorted_list[-2]
b = sorted_list[-3]
max_r = n // r
for i in range(max_r+1):
tmp = n - (r * i)
max_g = tmp // g
for j in range(max_g+1):
if (tmp - (g * j))%b == 0:
ans = 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):
num=n-R*r-G*g
if num>=0 and num%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):
num=n-R*r-G*g
if num>=0 and num%b==0:
cnt+=1
print(cnt) | p03048 |
R, G, B, N = list(map(int, input().split()))
counter = 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:
b = int((N - R * r - G * g) / B)
#print(r,g,b)
if b >= 0:
counter += 1
print(counter) | R, G, B, N = list(map(int, input().split()))
counter = 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:
counter += 1
print(counter) | p03048 |
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(N + 1):
for g in range(N + 1):
rem = N - (r * R + g * G)
if rem == 0 or (rem > 0 and rem % 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):
rem = N - (r * R + g * G)
if rem < 0:
break
if rem == 0 or (rem > 0 and rem % 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):
V = N - (r * R + g * G)
if V >= 0 and V % 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):
V = N - (r * R + g * G)
if V >= 0 and V % B == 0:
cnt += 1
print(cnt)
| p03048 |
R, G, B, N = list(map(int, input().split()))
color = [R, G, B]
color.sort(reverse = True)
maxr = N // color[0]
maxg = N // color[1]
count = 0
for i in range(maxr+1):
for j in range(maxg+1):
nokori = N - i * color[0] - j * color[1]
amari = nokori % color[2]
if nokori >= 0 and amari == 0:
count += 1
print(count)
| R, G, B, N = list(map(int, input().split()))
color = [R, G, B]
color.sort(reverse = True)
maxr = N // color[0]
count = 0
for i in range(maxr+1):
nokori = N - i * color[0]
maxg = nokori // color[1]
for j in range(maxg+1):
nokorinow = nokori - j * color[1]
amari = nokorinow % color[2]
if amari == 0:
count += 1
print(count)
| p03048 |
R, G, B, N = list(map(int, input().split()))
rgb = []
for i in range(N + 1):
for j in range(N - i + 1):
key = i * R + j * G
key = N - key
if key % B == 0 and key / B >= 0:
rgb.append([i, j, key // B])
#print(rgb)
print((len(rgb))) |
R, G, B, N = list(map(int, input().split()))
rgb = []
for i in range(N + 1):
for j in range(N - (i * R) + 1):
key = i * R + j * G
key = N - key
if key % B == 0 and key / B >= 0:
rgb.append([i, j, key // B])
#print(rgb)
print((len(rgb))) | p03048 |
r,g,b,n = list(map(int, input().split()))
ans = 0
for i in range(n // r + 1):
res = n - r * i
for j in range(res // g + 1):
res2 = res - g * j
if res2 % b == 0:
ans += 1
print(ans) | r,g,b,n = list(map(int, input().split()))
ans = 0
for i in range(n // r + 1):
res = n - r * i
for j in range(res // g + 1):
res2 = res - g * j
if not (res2 % b):
ans += 1
print(ans)
| p03048 |
# AtCoder Grand Contest 033
# https://atcoder.jp/contests/agc033
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))
def main():
R, G, B, N = i2nn()
#a = []
cnt = 0
for r in range(N // R + 1):
for g in range((N - R * r) // G + 1):
#print([r, g, 0], N - R * r - G * g)
if (N - R * r - G * g) % B == 0:
cnt += 1
#a.append([r,g,(N - R * r - G * g) // B])
#print(a)
print(cnt)
main()
| import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))
def main():
R, G, B, N = i2nn()
#a = []
cnt = 0
R, G, B = sorted((R, G, B), reverse=True)
for r in range(N // R + 1):
for g in range((N - R * r) // G + 1):
#print([r, g, 0], N - R * r - G * g)
if (N - R * r - G * g) % B == 0:
cnt += 1
#a.append([r,g,(N - R * r - G * g) // B])
#print(a)
print(cnt)
main() | p03048 |
R,G,B,N = list(map(int,input().split()))
cnt = 0
for x in range(N//R+1):
for y in range(N//G+1):
z = N - R*x - G*y
if z >= 0 and z % B == 0:
cnt += 1
print(cnt) | def main():
R,G,B,N = list(map(int,input().split()))
cnt = 0
for x in range(N//R+1):
for y in range(N//G+1):
z = N - R*x - G*y
if z >= 0 and z % B == 0:
cnt += 1
print(cnt)
if __name__ == "__main__":
main() | p03048 |
R,G,B,N = list(map( int, input().split()))
count = 0
rmax = N//R
gmax = N//G
for r in range(rmax+1):
tmp = r * R
for g in range(gmax+1):
tmp2 = tmp+g*G
if N < tmp2:
break
if ((N - (tmp + g * G)) % B) == 0:
count+=1
print(count)
| R,G,B,N = list(map( int, input().split()))
count = 0
rmax = N//R
gmax = N//G
for r in range(rmax+1):
tmp = r * R
for g in range(gmax+1):
tmp2 = N - (tmp+g*G)
if tmp2 < 0:
break
if (tmp2 % B) == 0:
count+=1
print(count)
| p03048 |
R, G, B, N = list(map(int, input().split()))
count = 0
rgb = sorted([R, G, B], reverse=True)
for i in range(N+1):
for j in range(N+1):
tmp = N - (rgb[0] * i + rgb[1] * j)
if 0 > tmp:
break
if tmp % rgb[2] == 0:
count += 1
print(count)
| R, G, B, N = list(map(int, input().split()))
count = 0
rgb = sorted([R, G, B], reverse=True)
if False:
count = 0
else:
for i in range(N+1):
for j in range(N+1):
tmp = N - (rgb[0] * i + rgb[1] * j)
if 0 > tmp:
break
if tmp % rgb[2] == 0:
count += 1
print(count)
| p03048 |
r,g,b,n = list(map(int,input().split()))
counter = 0
sorts = sorted([r,g,b],reverse=True)
a = (n // sorts[0])+1
c = (n// sorts[1])+1
for i in range(a):
for j in range(c):
left = n - (sorts[0]*i) - (sorts[1]*j)
if left >= 0 and left % sorts[2] == 0:
counter += 1
print(counter) | r,g,b,n = list(map(int,input().split()))
counter = 0
sorts = sorted([r,g,b],reverse=True)
a = (n // sorts[0])+1
for i in range(a):
test = n
test = test-(sorts[0]*i)
c = (test//sorts[1])+1
for j in range(c):
left = test - (sorts[1]*j)
if left >= 0 and left % sorts[2] == 0:
counter += 1
print(counter) | p03048 |
R,G,B,N = list(map(int, input().split()))
co = 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):
co += 1
print(co) | R,G,B,N = list(map(int, input().split()))
co = 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:
co += 1
print(co) | p03048 |
r,g,b,n=list(map(int,input().split()))
cnt=0
for i in range(n+1):
for j in range(n+1):
if (n-i*r-j*g) %b ==0 and 0<=(n-i*r-j*g) // b <= 3000:
# print(i,j,(n-i*r-j*g)//3)
cnt+=1
print(cnt) | 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):
if (n-i*r-j*g) %b ==0 and 0<=(n-i*r-j*g) // b <= 3000:
# print(i,j,(n-i*r-j*g)//3)
cnt+=1
print(cnt) | p03048 |
r,g,b,n=list(map(int,input().split()))
ans=chk=0
for i in range(n+1):
for j in range(n+1):
if (i*r+j*g)>n: break
if (n-(i*r+j*g))%b==0:
ans+=1
print(ans) | def sol():
r,g,b,n=list(map(int,input().split()))
ans=chk=0
for i in range(n+1):
for j in range(n+1):
if (i*r+j*g)>n: break
if (n-(i*r+j*g))%b==0:
ans+=1
print(ans)
if __name__ == '__main__':
sol() | 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):
res = N - (r*R+g*G)
if res == 0 or 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//R+1):
for g in range(N//G+1):
res = N - (r*R+g*G)
if res >= 0 and res % B == 0:
cnt += 1
print(cnt) | p03048 |
def main():
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):
res = N - (r*R+g*G)
if res >= 0 and res % B == 0:
cnt += 1
print(cnt)
main() | def main():
R, G, B, N = list(map(int, input().split()))
cnt = 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
res = N - (r*R+g*G)
if res % B == 0:
cnt += 1
print(cnt)
main() | 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):
w_b_sum = N - ((R * r) + (G * g))
if w_b_sum % B == 0 and w_b_sum >= 0 and w_b_sum == N - ((R * r) + (G * g)):
# print(r, g, (w_b_sum // B))
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):
w_b_sum = N - ((R * r) + (G * g))
if w_b_sum % B == 0 and w_b_sum >= 0:
# print(r, g, (w_b_sum // B))
counter += 1
print(counter)
| p03048 |
import itertools
r,g,b,n=list(map(int,input().split()))
x,y=n//r,n//g
x,y=list(range(0,r*x+1,r)),list(range(0,g*y+1,g))
count=0
for i,j in list(itertools.product(x,y)):
d=n-i-j
if d<0:
pass
elif d==0:
count+=1
elif d%b==0:
count+=1
print(count) | import collections
import itertools
r,g,b,n=list(map(int,input().split()))
x,y=n//r,n//g
x,y=list(range(0,r*x+1,r)),list(range(0,g*y+1,g))
l=[i+j for i,j in itertools.product(x,y) if i+j<=n]
z=collections.Counter(l)
count=0
for key,value in zip(list(z.keys()),list(z.values())):
v=n-key
if v==0:
count+=value
elif v%b==0:
count+=value
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):
bunshi=N-r*R-g*G
q,m=divmod(bunshi,B)
# if q<0:continue
if m==0:cnt+=1
print(cnt) | def main():
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):
bunshi=N-r*R-g*G
q,m=divmod(bunshi,B)
# if q<0:continue
if m==0:cnt+=1
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):
temp = n-r*i-g*j
if temp>=0 and temp%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 |
import sys
input = sys.stdin.readline
R, G, B, N = list(map(int, input().split()))
r = N // R
g = N // G
b = N // B
c = 0
for i in range(r + 1):
for j in range(g + 1):
t = N - i * R - j * G
if t == 0:
c += 1
continue
if t < 0:
continue
if t % B == 0:
c += 1
print(c) | import sys
input = sys.stdin.readline
R, G, B, N = list(map(int, input().split()))
r = N // R
c = 0
for i in range(r + 1):
p = N - i * R
for j in range(int(p // G) + 1):
t = p - j * G
if t == 0:
c += 1
break
if t % B == 0:
c += 1
print(c) | p03048 |
R,G,B,N = (int(i) for i in input().split())
patterns = 0
for i in range(0,N+1,R):
numredballs = i
numothers = N - numredballs
for j in range(0,numothers+1,G):
numgreenballs = j
numblueballs = numothers - numgreenballs
if numblueballs % B != 0:
continue
else:
numgreenboxes = numgreenballs % G
numblueboxes = numblueballs % B
patterns += 1
print(patterns) | R,G,B,N = (int(i) for i in input().split())
patterns = 0
for i in range(0,N+1,R):
numredballs = i
numothers = N - numredballs
for j in range(0,numothers+1,G):
numgreenballs = j
numblueballs = numothers - numgreenballs
if numblueballs % B != 0:
continue
else:
patterns += 1
print(patterns) | p03048 |
import sys
sys.setrecursionlimit(100000)
def f(a):
global R,G,B,N,ans,Rm,Gm,Bm
for b in range(N-R*a+1):
cmod=(N-R*a-G*b)%B
c=(N-R*a-G*b)//B
if cmod==0 and c>=0:
ans+=1
elif c<0:
break
if a>0:
f(a-1)
R,G,B,N=list(map(int,input().split(" ")))
Rm=N//R
Gm=N//G
Bm=N//B
ans=0
f(Rm)
print(ans) | import sys
sys.setrecursionlimit(100000)
def f(a):
global R,G,B,N,ans,Rm,Gm,Bm
for b in range(N-R*a+1):
cmod=(N-R*a-G*b)%B
c=(N-R*a-G*b)//B
if cmod==0 and c>=0:
ans+=1
elif c<0:
break
if a>0:
f(a-1)
R,G,B,N=list(map(int,input().split(" ")))
ans=0
f(N//R+1)
print(ans) | p03048 |
r,g,b,n=list(map(int,input().split()))
cnt=0
for i in range(n+1):
for j in range(n+1):
z=n-(i*r+j*g)
if 0<=z and z%b==0:
#print(i,j,z)
cnt+=1
print(cnt)
#101
| r,g,b,n=list(map(int,input().split()))
cnt=0
for i in range(n+1):
for j in range(n+1):
z=n-(i*r+j*g)
if 0<=z and z%b==0:
#print(i,j,z)
cnt+=1
print(cnt)
| p03048 |
colorn = list(map(int, input().split()))
color = colorn[0:3]
n = colorn[-1]
color.sort()
a, b, c = color[2], color[1], color[0]
a_max = n // a
cnt = 0
for i in range(a_max + 1):
b_max = (n - a * i) // b
for j in range(b_max + 1):
c_max = (n - a * i - b * j) // c
for k in range(c_max, c_max + 2):
if a * i + b * j + c * k == n:
cnt += 1
elif a * i + b * j + c * k > n:
break
print(cnt) | colorn = list(map(int, input().split()))
color = colorn[0:3]
n = colorn[-1]
color.sort()
a, b, c = color[2], color[1], color[0]
a_max = n // a
cnt = 0
ip, jp, kp = -1, -1, -1
for i in range(a_max + 1):
b_max = (n - a * i) // b
d = n - a * i
flag = 0
for j in range(b_max + 1):
c_max = (n - a * i - b * j) // c
for k in range(c_max, c_max + 2):
if a * i + b * j + c * k == n:
cnt += 1
if ip == i:
dj = j - jp
cnt += ((d // b - j) // dj)
flag = 1
break
else:
ip, jp, kp = i, j, k
elif a * i + b * j + c * k > n:
break
if flag == 1:
break
print(cnt) | p03048 |
R, G, B ,N = list(map(int, input().split(' ')))
cnt = 0
li = [R, G, B]
li = sorted(li)
_i = N//li[2]
for i in range(_i+1):
_j = (N - li[2]*i)//li[1]
for j in range(_j+1):
_k = (N - li[2]*i - li[1]*j)//li[0]
for k in range(_k, _k+1):
if i*li[2] + j*li[1] + k*li[0] == N:
cnt += 1
print(cnt) | R, G, B ,N = list(map(int, input().split(' ')))
cnt = 0
li = [R, G, B]
li = sorted(li)
_i = N//li[2]
for i in range(_i+1):
_j = (N - li[2]*i )//li[1]
for j in range(_j + 1):
if (N - i*li[2] - j*li[1])%li[0] == 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 r * R + g * G > N :
break
b = (N - r * R - g * G) / B
if b >= 0 and b.is_integer() :
ans += 1
print(ans)
| R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(0, N + 1, R):
if r > N :
break
for g in range(r, N + 1, G) :
if g > N :
break
b = (N - g) / B
if b >= 0 and b.is_integer() :
ans += 1
print(ans)
| p03048 |
import math
r,g,b,n = [int(u) for u in input().split(" ")]
i = 0
for ir in range(math.floor(n/r)+1):
if ir*r>n:
break
for ig in range(math.floor(n/g)+1):
y = n - (ir*r+ig*g)
if y<0:
break
if y>=0 and y%b==0:
#print(ir,ig,y/b)
i+=1
continue
print(i) | import math
r,g,b,n = [int(u) for u in input().split(" ")]
i = 0
for ir in range(math.floor(n/r)+1):
if ir*r==n:
i+=1
break
elif ir*r>n:
break
for ig in range(math.floor(n/g)+1):
y = n - (ir*r+ig*g)
if y<0:
break
if y%b==0:
#print(ir,ig,y/b)
i+=1
continue
print(i) | p03048 |
r, g, b, n = list(map(int, input().split()))
ans = 0
l = [r, g, b]
l.sort(reverse=True)
for i in range(n+1):
if l[0]*i > n:
break
for j in range(n+1):
if l[0]*i + l[1]*j > n:
break
elif (n-(l[0]*i + l[1]*j)) % l[2] == 0:
ans += 1
print(ans) | r, g, b, n = list(map(int, input().split()))
ans = 0
l = [r, g, b]
l.sort(reverse=True)
a = n // l[0]
for i in range(a+1):
for j in range(n+1):
if l[0]*i + l[1]*j > n:
break
elif (n-(l[0]*i + l[1]*j)) % l[2] == 0:
ans += 1
print(ans) | p03048 |
r, g, b, n = list(map(int, input().split()))
s_rgb = sorted([r, g, b], reverse=True)
result = 0
for i in range(int(n / s_rgb[0]) + 1)[::-1]:
for j in range(int((n - s_rgb[0] * i) / s_rgb[1]) + 1)[::-1]:
if s_rgb[0] * i + s_rgb[1] * j > n:
break
for k in range(int((n - s_rgb[0] * i - s_rgb[1] * j) / s_rgb[2]) + 1)[::-1]:
if s_rgb[0] * i + s_rgb[1] * j + s_rgb[2] * k > n:
break
if s_rgb[0] * i + s_rgb[1] * j + s_rgb[2] * k == n:
result += 1
break
print(result)
| r, g, b, n = list(map(int, input().split()))
s_rgb = sorted([r, g, b], reverse=True)
count = 0
for i in range(int(n / s_rgb[0]) + 1)[::-1]:
for j in range(int((n - s_rgb[0] * i) / s_rgb[1]) + 1)[::-1]:
tmp = n - s_rgb[0] * i - s_rgb[1] * j
if (tmp >= 0 and tmp % s_rgb[2] == 0):
count += 1
print(count)
| p03048 |
r, g, b, n = list(map(int, input().split()))
s_rgb = sorted([r, g, b], reverse=True)
count = 0
for i in range(int(n / s_rgb[0]) + 1)[::-1]:
for j in range(int((n - s_rgb[0] * i) / s_rgb[1]) + 1)[::-1]:
tmp = n - s_rgb[0] * i - s_rgb[1] * j
if (tmp >= 0 and tmp % s_rgb[2] == 0):
count += 1
print(count)
| R, G, B, N = [int(i) for i in input().split()]
dp = [0] * (N + 1)
dp[0] = 1
for c in (R, G, B):
for i in range(N + 1 - c):
dp[i + c] += dp[i]
print((dp[N])) | p03048 |
R, G, B, N = list(map(int, input().split()))
ans = 0
for r in range(3001):
if R * r > N:
break
for g in range(3001):
if R * r + G * g > N:
break
elif (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()))
def f(a, b):
sho, amari = int(a/b), a%b
return sho, amari
R_s, R_a = f(N, R)
cnt = 0
for i in range(R_s + 1):
x = R_a + i * R # R を i 個使う
G_s, G_a = f(x, G)
for j in range(G_s + 1):
y = G_a + j * G # G を j 個使う
B_s, B_a = f(y, B)
if B_a == 0:
cnt += 1
print(cnt)
| R, G, B, N = list(map(int, input().split()))
def f(a, b):
sho, amari = int(a/b), a%b
return sho, amari
def ans(l, m, s):
cnt = 0
R_s, R_a = f(N, l)
for i in range(R_s + 1):
x = R_a + i * l # R を i 個使う
G_s, G_a = f(x, m)
for j in range(G_s + 1):
y = G_a + j * m # G を j 個使う
if y % s == 0:
cnt += 1
return cnt
li = [R, G, B]
li.sort(reverse=True)
cnt = ans(li[0], li[1], li[2])
print(cnt)
| p03048 |
a,b,c,n=list(map(int,input().split()))
ans=0
for x in range((n+a)//a):
for y in range((n+b-a*x)//b):
z=n-a*x-b*y
if z>=0 and z%c==0:
ans+=1
print(ans)
| a,b,c,n=list(map(int,input().split()))
ans=0
for x in range(0,n+1,a):
for y in range(x,n+1,b):
if (n-y)%c==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):
z = r * i + g * j
if z <= n and (n - z) % b == 0:
ans += 1
print(ans)
| r,g,b,n = list(map(int,input().split()))
ans = 0
for i in range(n+1):
x = n - r * i
for j in range(x+1):
y = x - g * j
if y >= 0 and y % 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):
n=N-R*r-G*g
if n%B==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):
n=N-r*R
for g in range(n//G+1):
n1=n-G*g
if n1%B==0 and n1//B>=0:
cnt += 1
print(cnt) | p03048 |
A,B,C,N= list(map(int,input().split()))
ans=0
for i in range(0,N//A+1):
for j in range(0,(N-i*A)//B+1):
if (N-i*A-j*B)%C==0 and (N-i*A-j*B)>-1:
ans+=1
print(ans) | A,B,C,N= list(map(int,input().split()))
ans=0
for i in range(0,N//A+1):
for j in range(0,(N-i*A)//B+1):
if (N-i*A-j*B)%C==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//g+1):
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):
t = n - r*i
for j in range(t//g+1):
if (n - (r*i + g*j)) % b == 0: ans += 1
print(ans) | p03048 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.