problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03835 | s184644282 | Accepted | K, S = 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 | s280163245 | Accepted | k ,s = map(int, input().split())
count = 0
for x in range(k+1):
for y in range(k +1):
if ((x + y) <= s) and ((s - (x + y)) <= k):
count += 1
print(count) |
p03835 | s642234769 | Accepted | K, S = 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 | s223068955 | Accepted | # -*- coding: utf-8 -*-
K, S = map(int, input().split())
results = 0
for x in range(K+1):
for y in range(K+1):
z = S - x - y
if 0 <= z <= K:
results += 1
print(results)
|
p03835 | s232712163 | Accepted | from operator import mul
from functools import reduce
def combinations_count(n, r):
if n<r: return 0
r = min(r, n - r)
numer = reduce(mul, range(n, n - r, -1), 1)
denom = reduce(mul, range(1, r + 1), 1)
return numer // denom
def main():
K,S = map(int, input().split())
ans = 0
# x+y<=Sとなるように回す
for x in range(K+1):
for y in range(K+1):
z = S-(x+y)
if x+y<=S and 0<=z and z<=K: ans += 1
print(ans)
main()
|
p03835 | s978799054 | Accepted | k,s = map(int,input().split())
x = 0
l = []
for i in range(k+1):
for j in range(k+1):
if s-i-j >= 0 and s-i-j <= k:
x += 1
print(x)
|
p03835 | s947780858 | Accepted | K, S = map(int, input().split())
ans = sum(0 <= S-x-y <= K for x in range(K+1) for y in range(K+1))
print(ans) |
p03835 | s551030574 | Accepted | k, s = map(int, input().split())
def fun(k, s):
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
return count
print(fun(k, s)) |
p03835 | s386706073 | Accepted | k,s=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 | s056832304 | Accepted | K, S = map(int, input().split())
ans = 0
for x in range(K+1):
for y in range(K+1):
z = S -x - y
#print(x, y, z)
if z >= 0 and z <= K:
ans += 1
print(ans) |
p03835 | s325631066 | Accepted | K,S = 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 | s331617314 | Accepted | from itertools import *
k, s = map(int, input().split())
t = sum(min(max(s - i + 1, 0), max(2*k - s + i +1, 0)) for i in range(k+1))
print(t) |
p03835 | s872881942 | Accepted | # -*- coding: utf-8 -*-
k, s = 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 | s402666743 | Accepted | K, S = 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 | s213443874 | Accepted | K, S = map(int, input().split())
c = 0
for x in range(K+1):
for y in range(K+1):
if x+y <= S and x+y+K >= S:
c += 1
print(c)
|
p03835 | s540086505 | Accepted | K,S = 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) & (x + y + z == S):
cnt +=1
print(cnt) |
p03835 | s816338677 | Accepted | K,S = 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 += 1
print(c) |
p03835 | s349502034 | Accepted | k, s = map(int, input().split())
counter = 0
for i in range(k+1):
for j in range(k+1):
if s-i-j>=0 and s-i-j<=k:
counter += 1
print(counter) |
p03835 | s154983953 | Accepted | import sys
K, S = map(int, sys.stdin.readline().split())
ans = 0
for i in range(K+1):
for j in range(K+1):
if S - i - j < 0:
break
elif S - i - j > K:
continue
else:
ans += 1
print(ans) |
p03835 | s119813821 | Accepted | K, S = map(int, input().split())
counter = 0
for x in range(K + 1):
for y in range(K + 1):
z = S - (x + y)
if z >= 0 and z <= K:
counter += 1
print(counter) |
p03835 | s811397942 | Accepted | k , s = 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 | s322603341 | Accepted | 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 | s613518918 | Accepted | from sys import stdin
k,s = map(int,stdin.readline().rstrip().split())
point = 0
for i in range(k+1):
for j in range(k+1):
if 0 <= s-(i+j) <= k:
point += 1
print(point) |
p03835 | s142373879 | Accepted | k,s = map(int,input().split())
x,y,z = k,k,k
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 | s190141211 | Accepted | K, S = 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 | s045031641 | Accepted | K, S = 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 | s971680798 | Accepted | import sys
input = sys.stdin.readline
def main():
K, S = 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
else:
continue
print(ans)
if __name__ == "__main__":
main()
|
p03835 | s228590331 | Accepted | #SumofThreeIntegers
k, s = 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 | s712455550 | Accepted | x,s=map(int,input().split())
n=x+1
a=0
for i in range(n):
for j in range(n):
if 0<=(s-(i+j))<=x:
a+=1
print(a) |
p03835 | s188433562 | Accepted | K,S=map(int,input().split())
count=0
for x in range(0,K+1,1):
for y in range(0,K+1,1):
if ((S-x-y)>=0)and((S-x-y)<=K):
count=count+1
print(count) |
p03835 | s312349936 | Accepted | k,s = map(int,input().split())
sum =0
for i in range(k+1):
for l in range(k+1):
if 0<=s-i-l<=k:
sum += 1
print(sum) |
p03835 | s143524892 | Accepted | 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 | s664114611 | Accepted | k,s=map(int,input().split())
n=0
for x in range(k+1):
for y in range(k+1):
if 0<=s-x-y<=k:
n+=1
print(n) |
p03835 | s627724957 | Accepted | K,S=map(int,input().split())
z = list(range(0,K+1))
answer = []
for i in z:
s_z = S - i
if s_z < 0:
pass
elif K < s_z:
if (K + 1) > (s_z - K):
answer.append(K + 1 - (s_z - K))
else:
answer.append(s_z + 1)
print(sum(answer)) |
p03835 | s408388320 | Accepted | 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 Z>=0 and Z<=K: ans+=1
print(ans) |
p03835 | s781411014 | Accepted | k, s = list(map(int, input().split()))
count = 0
for x in range(k+1):
for y in range(min(k+1, s-x+1)):
z = s-x-y
ans = x+y+z
if y <= k and z <= k:
count += 1
print(count)
|
p03835 | s896375493 | Accepted | 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 or i+j+K < S:
continue
else:
ans+=1
print(ans) |
p03835 | s059192644 | Accepted | #2020-04-29
k, s = map(int,input().split())
cou = 0
for i in range(k + 1):
for j in range(k + 1):
z = s - i - j
if 0 <= z <=k:
cou += 1
print(cou) |
p03835 | s571494170 | Accepted | k,s = map(int,input().split())
ans = 0
from itertools import product
for x,y in product(range(k+1), repeat=2):
if 0 <= s-x-y <= k:
ans +=1
print(ans)
|
p03835 | s829883301 | Accepted | K,S=map(int,input().split())
ANS=0
for i in range(K+1):
if i > S:
break
for j in range(K+1):
z = i + j
if S - z >= 0 and S - z <= K:
#print(i,j,S-z)
ANS+=1
else:
if S - z <= 0:
break
print(ANS) |
p03835 | s662719463 | Accepted | import itertools
k,s = map(int,input().split())
cnt = 0
for i in range(0,k+1):
for j in range(0,k+1):
z = s - i -j
if z >= 0 and z <= k:
cnt += 1
print(cnt)
|
p03835 | s550404668 | Accepted | k,s = map(int,input().split())
count = 0
for i in range(k+1):
for j in range(k+1):
m = s-j-i
if(m <= k and 0 <= m):
#print(i,j,m)
count += 1
print(count) |
p03835 | s216453524 | Accepted | def resolve():
k, s = map(int, input().split())
cnt = 0
for i in range(k+1):
for j in range(k+1):
t = s - (i + j)
if i + j + t == s and 0 <= t <= k:
cnt += 1
print(cnt)
resolve() |
p03835 | s303442856 | Accepted | 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 | s211567741 | Accepted | import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
K, S = 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 | s040983070 | Accepted | K, S = list(map(int, input().split()))
res = 0
for x in range(K+1):
for y in range(K+1):
z = S - x - y
if z >= 0 and z <= K:
res += 1
print(res) |
p03835 | s470274198 | Accepted | K,S= 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 | s118949208 | Accepted | K, S = map(int, input().split())
cnt = 0
for x in range(K+1):
for y in range(K+1):
if 0 <= S - x - y and S - x - y <= K:
cnt += 1
print(cnt) |
p03835 | s347654764 | Accepted | K,S=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 | s711588789 | Accepted | import sys
input = sys.stdin.readline
K,S=map(int,input().split())
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 + K - s_z + 1)
else:
ans.append(s_z + 1)
print(sum(ans)) |
p03835 | s484701489 | Accepted | K,S = map(int,input().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 | s207022627 | Accepted | # -*- coding: utf-8 -*-
# B - Sum of Three Integers
# 標準入力の取得
K,S = list(map(int, input().split()))
# 全探索を行う
available_value_list = range(K+1)
result = 0
for x in available_value_list:
for y in available_value_list:
z = S - x - y # x + y + z = Sより算出
if 0 <= z and z <= K:
result += 1
# 結果出力
print(result) |
p03835 | s877022332 | Accepted | k,s = 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 | s230986828 | Accepted | k,s = map(int,input().split())
a = 0
for x in range(k+1):
for y in range(k+1):
if s-(x+y) <= k and s-(x+y) >= 0:
a += 1
print(a) |
p03835 | s125032951 | Accepted | k,s = 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 | s869095795 | Accepted | K, S = map(int, input().split())
count = 0
for x in range(K + 1):
for y in range(K + 1):
z = S - (x + y)
if z <= K and 0 <= z:
count += 1
print(count)
|
p03835 | s525886643 | Accepted | K, S = 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:
#print(i, j, (S - (i + j)))
count += 1
print(count) |
p03835 | s668537699 | Accepted | k,s=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 | s015221215 | Accepted | K, S = map(int, input().split())
ans = 0
for i in range(K+1):
if min(S-i, K) == K:
ans += max(2 * K - (S - i) + 1, 0)
else:
ans += max(S - i + 1, 0)
print(ans) |
p03835 | s405887261 | Accepted | k,s = 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 += 1
print(cnt) |
p03835 | s779275507 | Accepted | def LI():
return list(map(int, input().split()))
K, S = LI()
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 | s866811667 | Accepted | K, S = map(int, input().split())
out = 0
# 全探査だと間に合わない
# zはあるかないかの２択なので外せる
for x in range(K+1):
for y in range(K+1):
z = S-x-y
if 0 <= z <= K:
out += 1
print(out)
|
p03835 | s942445615 | Accepted | K, S = map(int, input().split())
ans = 0
for X in range(1 + K):
for Y in range(1 + K):
Z = S - (X + Y)
if Z < 0 or Z > K:
continue
ans += 1
print(ans)
|
p03835 | s021607841 | Accepted | import itertools
K, S = map(int, input().split())
ans = 0
for i in itertools.product(range(K+1), repeat=2):
if 0 <= (S - sum(i)) <= K:
ans += 1
print(ans) |
p03835 | s740405743 | Accepted | k,s=map(int,input().split())
ans=0
for x in range(k+1):
for y in range(k+1):
if x+y<=s and x+y+k>=s:
ans+=1
print(ans) |
p03835 | s865762426 | Accepted | K, S = 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 | s891805375 | Accepted | K,S=map(int,input().split())
res=0
for i in range(K+1):
for j in range(K+1):
if S-i-j>=0 and S-i-j<=K:
res+=1
print(res)
|
p03835 | s624867739 | Accepted | #!/usr/bin/env python
# -*- coding: utf-8 -*-
(K, S) = map(int, input().split(' '))
r = 0
for x in range(0, K + 1):
for y in range(0, K + 1):
d = S - (x + y)
if 0 <= d <= K:
r += 1
print(r)
|
p03835 | s584704419 | Accepted | K,S = map(int,input().split())
ans = 0
for X in range(K+1):
for Y in range(K+1):
if 0 <= S - X - Y and S - X - Y <= K:
ans += 1
print(ans)
|
p03835 | s744449820 | Accepted | K, S = map(int, input().split())
ans = 0
for i in range(0, K+1):
if i > S:
break
for j in range(0, K+1):
if i + j > S:
break
if S - i - j <= K:
ans += 1
print(ans) |
p03835 | s982345905 | Accepted |
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)<=k :
count+=1
print(count)
|
p03835 | s400461141 | Accepted | K,S=map(int,input().split())
cnt=0
if K*3==S:
cnt+=1
elif K*3<S:
pass
else:
for x in range(K+1):
for y in range(K+1):
if 0<=S-x-y<=K:
cnt+=1
print(cnt) |
p03835 | s144312881 | Accepted | K,S = map(int,input().split(" "))
ans = 0
if S == 3*K:
print(1)
exit()
for z in range(K+1):
tmp = S-z
if tmp <= 2*K:
for y in range(K+1):
ttmp = tmp-y
if 0 <= ttmp <= K:
ans += 1
print(ans) |
p03835 | s926925002 | Accepted | K,S=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 | s898483422 | Accepted | import itertools
K,S = map(int,input().split())
cnt = 0
for i in itertools.product(range(K+1),repeat = 2):
if 0 <= S - i[0] - i[1] <= K:
cnt += 1
print(cnt) |
p03835 | s503167544 | Accepted | K, S = 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 | s224452832 | Accepted | K,S = 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 | s231001348 | Accepted | k, s = 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
else:
print(ans) |
p03835 | s953693953 | Accepted | K, S = 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 and z<=K):
if(x == y and y == z):
ans += 1
elif(x != y and y != z and z != x):
ans += 1
else:
ans += 1
print(ans) |
p03835 | s073688714 | Accepted | k,s=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 | s583015827 | Accepted | K,S = 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 | s729845489 | Accepted | k, s = map(int, input().split())
ans = 0
for x in range(min(k, s) + 1):
for y in range(min(k, s-x) + 1):
z = s - x - y
if z < 0 or z > k:
continue
ans += 1
print(ans) |
p03835 | s461532993 | Accepted | # coding = SJIS
k, s = 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 | s229096020 | Accepted | k,s=map(int,input().split())
cnt=0
for i in range(k,-1, -1):
for j in range(k, -1, -1):
l=s-i-j
if 0<=l<=k:
cnt+=1
print(cnt) |
p03835 | s390578818 | Accepted | K,S=map(int,input().split())
res=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:
res+=1
print(res)
|
p03835 | s217863369 | Accepted |
K, S = 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 | s273922923 | Accepted | K, S = tmp = 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 | s886465704 | Accepted | def main():
K,S = map(int,input().split())
ans = 0
ListK = [i for i in range(K+1)]
for x in ListK:
for y in ListK:
if 0 <= S - (x + y) <= K:
ans += 1
print(ans)
if __name__ == '__main__':
main() |
p03835 | s830215146 | Accepted | import sys
def input():
return sys.stdin.readline()[:-1]
def mi():
return map(int, input().split())
def ii():
return int(input())
def main():
K, S = mi()
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)
if __name__ == '__main__':
main()
|
p03835 | s801606234 | Accepted | k, s = map(int, input().split())
ans = []
for x in range(k+1):
for y in range(k+1):
z = s-(x+y)
if 0 <= z <= k:
ans.append(0)
print(len(ans)) |
p03835 | s260137957 | Accepted | k, s = map(int, input().split())
#.
ans = 0
#.
for x in range(k+1):
for y in range(k+1):
#.
des_v = s - x - y
#.
if des_v >= 0 and des_v <= k:
ans += 1
print(ans) |
p03835 | s937930534 | Accepted | k,s = [int(x) for x in 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 | s068613296 | Accepted | k, s = 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 | s910907399 | Accepted | K,S = map(int, input().split())
ans = 0
for z in range(K+1):
ans += max(0, min(2*K-S+z+1, S-z+1))
print(ans) |
p03835 | s428195948 | Accepted | k, s = 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 | s369839845 | Accepted | K, S = 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 += 1
print(cnt)
|
p03835 | s618399900 | Accepted | k,s=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 | s639852182 | Accepted | # Python3 (3.4.3)
import sys
input = sys.stdin.readline
# -------------------------------------------------------------
# function
# -------------------------------------------------------------
# -------------------------------------------------------------
# main
# -------------------------------------------------------------
K,S = 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 | s306437530 | Accepted | K,S = map(int,input().split())
ans = 0
for x in range(K+1):
for y in range(K+1):
N = S - (x+y)
if 0<= N <= K:
ans +=1
print(ans) |
p03835 | s493487498 | Accepted | from math import factorial
import sys
def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()
k, s = LI()
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)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.