input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
k,s=list(map(int,input().split()))
upper = min(k,s)+1
lower = max(0,s-2*k)
ans = 0
for i in range(lower,upper):
for j in range(lower,upper):
if i + j > s:
break
for k in range(lower,upper):
if i+j+k == s:
ans += 1
break
print(ans) | k,s=list(map(int,input().split()))
upper = min(k,s)+1
lower = max(0,s-2*k)
ans = 0
for i in range(lower,upper):
for j in range(lower,upper):
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):
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):
if 0 <= S-x-y <= K:
count += 1
print(count)
| p03835 |
cnt=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:
cnt+=1
print(cnt)
| 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()))
count = 0
for x in range(k+1):
if x==s:
count+=1
elif x+2*k>=s:
for y in range(k+1):
if x+y==s:
count+=1
elif x+y+k>=s:
for z in range(k+1):
if x+y+z==s:
count+=1
break
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 |
import sys
input = sys.stdin.readline
K, S = list(map(int, input().split()))
cnt = 0
for i in range(K+1):
for j in range(K+1):
k = S - i - j
if k < 0 or k > K:
continue
if i+j+k == S:
cnt += 1
print(cnt) | import sys
input = sys.stdin.readline
K, S = list(map(int, input().split()))
cnt = 0
for i in range(K+1):
for j in range(K+1):
k = S - i - j
if k >= 0 and k <= K:
cnt += 1
print(cnt) | p03835 |
import sys
k,s=list(map(int,input().split()))
sati=0
for i in range(k+1):
for j in range(k+1):
for z in range(k+1):
suma=i+j+z
if suma==s:
sati+=1
suma=0
print(sati) | 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 and z % 1 == 0):
ans += 1
print(ans)
| p03835 |
k, s = list(map(int, input().split()))
li = []
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if z == s - (x + y):
li.append('{} {} {}'.format(x, y, z))
li
print((len(set(li)))) | k, s = list(map(int, input().split()))
li = []
a=0
for x in range(k+1):
for y in range(k+1):
if 0 <= s - (x + y) <= k:
a += 1
a
print(a) | p03835 |
limit, sum_xyz = list(map(int, input().split()))
pair = list()
for x in range(limit + 1):
y_limit = 0
for y in range(limit + 1):
z = sum_xyz - x - y
if z < 0 or z > limit:
continue
pair.append([x, y, z])
ans = len(pair)
print(ans) | import sys
input = sys.stdin.readline
def main():
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)
if __name__ == '__main__':
main() | p03835 |
limit, sum_xyz = list(map(int, input().split()))
pair = list()
for x in range(limit + 1):
for y in range(limit + 1):
z = sum_xyz - x - y
if z < 0 or z > limit:
continue
else:
pair.append([x, y, z])
ans = len(pair)
print(ans) | limit, sum_xyz = list(map(int, input().split()))
pair = list()
ans = 0
for x in range(limit + 1):
for y in range(limit + 1):
z = sum_xyz - x - y
if z < 0 or z > limit:
continue
else:
ans += 1
print(ans) | p03835 |
K, S = list(map(int, input().split()))
L = [x + y + z
for z in range(K+1)
for y in range(K+1)
for x in range(K+1)
]
print((L.count(S))) | K, S = list(map(int, input().split()))
cnt = 0
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):
if i + j + k == S: 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):
for k in range(K+1):
if i + j + k == S: cnt += 1
print (cnt)
| K, S = list(map(int, input().split()))
L = [1 for z in range(K+1) for y in range(K+1) if 0 <= S-y-z <= K]
print((L.count(1))) | p03835 |
import itertools
"""
整数K,S
2 <= K <= 2500, 0 <= S <= 3K
0 <= X,Y,Z <= K
X + Y + Z = Sを満たすX,Y,Zの割り当ては何通り？
"""
K, S = list(map(int, input().strip().split(' ')))
X = list(range(K + 1))
Y = list(range(K + 1))
Z = list(range(K + 1))
count = 0
for i, j, k in list(itertools.product(X,Y,Z)):
if i + j + k == S:
count += 1
print(count) | import itertools
K, S = list(map(int, input().strip().split(' ')))
X = list(range(K + 1))
count = 0
for i, j in itertools.product(X, repeat=2):
if 0 <= S - i - j <= K:
count += 1
print(count)
| p03835 |
import itertools
K, S = list(map(int, input().strip().split(' ')))
X = list(range(K + 1))
Y = list(range(K + 1))
Z = list(range(K + 1))
count = 0
for i, j, k in itertools.product(X, Y, Z):
if i + j + k == S:
count += 1
print(count) | import itertools
K, S = list(map(int, input().strip().split(' ')))
X = list(range(K + 1))
Y = list(range(K + 1))
Z = list(range(K + 1))
count = 0
for i, j in itertools.product(X, Y):
if S - i - j in Z:
count += 1
print(count) | 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):
if (i+j+k) == 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):
a = S - i - j
if 0<=a<=K: num+=1
print(num) | p03835 |
import bisect
k, s = list(map(int, input().split()))
ans = 0
if k * 3 == s:
print((1))
exit(0)
else:
for v in range(k + 1):
for x in range(k + 1):
if v + x > s:
continue
else:
targ = s - v - x
hoge = bisect.bisect_left([i for i in range(k + 1)], targ)
if hoge < 0 or hoge > k:
pass
else:
ans += 1
print(ans)
| # import bisect
k, s = list(map(int, input().split()))
ans = 0
if k * 3 == s:
print((1))
exit(0)
else:
for v in range(k + 1):
# bisect.bisect_left([i for i in range(2 * k + 1)], s - v)
for x in range(k + 1):
if v + x > s:
continue
else:
targ = s - v - x
# hoge = bisect.bisect_left([i for i in range(k + 1)], targ)
if targ < 0 or targ > k:
pass
else:
ans += 1
print(ans)
| p03835 |
K, S = list(map(int, input().split()))
cnt = 0
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):
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 0 <= S - (i + j) <= K:
cnt += 1
print(cnt)
| p03835 |
k,s = list(map(int,input().split()))
count = 0
for x in range(0,k+1):
#print(x)
for y in range(0,k+1):
#print(y)
for z in range(0,k+1):
#print(z)
if (x+y+z) == s :
count += 1
print(count) |
k,s = list(map(int,input().split()))
count = 0
for x in range(0,k+1):
for y in range(0,k+1):
if 0 <= (s-x-y) and (s-x-y) <= k:
count += 1
print(count) | p03835 |
K, S = list(map(int, input().split()))
count = 0
for z in range(K+1):
for y in range(K+1):
x = S - z - y
if (0 <= x <= K) & (0 <= y <= K) & (0 <= z <= K):
count += 1
print(count)
| K, S = list(map(int, input().split()))
count = 0
for z in range(K+1):
for y in range(K+1):
x = S - z - y
if (0 <= x <= K) :
count += 1
print(count)
| p03835 |
#!/usr/bin/python3
# -*- coding: utf-8 -*-
"""
https://beta.atcoder.jp/contests/abc009/tasks/abc51_2
"""
import sys
import math
from inspect import currentframe
def debug(*args):
names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}
print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args), file=sys.stderr)
K, S = map(int, input().split())
count = 0
for X in range(0, min(S + 1, K + 1)):
for Y in range(0, min(S + 1, K + 1)):
for Z in range(0, min(S + 1, K + 1)):
if X + Y + Z == S:
count += 1
print(count)
| #!/usr/bin/python3
# -*- coding: utf-8 -*-
"""
https://beta.atcoder.jp/contests/abc009/tasks/abc51_2
"""
import sys
import math
from inspect import currentframe
def debug(*args):
names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}
print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args), file=sys.stderr)
K, S = map(int, input().split())
count = 0
for X in range(0, min(S + 1, K + 1)):
for Y in range(0, min(S + 1, 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 x in range(k+1):
for y in range(k+1):
z=s-x-y
if z<0:
break
if 0<=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()))
count=0
for x in range(k+1):
for y in range(x+1):
for z in range(y+1):
if x+y+z==s:
if x==y==z:
count+=1
elif x==y or y==z or z==x:
count+=3
else:
count+=6
print(count)
| k,s=list(map(int,input().split()))
count=0
for x in range(k+1):
for y in range(x+1):
if x+y>s:
continue
else:
z=s-x-y
if z>x or z>y:
continue
if x==y==z:
count+=1
elif x==y or y==z or z==x:
count+=3
else:
count+=6
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()))
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 i in range(K + 1):
for j in range(K + 1):
if 0 <= S - i - j <= K:
count += 1
print(count) | K, S = list(map(int, input().split()))
count = 0
for i in range(K + 1):
if 0 <= S - i < K:
count += S - i + 1
elif K <= S - i <= 2 * K:
count += 2 * K - S + i + 1
else:
continue
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()))
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):
for y in range(k+1):
if s-x-y<=k and s-x-y>=0:
res+=1
#print(x,y,s-x-y)
print(res) | p03835 |
k,s = list(map(int,input().split()))
total = 0
for i in range(k+1):
for j in range(i,k+1):
for l in range(j,k+1):
if s == i+j+l:
if(i == j and j == l):
total += 1
elif((i == j and j != l) or (i != j and j == l) or (i == l and j != l)):
total += 3
else:
total += 6
print(total)
| k,s = list(map(int,input().split()))
total = 0
for i in range(k+1):
for j in range(k+1):
if (i+j > s) or (s-i-j > k):
continue
else:
total += 1
print(total)
| p03835 |
K,S = list(map(int,input().split()))
count = 0
for p in range(K+1):
for q in range(K+1):
for r in range(K+1):
if p+q+r == S:
count+=1
print(count)
| K,S = list(map(int,input().split()))
count = 0
for p in range(K+1):
for q in range(K+1):
if S-p-q>=0 and S-p-q <= K:
count+=1
print(count)
| p03835 |
k,s=list(map(int,input().split()))
count=0
nums=[i for i in range(k+1)]
for i in range(len(nums)):
for j in range(len(nums)):
l = s-i-j
if 0 <= l <=k:
if i+j+l==s:
count+=1
print((count))
| k,s=list(map(int,input().split()))
count=0
nums=[i for i in range(k+1)]
for i in range(len(nums)):
for j in range(len(nums)):
if 0 <= s-i-j <= 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):
for z in range(k+1):
if x + y + z == s:
cnt = 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):
z = s - (x + y)
if z >= 0 and z <= k:
cnt = cnt + 1
# for z in range(k+1):
# if x + y + z == s:
# cnt = cnt + 1
print(cnt) | p03835 |
K, S = list(map(int, input().split()))
cnt = 0
for x in range(K+1):
for y in range(S-x+1):
if y <= K:
z = S - x - y
if z >= 0 and z <= K:
cnt += 1
print(cnt) | K, S = list(map(int, input().split()))
cnt = 0
for x in range(K+1):
for y in range(min(K,S-x)+1):
z = S - x - y
if z <= K:
cnt += 1
print(cnt) | p03835 |
def main():
K,S = [int(x) for x in input().split()]
cnt = 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):
if x+y+z > S:
break
if S == x+y+z:
cnt += 1
print(cnt)
if __name__ == '__main__':
main()
| def main():
K,S = [int(x) for x in input().split()]
cnt = 0
for x in range(K+1):
if x > S:
break
for y in range(K+1):
if x+y > S:
break
z = S-(x+y)
if z < 0 or z > K:
continue
# print(x,y,z)
if S == x+y+z:
cnt += 1
print(cnt)
if __name__ == '__main__':
main()
| p03835 |
def main():
k, s = list(map(int, input().split()))
pattern = 0
if s > 3 * k:
print(pattern)
return
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:
pattern += 1
print(pattern)
if __name__ == "__main__":
main()
| def main():
k, s = list(map(int, input().split()))
pattern = 0
for x in range(k + 1):
for y in range(k + 1):
if (s - x - y >= 0) and (s - x - y <= k):
pattern += 1
# Wrong Anser
#
# # 3,4 --> 0 start
# # 3,5 --> 0 start
# # 3,7 --> 1 start
# # 3,8 --> 2 start
# # 3,9 --> 3 start
# # 4,8 --> 0 start
# # 4,9 --> 1 start
# # 4,10 --> 2 start
# # s // k * 2
#
# for x in range(s // 3, k + 1):
# for y in range(s // 3, min(k + 1, s - x + 1)):
# for z in range(s // 3, min(k + 1, s - x - y + 1)):
# if x + y + z == s:
# pattern += 1
#
print(pattern)
if __name__ == "__main__":
main()
| p03835 |
K, S = list(map(int, input().split()))
Y = 0
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):
if i+j+k == S:
Y = Y+1
print(Y) | K, S = list(map(int, input().split()))
Y = 0
for i in range(K+1):
for j in range(K+1):
if 0 <= S-i-j and S-i-j <= K:
Y = Y+1
print(Y) | p03835 |
k, s = list(map(int, input().split()))
ans = 0
if s <= k:
ans = (s+2)*(s+1) / 2
elif k < s <= 2*k:
for i in range(k+1):
j = s-k+i
if j <= k:
ans += j+1
else:
ans += j+1-2*(j-k)
elif 2*k < s < 3*k:
ans = 3
else:
ans = 1
print((int(ans)))
| k, s = list(map(int, input().split()))
if 0 <= s <= k:
ans = (s+1)*(s+2)/2
print((int(ans)))
elif k < s <= 2*k:
ans = ((s+1)*(s+2)/2) - ((s-k)*(s-k+1)/2) - ((s-k)*(s-k+1))
print((int(ans)))
elif 2*k < s < 3*k:
print((3))
else:
print((1))
| p03835 |
from itertools import product
k, s = list(map(int, input().split()))
numbers = list(product([i for i in range(k+1)], repeat=2))
ans = 0
for x, y in numbers:
if x + y > s:
continue
if x + y == s:
ans += 1
elif x + y < s:
for z in range(k+1):
if x + y + z == s:
ans += 1
break
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()))
idx = 0
for x in range(k+1):
for y in range(k+1):
if x+y > s:
continue
for z in range(k+1):
if s == x+y+z:
idx += 1
print(idx)
| k, s = list(map(int, input().split()))
idx = 0
for x in range(k+1):
for y in range(k+1):
if 0 <= s - x - y <= k:
idx += 1
print(idx)
| p03835 |
N,M = input().split()
N = int(N)
M = int(M)
sum = 0
for i in range(N + 1):
for j in range(N + 1):
for k in range(N + 1):
if i + j + k == M:
sum += 1
print(sum) | N,M = input().split()
N = int(N)
M = int(M)
sum = 0
for i in range(N + 1):
for j in range(N + 1):
if 0 <= M - i - j <= N:
sum += 1
print(sum) | p03835 |
I = list(map(int, input().split()))
K, S = I[0], I[1]
count = 0
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):
if i+j+k == S:
count += 1
print(count) | I = list(map(int, input().split()))
K, S = I[0], I[1]
print((len([0 for i in range(K+1) for j in range(K+1) if 0<=S-i-j<=K]))) | p03835 |
#ABC951B/Sum_of_Three_Integers
K, S = list(map(int, input().split()))
ans = 0
for X in range(0, K+1):
for Y in range(X, K+1):
for Z in range(Y, K+1):
if X == Y == Z and X + Y + Z == S:
ans += 1
elif X == Y and X + Y + Z == S:
ans += 3
elif Y == Z and X + Y + Z ==S:
ans += 3
elif X + Y + Z == S:
ans += 6
print(ans) | #ABC951B/Sum_of_Three_Integers
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) | p03835 |
k, s = list(map(int, input().split()))
cnt = 0
for l in range(k+1):
for m in range(k+1):
for n in range(k+1):
if (l + m + n == s):
cnt += 1
print(cnt) | k, s = list(map(int, input().split()))
cnt = 0
for l in range(k+1):
for m in range(k+1):
n = s - l - m
if 0 <= n <= k:
cnt += 1
print(cnt) | p03835 |
K, S = list(map(int, input().split()))
count = 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:
count+=1
print(count) | K, S = list(map(int, input().split()))
count = 0
for x in range(0, K + 1):
for y in range(0, 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):
ans = 0
for i in range(K+1):
for j in range(K+1):
for r in range(K+1):
if(i+j+r == S):
ans += 1
print(ans)
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()
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):
ans = 0
## TLE
# for i in range(K+1):
# for j in range(K+1):
# for r in range(K+1):
# if(i+j+r == S):
# ans += 1
for i in range(K+1):
for j in range(K+1):
r = S - i - j
if(0 <= r <= K):
ans += 1
print(ans)
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()
K = int(next(tokens)) # type: int
S = int(next(tokens)) # type: int
solve(K, S)
if __name__ == '__main__':
main()
| p03835 |
#!/usr/bin/env python3
import sys
def solve(K: int, S: int):
ans = 0
## TLE
# for i in range(K+1):
# for j in range(K+1):
# for r in range(K+1):
# if(i+j+r == S):
# ans += 1
for i in range(K+1):
for j in range(K+1):
r = S - i - j
if(0 <= r <= K):
ans += 1
print(ans)
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()
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
sys.setrecursionlimit(10000000)
INF = 1<<32
def solve(K: int, S: int):
ans = 0
for x in range(K+1):
for y in range(K+1):
if 0 <= S-x-y <= K:
ans += 1
print(ans)
return
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=[int(i) for i in input().split()]
a=0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if x+y+z==S:
a+=1
print(a) | K,S=[int(i) for i in input().split()]
a=0
for x in range(K+1):
for y in range(K+1):
z=S-x-y
if 0<=z and K>=z:
a+=1
print(a) | p03835 |
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 in range(k + 1):
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 z in range(0, k+1):
sz = s-z
for xy in range(0, k+1):
if xy+xy == sz:
ans += 1
break
elif xy+xy > sz:
break
for x in range(0, k):
for y in range(x+1, k+1):
if x+y == sz:
ans +=2
break
elif x+y > sz:
break
print(ans) | k, s = list(map(int, input().split()))
ans = 0
for z in range(0, k+1):
sz = s-z
for x in range(0, k+1):
szx = sz-x
if 0 <= szx <= 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):z=S-x-y;ans+=(0<=z<=K)
print(ans) | K,S=list(map(int,input().split()))
print((sum(0<=S-x-y<=K for x in range(K+1)for y in range(K+1)))) | p03835 |
K, S = list(map(int, input().split()))
X = list(range(K + 1))
Y = list(range(K + 1))
Z = list(range(K + 1))
count = 0
for i in X:
for p in Y:
for o in Z:
if (S - (i + p)) > K:
break
if (i + p + o) == S:
count += 1
elif (i + p + o) > S:
break
print(count) | K, S = list(map(int, input().split()))
X = list(range(K + 1))
Y = list(range(K + 1))
Z = list(range(K + 1))
count = 0
for i in X:
for p in Y:
if (S - (i + p)) in Z:
count += 1
print(count) | p03835 |
K,S = list(map(int,input().split()))
cnt= 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):
cnt += 1
if((x + y + z )>S):
break
print(cnt) | K,S = list(map(int,input().split()))
cnt= 0
for x in range(0,K+1):
for y in range(0,K+1):
if(0 <= S - x - y and S - x - y <= K):
cnt += 1
print(cnt) | p03835 |
k,s=list(map(int,input().split()))
c=0
for i in range(k+1):
for j in range(k+1):
for k in range(k+1):
if i+j+k==s:
c=c+1
print(c) | k,s=list(map(int,input().split()))
c=0
for i in range(k+1):
for j in range(k+1):
if 0<=s-i-j<=k:
c=c+1
print(c) | p03835 |
# http://abc051.contest.atcoder.jp/tasks/abc051_b
K,N=list(map(int,input().split()))
count=0
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):
if i+j+k==N:
count+=1
print(count) | # http://abc051.contest.atcoder.jp/tasks/abc051_b
K,N=list(map(int,input().split()))
count=0
for i in range(K+1):
for j in range(K+1):
# print i,j,(N-(i+j))
if 0<=(N-(i+j))<=K:
count+=1
print(count) | p03835 |
K, S = list(map(int, input().split()))
cnt = 0
for i in range(K + 1):
for j in range(i, K + 1):
for k in range(j, K + 1):
if i + j + k == S:
if i == j == k:
cnt += 1
elif i == j or j == k or i == k:
cnt += 3
else:
cnt += 6
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 >= S - K:
cnt += 1
print(cnt) | p03835 |
import sys
input = sys.stdin.readline
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 z==S-x-y: count+=1
print(count) | import sys
input = sys.stdin.readline
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) | p03835 |
k,s = list(map(int,input().split()))
Xm = k
Ym = k
Zm = k
count = 0
for i in range(Xm+1):
for j in range(Ym+1):
for m in range(Zm+1):
if i+j+m == s:
count += 1
print(count) | k,s = list(map(int,input().split()))
Xm = k
Ym = k
Zm = k #使わない
count = 0
for i in range(Xm+1):
for j in range(Ym+1):
if 0<= s - (i+j) <= k:
count += 1
print(count) | p03835 |
import sys
sys.setrecursionlimit(10**6)
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return list(map(int,sys.stdin.readline().rstrip().split()))
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
k,s=mii()
cnt=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:
cnt+=1
print(cnt) | import sys
sys.setrecursionlimit(10**6)
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return list(map(int,sys.stdin.readline().rstrip().split()))
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
k,s=mii()
cnt=0
for i in range(0,k+1):
for j in range(0,k+1):
if 0<=s-(i+j)<=k:
cnt+=1
print(cnt) | p03835 |
from sys import stdin
K,S = [int(x) for x in stdin.readline().rstrip().split()]
ans = 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:
ans += 1
print(ans) | from sys import stdin
K,S = [int(x) for x in stdin.readline().rstrip().split()]
ans = 0
for X in range(0,K+1):
for Y in range(0,K+1):
if 0 <= S-(X+Y) <= K:
ans += 1
print(ans) | p03835 |
k, s = list(map(int, input().split()))
count = 0
for i in range(k+1):
if(i>s):
break
for j in range(k+1):
if(i+j>s):
break
for c in range(k+1):
if(i + j + c == 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 and s-i-j <= k):
count += 1
print(count) | p03835 |
a = list(map(int,input().split()))
k = int(a[0])
s = int(a[1])
count = 0
for x in range(k+1):
if (x == s):
count += 1
else:
for y in range(k+1):
if (x + y == s):
count += 1
else:
for z in range(k+1):
if(x + y + z == s):
count += 1
print(count) | a = list(map(int,input().split()))
k = int(a[0])
s = int(a[1])
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) | p03835 |
K,S=list(map(int,input().split()))
ans=0
l=[i for i in range(K+1)]
for x in range(K+1):
for y in range(K+1):
if (S-x-y in l)==True:
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()))
count = 0
for i in range(s+1):
for j in range(1+s-i):
if 0<=i<=k and 0<=j<=k and 0<=s-i-j<=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):
if 0 <= 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):
if S-(x+y) in range(K+1):
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:
cnt += 1
print(cnt) | p03835 |
K, S = list(map(int, input().split()))
res = 0
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):
if i + j + k == S:
res += 1
print(res) | K, S = list(map(int, input().split()))
res = 0
for i in range(K+1):
for j in range(K+1):
if 0 <= S - (i + j) <= K:
res += 1
print(res) | p03835 |
def solve(K, S):
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)
if __name__ == '__main__':
K, S = list(map(int, input().split()))
solve(K, S) | def solve(K, S):
count = 0
for x in range(K+1):
for y in range(K+1):
if K >= S - (x + y) >= 0 :
count += 1
print(count)
if __name__ == '__main__':
K, S = list(map(int, input().split()))
solve(K, S) | p03835 |
K, S = list(map(int, input().split()))
count = 0
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):
if i + j + k == 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 and S - i - j <= 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()))
count=0
for x in range(k+1):
for y in range(k+1):
if 0<=s-x-y and s-x-y<=k:
count+=1
print(count) | p03835 |
K,S=input().split()
K,S=[int(K),int(S)]
a=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:
a+=1
print(a) | K,S=input().split()
K,S=[int(K),int(S)]
a=0
for X in range(K+1):
for Y in range(K+1):
Z=S-X-Y
if 0<=Z<=K:
a+=1
print(a) | p03835 |
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]))) | def main():
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)
if __name__ == '__main__':
main()
| p03835 |
K, S = list(map(int, input().split()))
# print(K)
# print(S)
count = 0
for i in range(K + 1):
for j in range(K + 1):
for k in range(K + 1):
if i + j + k == S:
count += 1
print(count) | K, S = list(map(int, input().split()))
# print(K)
# print(S)
count = 0
for i in range(K + 1):
for j in range(K + 1):
# for k in range(K + 1):
# if i + j + k == S:
# count += 1
if i + j <= S and i + j + K >= S:
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(i+j<=s and s-(i+j)<=k):
ans+=1
print(ans) | p03835 |
def resolve():
import bisect
k, s = list(map(int, input().split()))
cnt = 0
k += 1
lx = [x for x in range(k)]
for i in range(k):
for j in range(k):
if s-i-j >= 0:
index = bisect.bisect_right(lx, s-i-j)-1
if i+j+index == s and index <= k:
cnt += 1
print(cnt)
resolve() | def resolve():
k, s = list(map(int, input().split()))
cnt = 0
for i in range(k+1):
if i > s:
break
for j in range(k+1):
if 0 <= s-i-j <= k:
cnt += 1
elif s-i-j < 0:
break
print(cnt)
resolve() | p03835 |
KS = list(map(int,input().split()))
K=KS[0]
S=KS[1]
XYZ = [[z,y,x] for z in range(0,K+1) for y in range(0,K+1) for x in range(0,K+1) if (x+y+z)==S]
print((len(XYZ)))
| k,s = list(map(int, input().split()))
a = (s+2)*(s+1)/2
b = (s-k+1)*(s-k)/2
c = (s-2*k)*(s-2*k-1)/2
if s <= k:
print((int(a)))
elif s <= 2*k+1:
print((int(a-3*b)))
elif s <= 3*k:
print((int(a-3*b+3*c))) | p03835 |
n,s = list(map(int, input().split()))
cnt = 0
for i in range(n+1):
for j in range(n+1):
for k in range(n+1):
if s == i + j + 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):
z = s - i - j
if z >= 0 and z <= k:
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()))
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()))
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
z=0
for x in range(k+1):
for y in range(k+1):
z=s-x-y
if(0<=z)&(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()))
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()))
li = []
for x in range(K+1):
for y in range(K+1):
if S-x-y >= 0 and S-x-y <= K:
li.append([x, y, S-x-y])
print((len(li))) | K, S = list(map(int, input().split()))
cnt = 0
for x in range(K+1):
for y in range(K+1):
if S-x-y >= 0 and S-x-y <= K:
cnt += 1
print(cnt) | 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 0<=S-i-j<=K:
ans+=1
print(ans) | p03835 |
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()
k, s = na()
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) | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()
k, s = na()
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) | p03835 |
#!/usr/bin/env python3
# from numba import njit
# input = stdin.readline
# @njit
def solve(k,s):
res = 0
for i in range(k+1):
for j in range(k+1):
for l in range(k+1):
if i+j+l == s:
res += 1
return res
def main():
K,S = list(map(int,input().split()))
# a = list(map(int,input().split()))
print((solve(K,S)))
return
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
# from numba import njit
# input = stdin.readline
# @njit
def solve(k,s):
res = 0
for i in range(k+1):
for j in range(k+1):
l = s - i - j
if 0 <= l <= k:
res += 1
return res
def main():
K,S = list(map(int,input().split()))
# a = list(map(int,input().split()))
print((solve(K,S)))
return
if __name__ == '__main__':
main()
| p03835 |
"""
AtCoder Beginner Contest 051
B - Sum of Three Integers
"""
if __name__ == "__main__":
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 or S - (x + y) > K:
continue
ans += 1
print(ans)
| """
AtCoder Beginner Contest 051
B - Sum of Three Integers
"""
if __name__ == "__main__":
K, S = list(map(int, input().split()))
ans = 0
A = [i for i in range(K+1)]
for x in A:
for y in A:
if x + y > S or S - (x + y) > K:
continue
ans += 1
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
print(count) | a,b = list(map(int, input().split()))
count = 0
k = 0
for i in range(a + 1):
for j in range(a + 1):
k = b - (i + j)
if 0 <= k and k <= a:
count += 1
print(count) | p03835 |
li = list(map(int,input().split()))
K, S = li[0], li[1]
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) | li = list(map(int,input().split()))
K, S = li[0], li[1]
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 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
##############################
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) |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
##############################
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()))
x=dict()
ans=0
for i in range(K+1):
for j in range(K+1):
if (i+j)>S:
break
x=i
y=j
z=S-x-y
if 0<=z:
if z<=K:
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):
z=S-i-j
if 0<=z:
if z<=K:
ans+=1
print(ans) | p03835 |
k,s=list(map(int,input().split()))
true=0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x+y+z==s:
true=true+1
print(true) | k,s=list(map(int,input().split()))
true=0
for x in range(k+1):
for y in range(k+1):
if 0<=s-x-y<=k:
true=true+1
print(true) | p03835 |
K, S = [int(n) for n in input().split(' ')]
ans = 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):
if (X+Y+Z) == S:
ans += 1
elif (X+Y+Z) > S:
break
print(ans)
| K, S = [int(n) for n in input().split(' ')]
ans = 0
for x in range(0,K+1):
for y in range(0,K+1):
z = S - x - y
if z >= 0 and z <= K:
ans += 1
print(ans)
| 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):
if i+j+k==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 0<=k<=K:
num+=1
print(num)
| p03835 |
k, s = list(map(int, input().split()))
ans = 0
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:
if i == j == l:
ans += 1
elif i == j or j == l:
ans += 3
elif i != j != l:
ans += 6
print(ans) | k, s = list(map(int, input().split()))
ans = 0
for i in range(k + 1):
for j in range(i, k + 1):
if j <= s - i - j <= k:
l = s - i - j
if i == j == l:
ans += 1
elif i == j or j == l:
ans += 3
elif i != j != l:
ans += 6
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
break
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 |
ks= list(map(int, input().split()))
count = 0
x = 0
y = 0
z = 0
for targetX in range(ks[0]+1):
for targetY in range(ks[0]+1):
z = ks[1] - (targetX + targetY)
if 0 <= z and z <= ks[0]:
count += 1
targetY +=1
targetX +=1
print(count) | ks= list(map(int, input().split()))
count = 0
x = 0
y = 0
z = 0
for targetX in range(ks[0]+1):
if targetX <= ks[0] and ks[1]-(targetX+ks[0]+ks[0]) <= 0:
for targetY in range(ks[0]+1):
z = ks[1] - (targetX + targetY)
if 0 <= z and z <= ks[0]:
count += 1
print(count) | p03835 |
K,S = list(map(int,input().split()))
cnt = 0
for i in range(K + 1):
for j in range(K + 1):
for k in range(K + 1):
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):
k = S - i - j
if 0<= k <= K:
cnt += 1
print(cnt) | p03835 |
K,S = input().strip().split()
K,S = int(K),int(S)
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 = input().strip().split()
K,S = int(K),int(S)
count = 0
for x in range(S+1):
for y in range(S+1-x):
z = S - x- y
#print( x,y,z)
if x <= K and y <= K and z <= K:
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 0<=S-i-j<=K:
ans+=1
print(ans) | 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(S == x+y+z):
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((S-x-y <= K) and (S-x-y >= 0)):
counter += 1
print(counter) | p03835 |
k,s = list(map(int,input().split()))
ans = 0
for h in range(k+1):
for i in range(k+1):
for j in range(k+1):
if h+i+j==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 k >= s-i-j >= 0:
ans += 1
print(ans) | p03835 |
K, S = list(map(int, input().split()))
count = (K + 1) ** 3
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):
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):
for k in range(k+1):
if i+j+k == 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 s-k <= i+j <= s:
count += 1
print(count)
| p03835 |
K_S = input().split(" ")
ans = 0
for X in range(int(K_S[0]) + 1):
for Y in range(int(K_S[0]) + 1):
Z = int((K_S[1])) - X - Y
if 0 <= Z & Z <= int(K_S[0]):
ans += 1
print(ans)
| K_S = input().split()
ans = 0
for X in range(int(K_S[0]) + 1):
for Y in range(int(K_S[0]) + 1):
Z = int((K_S[1])) - X - Y
if 0 <= Z & Z <= int(K_S[0]):
ans += 1
print(ans)
| 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):
z = S - x - y
if 0 <= z and z<= K:
c += 1
print(c) | p03835 |
K, S = list(map(int,input().split()))
count = 0
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):
if i + j + k ==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):
k = S - i - j
if k >= 0 and k <=K:
count +=1
print(count) | p03835 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.