input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
input = sys.stdin.readline
K,S=list(map(int,input().split()))
if S < K:
K = S
z = list(range(K+1))
ans = []
for i in z:
s_z = S - i
if s_z < 0:
pass
elif K < s_z:
if (K + 1) > (s_z - K):
ans.append(K*2 - s_z + 1)
else:
ans.append(s_z + 1)
print((sum(ans))) | import sys
input = sys.stdin.readline
K,S=list(map(int,input().split()))
ans = []
if S > K:
z = list(range(K+1))
else:
z = list(range(S+1))
for i in z:
s_z = S - i
if s_z < 0:
pass
elif K < s_z:
if (K + 1) > (s_z - K):
ans.append(K*2 - s_z + 1)
else:
ans.append(s_z + 1)
print((sum(ans))) | p03835 |
k,s = list(map(int,input().split()))
S = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x + y + z == s: S+=1
print(S) | k,s=list(map(int,input().split()))
print((sum(0<=s-y-z<=k for z in range(k+1) for y in range(k+1)))) | p03835 |
i = list(map(int, input().split()))
k = i[0]
s = i[1]
#print("k=",k,"s=",s)
ans = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
# print("x=",x,"y=",y,"z=",z)
if x+y+z == s:
# print("clear!")
ans += 1
print(ans) | i = list(map(int, input().split()))
k = i[0]
s = i[1]
#print("k=",k,"s=",s)
ans = 0
for x in range(k+1):
for y in range(k+1):
z = s-x-y
#print("x=",x,"y=",y,"z=",z)
if k >= z and z >=0:
#print("clear!")
ans += 1
print(ans)
| p03835 |
K,S = list(map(int,input().split()))
ans = 0
for i in range(K+1) :
for j in range(K+1) :
for k in range(K+1) :
if (i+j+k) == S :
ans += 1
print(ans)
| K,S = list(map(int,input().split()))
ans = 0
for i in range(K+1) :
for j in range(K+1) :
if 0 <= (S-i-j) <= K :
ans += 1
print(ans)
| p03835 |
ans = 0
k,s = list(map(int,input().split()))
for x in range(k+1) :
for y in range(k+1) :
z = s - (x+y)
if z >= 0 and z <= k :
ans += 1
print(ans)
| K,S = list(map(int,input().split()))
ans = 0
for x in range(K+1) :
for y in range(K+1) :
z = S-x-y
if 0 <= z <= K :
ans += 1
print(ans) | p03835 |
k, s = list(map(int, input().split()))
res = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x + y + z == s:
res += 1
print(res) | k, s = list(map(int, input().split()))
res = 0
for x in range(k+1):
if 3 * x == s:
res += 1
for x in range(k+1):
for y in range(k+1):
if x == y:
continue
if 2 * x + y == s:
res += 3
for x in range(k+1):
for y in range(x+1, k+1):
d = s - x - y
if d > y and d <= k:
res += 6
print(res) | p03835 |
K, S = list(map(int, input().split()))
ans = 0
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):
if i+j+k == S: ans += 1
if i+j+k > S: break
if i+j > S: break
if i > S: break
print(ans) | K, S = list(map(int, input().split()))
ans = 0
for i in range(K+1):
for j in range(K+1):
if 0 <= S-i-j <= K: ans+=1
if S-i-j < 0: break
if i > S: break
print(ans) | p03835 |
a=list(map(int,input().split()))
ans=0
for i in range(a[0]+1):
for j in range(a[0]+1):
for k in range(a[0]+1):
if i+j+k==a[1]:
ans+=1
print((str(ans))) | a=list(map(int,input().split()))
ans=0
for i in range(a[0]+1):
for j in range(a[0]+1):
if a[1]-i-j <= a[0] and a[1]-i-j >= 0:
ans+=1
print((str(ans))) | p03835 |
a=list(map(int,input().split()))
ans=0
for i in range(a[0]+1):
for j in range(a[0]+1):
if a[1]-i-j < a[0]+1 and a[1]-i-j > -1:
ans+=1
print((str(ans))) | a=list(map(int,input().split()))
ans=0
for i in range(a[0]+1):
for j in range(a[0]+1):
if a[1]-i-j <= a[0] and a[1]-i-j >= 0:
ans+=1
print((str(ans))) | p03835 |
k, s = [int(i) for i in input().split()]
count = 0
for x in range(k+1):
if s - x > 2 * k:
continue
for y in range(k+1):
if s - (x+y) > k:
continue
for z in range(k+1):
if x + y + z == s:
count += 1
print(count)
| k, s = [int(i) for i in input().split()]
count = 0
for x in range(k+1):
if s - x > 2 * k:
continue
for y in range(k+1):
if s - (x+y) > k or s -(x+y) < 0:
continue
count += 1
print(count)
| p03835 |
K,S = list(map(int, input().split()))
number_of_combinations = 0
for x in range(0,K+1):
for y in range(0, K+1):
for z in range(0,K+1):
sum_of_integer = x + y + z
if sum_of_integer == S:
number_of_combinations += 1
print(number_of_combinations) | K,S = list(map(int, input().split()))
number_of_combinations = 0
for x in range(0,K+1):
for y in range(0, K+1):
z = S-x-y
if 0 <= z <= K:
number_of_combinations += 1
print(number_of_combinations) | p03835 |
K, S = list(map(int, input().split()))
result = 0
for i in range(K+1):
for j in range(K+1):
i_j = i + j
for k in range(K+1):
if i_j + k == S:
result += 1
print(result) | K, S = list(map(int, input().split()))
result = 0
for i in range(K+1):
for j in range(K+1):
if 0 <= S - (i + j) <= K:
result +=1
print(result) | p03835 |
K, S = list(map(int, input().split()))
ans = 0
for i in range(K+1):
x = i
for j in range(K+1):
y = j
z = S - x - y
if 0 <= z <= K:
ans += 1
print(ans) | K, S = list(map(int, input().split()))
count = 0
for x in range(K+1):
for y in range(K+1):
if 0 <= S - (x + y) <= K:
count += 1
print(count) | p03835 |
K, S = list(map(int, input().split()))
count = 0
for i in range(K+1):
for j in range(K+1):
k = S - (i + j)
if 0 <= k <= K:
count += 1
print(count) | K, S = list(map(int, input().split()))
ans = 0
for x in range(K+1):
for y in range(K+1):
z = S- (x + y)
if 0 <= z <= K:
ans += 1
print(ans) | p03835 |
#!/usr/bin/env python3
import sys
def solve(K: int, S: int):
count = 0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if x + y + z == S:
count += 1
print(count)
return
# Generated by 1.1.7.1 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()
K = int(next(tokens)) # type: int
S = int(next(tokens)) # type: int
solve(K, S)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
def solve(K: int, S: int):
count = 0
for x in range(K+1):
for y in range(K+1):
if 0 <= S - x - y <= K:
count += 1
print(count)
return
# Generated by 1.1.7.1 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()
K = int(next(tokens)) # type: int
S = int(next(tokens)) # type: int
solve(K, S)
if __name__ == '__main__':
main()
| p03835 |
k,s=list(map(int,input().split()))
print(([x+y+z for z in range(k+1) for y in range(k+1) for x in range(k+1)].count(s))) | k,s=list(map(int,input().split()))
print((len([1 for z in range(k+1) for y in range(k+1) if 0<=s-y-z<=k]))) | p03835 |
import itertools
a,b=(int(x) for x in input().split())
l = list(range(a+1))
count = 0
m = [0 for x,y,z in itertools.product(l,l,l)if (x+y+z) == b]
#m = [0 for x in l for y in l for z in l if (x+y+z) == b]
print((len(m))) | import itertools
a,b=(int(x) for x in input().split())
l = list(range(a+1))
count = 0
m = [x+y for x,y in itertools.product(l,l) if (x+y)<=b]
for i in m:
if b-i <= a:
count+=1
print(count) | p03835 |
K,S=list(map(int,input().split()))
ans=0
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):
if i+j+k==S:
ans+=1
print(ans) | K,S=list(map(int,input().split()))
ans=0
for i in range(K+1):
for j in range(K+1):
if S-i-j<=K and S-i-j>=0:
ans+=1
print(ans)
| p03835 |
K, S = list(map(int, input().split()))
# S-K<=X+Y<=S を満たすX,Yの組の数が答え
ans = 0
for X in range(K+1):
for Y in range(K+1):
if S-K <= X+Y <= S:
ans += 1
print(ans) | K, S = list(map(int, input().split()))
# 各ケースごとに格子点の個数を求める
if 0 <= S <= K:
print((int((S+1)*(S+2)/2)))
elif K < S <= 2*K:
print((int((K+1)**2 - (2*K-S)*(2*K-S+1)/2 - (S-K)*(S-K+1)/2)))
else:
print((int((3*K-S+1)*(3*K-S+2)/2))) | p03835 |
K, S = list(map(int, input().split()))
ans = 0
for x in range(K + 1):
for y in range(K + 1):
for z in range(K + 1):
ans += ((x + y + z) == S)
print(ans)
| K, S = list(map(int, input().split()))
ans = 0
for x in range(K + 1):
for y in range(K + 1):
z = S - x - y
ans += ((0<=z<=K))
print(ans) | p03835 |
K, S = list(map(int,input().split()))
if(3*K == S):
print((1))
exit()
cnt = 0
for i in range(K+1):
for j in range(K+2):
for k in range(K+3):
if(i+j+k == S):
cnt += 1
print(cnt) | K, S = list(map(int,input().split()))
cnt = 0
for i in range(K+1):
for j in range(K+1):
if(S-(i+j) <= K and S-(i+j) >= 0):
cnt += 1
print(cnt) | p03835 |
K, S = list(map(int,input().split()))
cnt = 0
for i in range(K+1):
for j in range(K+1):
if(S-(i+j) <= K and S-(i+j) >= 0):
cnt += 1
print(cnt) | K, S = list(map(int,input().split()))
cnt = 0
for i in range(K+1):
for j in range(K+1):
if(0 <= S-i-j < K+1):
cnt += 1
print(cnt) | p03835 |
K, S = list(map(int,input().split()))
cnt = 0
for i in range(K+1):
for j in range(K+1):
if(0 <= S-i-j < K+1):
cnt += 1
print(cnt) | import sys
inp = sys.stdin.readline
K, S = list(map(int,inp().split()))
cnt = 0
for i in range(K+1):
for j in range(K+1):
if(0 <= S-i-j < K+1):
cnt += 1
print(cnt) | p03835 |
k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if (x+y+z) == s:
ans+=1
print(ans)
| k, s = list(map(int, input().split()))
count = 0
for x in range(k + 1):
for y in range(k + 1):
z = s - x - y
if 0 <= z <= k:
count += 1
print(count) | p03835 |
k,s = list(map(int,input().split()))
ans = 0
for i in range(k+1):
for l in range(k+1):
if (s-i-l) >= 0 and (s-i-l) <= k:
if i+l+(s-i-l) == s:
ans += 1
print(ans) | k,s = list(map(int,input().split()))
ans = 0
for i in range(k+1):
for l in range(k+1):
if (s-i-l) >= 0 and (s-i-l) <= k:
ans += 1
print(ans) | p03835 |
k, s = list(map(int, input().split()))
from itertools import combinations_with_replacement
cwr = combinations_with_replacement(list(range(0, k + 1)), 3)
ans = 0
for x, y, z in cwr:
if x + y + z == s:
st = set([x, y, z])
if len(st) == 1:
ans += 1
elif len(st) == 2:
ans += 3
else: #len(st) == 3
ans += 6
print(ans)
| k, s = list(map(int, input().split()))
ans = 0
for x in range(k + 1):
for y in range(k + 1):
z = s - x - y
if 0 <= z <= k:
ans += 1
print(ans)
| p03835 |
K, S = list(map(int, input().split()))
num = 0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if x + y + z == S:
num += 1
print(num)
| K, S = list(map(int, input().split()))
num = 0
for x in range(K+1):
for y in range(K+1):
# for z in range(K+1):
# if x + y + z == S:
if 0 <= S - x- y <= K:
num += 1
print(num)
| p03835 |
#https://atcoder.jp/contests/abc051/tasks/abc051_b
K, S = list(map(int, input().split(' ')))
cnt = 0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if x + y + z == S:
cnt += 1
print(cnt) | #https://atcoder.jp/contests/abc051/tasks/abc051_b
K, S = list(map(int, input().split(' ')))
cnt = 0
for x in range(K+1):
for y in range(K+1):
z = S - (x + y)
if 0 <= z <= K:
cnt += 1
print(cnt) | p03835 |
k, s = list(map(int, input().split()))
kouho_list = []
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
tmp_sum = x + y + z
if tmp_sum == s:
kouho_list.append(tmp_sum)
print((len(kouho_list))) | k, s = list(map(int, input().split()))
count = 0
for x in range(k+1):
for y in range(k+1):
z = s - (x + y)
if 0 <= z <= k:
count += 1
print(count) | p03835 |
k,s=list(map(int,input().split()))
count=0
for x in range(k+1):
for y in range(s-x+1):
z = s - x - y
if (x <= k and y <= k and z <= k) and (0 <= x and 0 <=y and 0 <= z):
count+=1
print(count) | k,s=list(map(int,input().split()))
count=0
for x in range(k+1):
for y in range(k+1):
z = s - x - y
if (y <= k and z <= k) and (0 <= z):
count+=1
print(count) | p03835 |
k,s = list(map(int,input().split()))
r=0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x+y+z==s:
r+=1
print(r) | k,s = list(map(int,input().split()))
r=0
for x in range(k+1):
for y in range(k+1):
z=s-x-y
if 0<=z<=k:
r+=1
print(r) | p03835 |
# coding: utf-8
import time
import re
import math
import fractions
def main():
K,S=list(map(int,input().split()))
count=0
for x in range(0,K+1):
for y in range(0,K+1):
if(x+y>S):break
if S-x-y<=K and S-x-y>=0:
count+=1
print(count)
start=time.time()
main()
#print("処理速度 {}sec".format(time.time()-start))
#A=list(map(int,input().split()))
#A,B,C=map(int,input().split())
#n=int(input())
| # coding: utf-8
import time
import re
import math
import fractions
def main():
K,S=list(map(int,input().split()))
count=0
for x in range(0,K+1):
for y in range(0,K+1):
if S-x-y<=K and S-x-y>=0:
count+=1
print(count)
start=time.time()
main()
#print("処理速度 {}sec".format(time.time()-start))
#A=list(map(int,input().split()))
#A,B,C=map(int,input().split())
#n=int(input())
| p03835 |
k,s = list(map(int, input().split()))
count = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x+y+z == s:
count += 1
print(count) | k,s = list(map(int, input().split()))
count = 0
for x in range(k+1):
for y in range(k+1):
z = s-x-y
if z >= 0 and z <= k:
count += 1
print(count) | p03835 |
K, S = list(map(int, input().split()))
ans = 0
for x in range(K + 1):
for y in range(K + 1):
for z in range(K + 1):
# print(x, y, z)
if x + y + z == S:
ans += 1
print(ans)
| K, S = list(map(int, input().split()))
ans = 0
for x in range(K + 1):
for y in range(K + 1):
ans += 1 if 0 <= S - x - y <= K else 0
print(ans)
| p03835 |
k, s = [int(n) for n in input().split()]
count = 0
for i in range(k+1):
for j in range(k+1):
for l in range(k+1):
if i + j + l == s:
count += 1
print(count) | k, s = [int(n) for n in input().split()]
count = 0
for x in range(k+1):
for y in range(k+1):
if 0 <= s - (x + y) <= k:
count += 1
print(count)
| p03835 |
k,s=list(map(int,input().split()))
cnt=0
for x in range(k+1):
for y in range(k+1):
z=s-x-y
if 0<=z<=k:
cnt +=1
print(cnt) | k,s=list(map(int,input().split()))
cnt=0
for i in range(k+1):
for j in range(k+1):
if 0<=(s-i-j)<=k:cnt +=1
print(cnt) | p03835 |
k,s = list(map(int, input().split()))
x =0
for i in range(k+1):
for j in range(k+1):
for l in range(k+1):
if i + j + l == s:
x +=1
print(x) | k,s = list(map(int, input().split()))
x =0
for i in range(min(k+1,s+1)):
x += max(0, min(s-i,k)+1 - max(0,s-i-k) )
print(x) | p03835 |
k,s = [int(x) for x in input().split()]
count = 0
for i in range(k+1) :
for j in range(k+1):
for l in range(k+1) :
if i + j + l == s :
count += 1
print(count)
| k,s = [int(x) for x in input().split()]
count = 0
for x in range(k+1) :
for y in range(k+1):
z = s - x - y
if z >= 0 and z <= k :
count += 1
print(count)
| p03835 |
k, s = list(map(int, input().split()))
ks = [_ for _ in range(k+1)]
count = 0
for ksk1 in ks:
for ksk2 in ks:
for ksk3 in ks:
if s == ksk1 + ksk2 + ksk3:
count += 1
print(count) | k, s = list(map(int, input().split()))
ks = [_ for _ in range(k+1)]
count = 0
for ksk1 in ks:
for ksk2 in ks:
z = s - ksk1 - ksk2
if 0 <= z <= k:
count += 1
print(count) | p03835 |
a,b=list(map(int,input().split()))
ans=0
for i in range(a+1):
for j in range(a+1):
for k in range(a+1):
if i+j+k==b:
ans+=1
print(ans) | a,b=list(map(int,input().split()))
ans=0
for i in range(a+1):
for j in range(a+1):
if 0<=b-i-j<=a:
ans+=1
print(ans) | p03835 |
k, s = list(map(int, input().split()))
ans = 0
for i in range(k+1):
for j in range(k+1):
for m in range(k+1):
if ((i+j+m) == s):
ans += 1
print(ans)
| k, s = list(map(int, input().split()))
ans = 0
for i in range(k+1):
for j in range(k+1):
m = s - i - j
if (0 <= m <= k):
ans += 1
print(ans)
| p03835 |
# -*- coding: utf-8 -*-
# input
k, s = list(map(int, input().split()))
# calc
ans = 0
for x in range(k + 1):
for y in range(k + 1):
for z in range(k + 1):
if x + y + z == s:
ans += 1
# output
print(ans) | # -*- coding: utf-8 -*-
# input
k, s = list(map(int, input().split()))
# calc
ans = 0
for x in range(k + 1):
for y in range(k + 1):
if 0 <= (s - x - y) <= k:
ans += 1
# output
print(ans) | p03835 |
# coding = SJIS
k, s = list(map(int, input().split()))
ans = 0
for x in range(0, k + 1):
for y in range(0, k + 1):
z = s - x - y
if 0 <= z and z <= k:
ans += 1
print(ans) | # coding = SJIS
k, s = list(map(int, input().split()))
if s < k:
ans = (s + 1) * (s + 2) / 2
elif s <= 2 * k:
t = 2 * k - s
ans = ((k + 1) * (k + 2) / 2) - ((2 * k - s) * ((2 * k - s) + 1) / 2) + (t * (2 * k - ((2 * k - s) - 1)) / 2)
elif s <= 3 * k:
ans = (3 * k - s + 1) * ((3 * k - s + 1) + 1) / 2
print((int(ans))) | p03835 |
K, S = list(map(int, input().split()))
ans = 0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if x+y+z == S:
ans+=1
print(ans) | K, S = list(map(int, input().split()))
ans = 0
for x in range(K+1):
for y in range(K+1):
if x+y<=S:
if S-x-y<=K:
ans+=1
print(ans) | p03835 |
k, s = list(map(int, input().split()))
cnt = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x+y+z == s:
cnt +=1
print(cnt) | k, s = list(map(int, input().split()))
cnt = 0
for x in range(k+1):
for y in range(k+1):
if 0 <= s-(x+y) < k+1:
cnt +=1
print(cnt) | p03835 |
K,S = (int(x) for x in input().split())
count = 0
for x in range(K+1):
if x > S:
break
for y in range(K+1):
if x + y > S:
break
for z in range(K+1):
#print(x,y,z)
if x + y + z == S:
count += 1
#print(x,y,z)
print(count) | K,S = (int(x) for x in input().split())
count = 0
for x in range(K+1):
if x > S:
break
for y in range(K+1):
z = S - x - y
if 0 <= z <= K:
count += 1
elif x + y > S:
break
print(count) | p03835 |
#SumofThreeIntegers
k, s = list(map(int, input().split()))
cnt = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x + y + z == s :
cnt += 1
print(cnt) | #SumofThreeIntegers
k, s = list(map(int, input().split()))
cnt = 0
for x in range(k+1):
for y in range(k+1):
a = s - (x + y)
if 0 <= a <= k :
cnt += 1
print(cnt) | p03835 |
K,S = list(map(int, input().split()))
cnt=0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if S== x+y+z:
cnt +=1
else:
continue
print(cnt) | K,S = list(map(int, input().split()))
cnt=0
for x in range(K+1):
for y in range(K+1):
if K>=S-(x+y)>=0:
cnt +=1
else:
continue
print(cnt) | p03835 |
K,S = list(map(int, input().split()))
count = 0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if x+y+z == S:
count += 1
print(count)
| K,S = list(map(int, input().split()))
count = 0
# 計算量大きすぎる
# for x in range(K+1):
# for y in range(K+1):
# for z in range(K+1):
# if x+y+z == S:
# count += 1
for x in range(K+1):
for y in range(K+1):
z = S - x - y
if 0 <= z <= K:
count += 1
print(count)
| p03835 |
K,S = list(map(int,input().split(" ")))
c=0
for X in range(K+1):
for Y in range(K+1):
for Z in range(K+1):
if X+Y+Z==S:
c+=1
print(c) | K,S = list(map(int,input().split(" ")))
c=0
for X in range(K+1):
for Y in range(K+1):
if 0<=S-X-Y<=K:
c+=1
print(c) | p03835 |
k,s = list(map(int,input().split()))
counter = 0
for x in range(k+1):
if s-x > 2 * k:
continue
for y in range(k+1):
if s-x-y > k:
continue
elif s-x-y <= k and s-x-y >=0:
counter += 1
print(counter) | k,s = list(map(int,input().split()))
counter = 0
for x in range(k+1):
if s-x > 2*k:
continue
for y in range(k+1):
if s-x-y > k or s-x-y < 0:
continue
else:
counter += 1
print(counter) | p03835 |
K, S = list(map(int, input().split()))
count = 0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if S == x+y+z:
count += 1
print(count)
| K, S = list(map(int, input().split()))
count = 0
for x in range(K+1):
for y in range(K+1):
z = S - x - y
if 0 <= z <= K:
count += 1
print(count)
| p03835 |
#!/usr/bin/env python3
import sys
def solve(K: int, S: int):
cnt = 0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if x + y + z == S:
cnt += 1
print(cnt)
return
# Generated by 1.1.6 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()
K = int(next(tokens)) # type: int
S = int(next(tokens)) # type: int
solve(K, S)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
def solve(K: int, S: int):
cnt = 0
for x in range(K+1):
for y in range(K+1):
z = S - x - y
if z >= 0 and z <= K:
cnt += 1
print(cnt)
return
# Generated by 1.1.6 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()
K = int(next(tokens)) # type: int
S = int(next(tokens)) # type: int
solve(K, S)
if __name__ == '__main__':
main()
| p03835 |
k, s = list(map(int, input().split()))
pat = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if s == x + y + z :
pat += 1
print(pat) | k, s = list(map(int, input().split()))
pat = 0
for x in range(k+1):
for y in range(k+1):
if 0 <= s - (x + y) <= k:
pat += 1
print(pat) | p03835 |
K,S=list(map(int,input().split()))
c=0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if x+y+z==S:
c+=1
print(c)
| K,S=list(map(int,input().split()))
c=0
for x in range(K+1):
for y in range(K+1):
if S-x-y>=0 and S-x-y<=K:
c+=1
"""
for z in range(K+1):
if x+y+z==S:
c+=1
"""
print(c)
| p03835 |
k,s=list(map(int,input().split()))
cnt=0
for i in range(k+1):
for j in range(k+1):
for h in range(k+1):
if s==i+j+h:
cnt+=1
print(cnt) | k,s=list(map(int,input().split()))
cnt=0
for i in range(k+1):
for j in range(k+1):
h = s-i-j
if 0<=h and h <=k:
cnt+=1
print(cnt) | p03835 |
K,S = list(map(int,input().split()))
num = 0
for i in range(K+1):
for j in range(K+1) :
for k in range(K+1):
total = i +j + k
if total == S :
num += 1
print(num)
| K,S = list(map(int,input().split()))
num = 0
for i in range(K+1):
for j in range(K+1) :
k = S - i - j
if k >= 0 and k <= K :
num += 1
print(num)
| p03835 |
k, s = list(map(int, input().split()))
res = 0
for x in range(k+1):
for y in range(min(k+1, s-x+1)):
for z in range(min(k+1, s-x-y+1)):
if x+y+z == s:
res += 1
print(res) | k, s = list(map(int, input().split()))
res = 0
for x in range(k+1):
for y in range(k+1):
if x + y <= s:
if x + y + k >= s:
res += 1
else:
break
print(res)
| p03835 |
K, S = list(map(int, input().split()))
counter = 0
for x in range(K + 1):
for y in range(K + 1):
for z in range(K + 1):
if S == x + y + z:
counter += 1
print(counter)
| K, S = list(map(int, input().split()))
counter = 0
for x in range(K + 1):
for y in range(K + 1):
z = S - x - y
if 0 <= z and z <= K:
counter += 1
print(counter)
| p03835 |
k,s=list(map(int,input().split()))
cnt=0
for x in range(max(0,s-2*k),k+1):
if x>s:
break
for y in range(max(0,s-2*k),k+1):
if x+y>s:
break
if s-(x+y)>=0 and s-(x+y)<=k:
cnt+=1
print(cnt)
| k,s=list(map(int,input().split()))
cnt=0
for x in range(k+1):
if s-x<0:
break
elif s-x<=k:
cnt+=(s-x)+1
elif s-x>2*k:
cnt+=0
elif s-x>k:
cnt+=2*k-(s-x)+1
print(cnt) | p03835 |
K, S = list(map(int, input().split()))
count = 0
for i in range(K+1):
if i <= S:
for j in range(K+1):
if j <= S:
if S - i - j <= K and S - i - j >= 0:
count += 1
print(count) | K, S = list(map(int, input().split()))
count = 0
for i in range(K+1):
for j in range(K+1):
if S - i - j <= K and S - i - j >= 0:
count += 1
print(count) | p03835 |
K,S = list(map(int,input().split()))
count = 0
for i in range(0,K+1):
for j in range(0,K+1):
for k in range(0,K+1):
ty = i + j + k
if ( ty == S):
count += 1
print(count) | K,S = list(map(int,input().split()))
count = 0
for x in range(K+1):
for y in range(K+1):
z = S - x - y
if (0 <= z < K + 1):
count += 1
print(count) | p03835 |
k, s = list(map(int, input().split(' ')))
count = 0
for i in range(k + 1):
for j in range(k + 1):
for l in range(k + 1):
if i + j + l == s:
count += 1
print(count)
| k, s = list(map(int, input().split(' ')))
count = 0
for i in range(k + 1):
for j in range(k + 1):
if 0 <= s - (i + j) <= k:
count += 1
print(count)
| p03835 |
k,s=list(map(int,input().split()))
ans=0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x+y+z==s:
ans+=1
print(ans) | k,s=list(map(int,input().split()))
ans=0
for i in range(k+1):
for j in range(k+1):
if 0<=s-i-j<=k:
ans+=1
print(ans) | p03835 |
k, s = list(map(int, input().split()))
ans=0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x+y+z==s:
ans+=1
print(ans) | k, s = list(map(int, input().split()))
ans=0
for x in range(k+1):
for y in range(k+1):
if 0<=s-(x+y)<=k:
ans+=1
print(ans) | p03835 |
K, S = list(map(int, input().split()))
ans = 0
for i in range(K + 1):
s = i
if s > S:
break
for j in range(K + 1):
s = i + j
if s > S:
break
for k in range(K + 1):
s = i + j + k
if S == s:
ans += 1
break
print(ans) | K, S = list(map(int, input().split()))
ans = 0
for i in range(K + 1):
s = i
if s > S:
break
for j in range(K + 1):
s = i + j
if s > S:
break
Z = S - s
if 0 <= Z <= K:
ans += 1
print(ans) | p03835 |
K, S = list(map(int, input().split()))
ans = 0
for i in range(K + 1):
if i > S:
break
for j in range(K + 1):
s = i + j
if s > S:
break
Z = S - s
if 0 <= Z <= K:
ans += 1
print(ans) | K, S = list(map(int, input().split()))
ans = 0
for i in range(min(S + 1, K + 1)):
s = S - i
if s > 2 * K:
continue
ans += min(K, s) - max(0, s - K) + 1
print(ans) | p03835 |
k,s = list(map(int,input().split()))
cnt = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x + y + z == s:
cnt += 1
print(cnt) | k,s = list(map(int,input().split()))
cnt = 0
for x in range(k+1):
for y in range(k+1):
if x + y <= s and x + y >= s - k:
cnt += 1
print(cnt) | p03835 |
import math
#-------------
K, S = list(map(int, input().split()))
#-------------
cnt = 0
for X in range(K+1):
for Y in range(K+1):
for Z in range(K+1):
if S-(X+Y+Z) == 0:
cnt += 1
print(cnt) | import math
#-------------
K, S = list(map(int, input().split()))
#-------------
cnt = 0
for X in range(K+1):
for Y in range(K+1):
if 0 <= S-(X+Y) <= K:
cnt += 1
print(cnt) | p03835 |
k,s = (int(i) for i in input().split())
ans = 0
for i in range(k+1):
for j in range(k+1):
for l in range(k+1):
if i+j+l == s:
ans += 1
print(ans) | k,s = (int(i) for i in input().split())
ans = 0
for i in range(k+1):
for j in range(k+1):
if 0<=s-i-j and s-i-j<=k:
ans += 1
print(ans) | p03835 |
K,S=list(map(int,input().split()))
count=0
for x in range(K+1):
for y in range(K+1):
z=S-x-y
if(0<=z<=K):
count+=1
else:pass
print(count) | K , S = list(map(int,input().split()))
count = 0
for x in range(K + 1):
for y in range(K + 1):
z = S - x - y
if(0 <= z <= K):
count += 1
print(count) | p03835 |
k, s = list(map(int, input().split()))
counter = 0
for x in range(0, k + 1):
for y in range(0, k + 1):
for z in range(0, k + 1):
if x + y + z == s:
counter += 1
print(counter) | k, s = list(map(int, input().split()))
counter = 0
for x in range(0, k + 1):
for y in range(0, k + 1):
if 0 <= s - x - y <= k:
counter += 1
print(counter) | p03835 |
K,S = [int(i) for i in input().split()]
ans = 0
for X in range(K+1):
for Y in range(K+1):
Z = S-X-Y
if 0<=Z<=K and X+Y+Z==S:
ans += 1
print(ans) | K,S = [int(i) for i in input().split()]
ans = 0
for X in range(K+1):
for Y in range(K+1):
Z = S-X-Y
if 0<=Z<=K:
ans += 1
print(ans) | p03835 |
def is_same(x, y, z, s):
return x+y+z == s
k, s = [int(e) for e in input().split()]
ans = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if is_same(x,y,z,s):
ans += 1
print(ans) | k, s = [int(e) for e in input().split()]
ans = 0
for x in range(k+1):
for y in range(k+1):
z = s-x-y
if 0 <= z and z <= k:
ans = ans + 1
print(ans) | p03835 |
k,s = list(map(int,input().split()))
ans = 0
if(s == 0):
print((1))
exit()
elif(s == 3*k):
print((1))
exit()
for i in range(0,k+1):
for j in range(0,k+1):
for k in range(0,k+1):
if(i + j + k == s):
ans += 1
print(ans) | k,s = list(map(int,input().split()))
ans = 0
if(s == 0):
print((1))
exit()
elif(s == 3*k):
print((1))
exit()
for i in range(0,k+1):
for j in range(0,k+1):
z = s - i - j
if(z >= 0 and z <= k):
ans += 1
print(ans) | p03835 |
# -*- coding: utf-8 -*-
k, s = list(map(int, input().split()))
ans = 0
if s == 3*k:
ans = 1
elif s > 3*k:
ans = 0
elif s == k:
ans = int((k + 1) * (k + 2) / 2)
else:
l = k
while l >= 0:
t_sum = s - l
m = k
if t_sum > 2*k:
break
if m < k:
m = k
while m >= 0:
n = s - l - m
if n > k:
n = k
if l + m + n < s:
break
while n >= 0:
if l + m + n == s:
ans += 1
if l + m + n < s:
break
n -=1
m -= 1
l -= 1
print(ans) | # -*- coding: utf-8 -*-
"""
Created on Mon Aug 3 13:34:09 2020
@author: ito
"""
# -*- coding: utf-8 -*-
k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
for y in range(k+1):
sat_z = s - x - y
if sat_z >= 0 and sat_z <= k:
ans += 1
print(ans) | p03835 |
# -*- coding: utf-8 -*-
k, s = list(map(int, input().split()))
ans = 0
if s == 3*k:
ans = 1
elif s > 3*k:
ans = 0
elif s == k:
ans = int((k + 1) * (k + 2) / 2)
else:
l = k
while l >= 0:
t_sum = s - l
m = s - t_sum
if t_sum > 2*k:
break
if m < k:
m = k
while m >= 0:
n = s - l - m
if n > k or l + m + n < s:
break
while n >= 0:
if l + m + n == s:
ans += 1
if l + m + n < s:
break
n -=1
m -= 1
l -= 1
print(ans)
| # -*- coding: utf-8 -*-
k, s = list(map(int, input().split()))
ans = 0
if s == 3*k:
ans = 1
elif s > 3*k:
ans = 0
elif s == k:
ans = int((k + 1) * (k + 2) / 2)
else:
l = k
while l >= 0:
t_sum = s - l
m = s - t_sum
if t_sum > 2*k:
break
if m < k:
m = k
while m >= 0:
n = s - l - m
if n > k:
break
if n >= 0:
ans += 1
m -= 1
l -= 1
print(ans)
| p03835 |
# -*- coding: utf-8 -*-
k, s = list(map(int, input().split()))
ans = 0
if s == 3*k:
ans = 1
elif s > 3*k:
ans = 0
elif s == k:
ans = int((k + 1) * (k + 2) / 2)
else:
l = k
while l >= 0:
t_sum = s - l
m = s - t_sum
if t_sum > 2*k:
break
if m < k:
m = k
while m >= 0:
n = s - l - m
if n > k:
break
if n >= 0:
ans += 1
m -= 1
l -= 1
print(ans)
| K, S = list(map(int, input().split()))
ans = 0
for i in range(0,K+1):
for j in range (0,K+1):
if (S-K) <= (i + j) <= S:
ans += 1
continue
print(ans) | p03835 |
a, b = list(map(int,input().split()))
count = 0
for i in range(a+1):
for j in range(a+1):
for k in range(a+1):
if (i+j+k) == b:
count += 1
else:
continue
print(count) | a, b = list(map(int,input().split()))
count = 0
for i in range(a+1):
for j in range(a+1):
k = b - i - j
if 0 <= k <= a:
count += 1
print(count) | p03835 |
k,s=list(map(int,input().split()))
c=0
for l in range(k+1):
for m in range(k+1):
for n in range(k+1):
if l+m+n==s:
c+=1
elif l+m+n>s:
break
print(c) | k,s=list(map(int,input().split()))
c=0
for l in range(k+1):
for m in range(k+1):
if 0<=s-l-m and s-l-m<=k:
c+=1
print(c) | p03835 |
import itertools
K, S = list(map(int, input().split()))
ans = 0
for x in range(K+1):
for y in range (K+1):
for z in range(K+1):
if x+y+z == S:
ans +=1
print(ans) | K, S = list(map(int, input().split()))
ans = 0
for x in range(K+1):
for y in range (K+1):
if 0 <= S - x- y <= K:
ans +=1
print(ans) | p03835 |
# -*- coding: utf-8 -*-
k, s = list(map(int,input().split()))
count = 0
if k == s/3:
print((1))
exit()
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x + y + z == s:
#print(x,y,z)
count += 1
print(count)
| # -*- coding: utf-8 -*-
k, s = list(map(int,input().split()))
count = 0
if k == s/3:
print((1))
exit()
for x in range(k+1):
for y in range(k+1):
z = s - x -y
if (z >= 0 and z <= k):
#print(x,y,z)
count += 1
print(count)
| p03835 |
k, s = list(map(int, input().split()))
ans = 0
for i in range(k+1):
for j in range(k+1):
for l in range(k+1):
if i+j+l == s:
ans += 1
print(ans) | k, s = list(map(int, input().split()))
ans = 0
for i in range(k+1):
for j in range(k+1):
if s <= i+j+k and i+j <= s:
ans += 1
print(ans) | p03835 |
k,s=list(map(int,input().split()))
ac=[]
nums=[]
for i in range(k+1):
for j in range(i,k+1):
for l in range(j,k+1):
if i+j+l==s:
ac.append((i,j,l))
for i in range(len(ac)):
if len(set(ac[i]))==1:
nums.append(1)
elif len(set(ac[i]))==2:
nums.append(3)
else:
nums.append(6)
print((sum(nums))) | k,s=list(map(int,input().split()))
count=0
for x in range(k+1):
for y in range(k+1):
z=s-x-y
if 0<=z<=k:
count+=1
print(count) | p03835 |
k, s = list(map(int, input().split()))
count = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x + y + z == s:
count += 1
print(count) | k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
for y in range(k+1):
if s - k <= x + y <= s:
ans += 1
print(ans) | p03835 |
def check(x, y, K, S):
if x + y > S:
return False
for z in range(K+1):
if x + y + z == S:
return True
return False
K, S = list(map(int, input('').split()))
count = 0
for x in range(K+1):
for y in range(K+1):
if check(x, y, K, S):
count += 1
print(count) | K, S = list(map(int, input('').split()))
count = 0
for x in range(K+1):
for y in range(K+1):
if x + y <= S and x + y + K >= S:
count += 1
print(count) | p03835 |
k, s = list(map(int, input().split()))
count=0
for i in range(k+1):
if i+2*k-s >=0:
for j in range(k+1):
if i+j+k-s>=0:
for h in range(k+1):
if i+j+h ==s:
count+=1
print(count) | k, s = list(map(int, input().split()))
count=0
for i in range(k+1):
if i+2*k-s >=0:
for j in range(k+1):
if (s-(i+j)<=k)&(s-(i+j)>=0):
count+=1
print(count) | p03835 |
k, s = list(map(int, input().split()))
count=0
for i in range(k+1):
if i+2*k-s >=0:
for j in range(k+1):
if (s-(i+j)<=k)&(s-(i+j)>=0):
count+=1
print(count) | k, s = list(map(int, input().split()))
count=0
for i in range(k+1):
for j in range(k+1):
if (s-(i+j)<=k)&(s-(i+j)>=0):
count+=1
print(count) | p03835 |
import itertools
K, S = list(map(int, input().split()))
cnt = 0
for i in itertools.product(list(range(K+1)), repeat=3):
cnt += sum(i) == S
print(cnt) | K, S = list(map(int, input().split()))
K += 1
cnt = 0
for i in range(K):
if i+K*2<=S : continue
if i>S : continue
for j in range(min(K, S-i+1)):
if i+j+K<=S : continue
if i+j>S : break
cnt += 1
print(cnt) | p03835 |
K,S = list(map(int,input().split()))
ans = 0
for i in range(0,K+1):
for j in range(0,K+1):
for k in range(0,K+1):
if(i+j+k==S):
ans += 1
else:
pass
print(ans)
| K, S = list(map(int, input().split()))
ans = 0
for i in range(K + 1):
n = S - i
if i <= S and n <= K * 2:
a = (n + 1) - max(0, n - K) * 2
ans += a
print(ans) | p03835 |
k, s = list(map(int, input().split()))
cont = 0
for x in range(k+1):
for y in range(k+1):
if x + y <= s:
for z in range(k+1):
if s == (x + y + z):
cont += 1
break
print(cont) | k, s = list(map(int, input().split()))
cont = 0
for x in range(k+1):
for y in range(k+1):
if x + y <= s:
if s - (x+y) <= k:
cont += 1
print(cont) | p03835 |
k,s=list(map(int,input().split()))
L=[x+y+z for x in range(k+1) for y in range(k+1) for z in range(k+1)]
print((L.count(s))) | k,s=list(map(int,input().split()))
ans=0
for x in range(k+1):
for y in range(k+1):
if s-x-y>=0 and s-x-y<=k:
ans+=1
print(ans) | p03835 |
k,s=list(map(int,input().split()))
ans=0
for x in range(k+1):
for y in range(k+1):
if s-x-y>=0 and s-x-y<=k:
ans+=1
print(ans) | k,s=list(map(int,input().split()))
print((len([1 for z in range(k+1) for y in range(k+1) if 0<=s-y-z<=k]))) | p03835 |
ans=0
K,S=list(map(int,input().split()))
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):
if i+j+k==S:
ans+=1
print(ans) | ans=0
K,S=list(map(int,input().split()))
for i in range(K+1):
for j in range(K+1):
if 0<=S-i-j<=K:
ans+=1
print(ans) | p03835 |
K, S = list(map(int, input().split()))
count = 0
for X in range(K+1):
for Y in range(K+1):
if S-X-Y >= 0 and S-X-Y <= K:
count += 1
print(count) | import sys
readline = sys.stdin.readline
def main():
K, S = list(map(int, readline().rstrip().split()))
ans = 0
for x in range(K+1):
for y in range(K+1):
if 0 <= S - x - y <= K:
ans += 1
print(ans)
if __name__ == '__main__':
main() | p03835 |
# ABC051 B - Sum of Three Integers
K,S = list(map(int,input().split()))
ans = 0
for i in range(0,K+1):
for j in range(0,K+1):
for k in range(0,S-i-j+1):
if i+j+k == S and 0<=k<=K:
ans += 1
print(ans) | # ABC051 B - Sum of Three Integers
K,S = list(map(int,input().split()))
ans = 0
for i in range(0,K+1):
for j in range(0,K+1):
k = S-i-j
if 0<=k<=K:
ans += 1
print(ans) | p03835 |
def abc():
k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
for y in range(k + 1):
for z in range(k + 1):
if x + y + z == s:
ans += 1
print(ans)
abc()
| k, s = list(map(int, input().split()))
ans = 0
for x in range(k + 1):
for y in range(k + 1):
if 0 <= s - (x + y) <= k:
ans += 1
print(ans)
| p03835 |
k,s=list(map(int, input().split()))
ans=0
for x in range(k+1):
for y in range(min(k+1,s+1-x)):
z=s-x-y
if x+y<=s and x<=k and y<=k and z<=k:
ans+=1
print(ans) | k,s=list(map(int, input().split()))
ans=0
for x in range(k+1):
for y in range(min(k+1,s+1-x)):
z=s-x-y
if 0<=z<=k:
ans+=1
print(ans) | p03835 |
k, s = list(map(int, input().split()))
ans = 0
for i in range(k + 1):
for j in range(k + 1):
for l in range(k + 1):
if i+j+l == s:
ans+=1
print(ans) | k, s = list(map(int, input().split()))
ans = 0
for i in range(k + 1):
for j in range(k + 1):
if i+j<=s and i+j+k>=s:
ans += 1
print(ans) | p03835 |
k,s = list(map(int,input().split()))
def fact(n):
return sum([x for x in range(1,n+1)])
ans = 0
r = 0
for x in range(k+1):
for y in range(x,k+1):
for z in range(y,k+1):
if x+y+z == s:
if x == y == z:
ans += 1
elif (x==y) or (x==z) or (y==z):
ans += fact(2)
else:
ans += fact(3)
print(ans)
| k,s = list(map(int,input().split()))
def fact(n):
return sum([x for x in range(1,n+1)])
ans = 0
r = 0
for x in range(k+1):
for y in range(x,k+1):
if 0 <= s - (x+y) <= k:
if (x==y):
ans += 1
else:
ans += 2
print(ans) | p03835 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.