input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
K, S = list(map(int,input().split()))
count = 0
for x,y,z in [(x,y,z) 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,y in [(x,y) 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 |
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 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()))
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):
z = S - x - y
if z >= 0 and z <= K:
cnt += 1
print(cnt)
| 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 0 <= k <= 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(k+1):
if 0<=s-(i+j)<=k:
cnt+=1
print(cnt) | # coding: utf-8
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 |
# -*- coding: utf-8 -*-
# problem B
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 and z <=k:
ans = ans+1
print(ans) | #!/usr/bin/env python
def main():
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 and z <= k:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| 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 0 <= z <= K:
ans += 1
print(ans) | """
Y+Z=S−X が成り立つことは分かるものの1通りには決まりません。
満たすべき条件は 0≤Y,Z≤K と Y+Z=S−X なので、変数 Z を消去すると以下の不等式が得られます。
0≤Y≤K
0≤Z=S−Y−X≤K
変形して、Y≤S−X かつ S−X−K≤Y
つまり Y の下限は Ymin=max(0,S−X−K) 、
上限は Ymax=min(K,S−X) となります。
"""
K, S = list(map(int, input().split()))
ans = 0
for x in range(K+1):
mn = max(0, S-x-K)
mx = min(K, S-x)
ans += max(0, mx-mn+1)
print(ans)
| p03835 |
K, S = list(map(int, input().split()))
kotae = 0
for i in range(K + 1):
for j in range(K + 1):
for k in range(K + 1):
if i + j + k == S:
kotae += 1
print(kotae) | K, S = list(map(int, input().split()))
kotae = 0
for Z in range(K + 1):
X_plus_Y = S - Z
for Y in range(K + 1):
X = X_plus_Y - Y
if 0 <= X <= K:
kotae += 1
print(kotae) | p03835 |
count = 0
K, S = list(map(int, input().split()))
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) | count = 0
K, S = list(map(int, input().split()))
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()))
f = 0
for i in range(k+1):
for j in range(k+1):
for l in range(k+1):
if i+j+l==s:
f+=1
print(f) | k,s = list(map(int,input().split()))
f = 0
for i in range(k+1):
for j in range(k+1):
l = s-i-j
if 0 <= l <=k:
f+=1
print(f) | 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 s-x-y <= k and s-x-y>=0:
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:
cnt += 1
print(cnt)
| p03835 |
# 0 ≦ X, Y, Z ≦ K
# X + Y + Z = S
# 2 ≦ K ≦ 2500
# 0 ≦ S ≦ 3K
K, S = list(map(int, input().split()))
cnt = 0
# X
for i in range(K + 1):
if i > S:
break
# Y
for j in range(K + 1):
if i + j > S:
break
# Z
for k in range(K + 1):
if i + j + k > S:
break
if i + j + k == S:
cnt += 1
print(cnt)
| # 0 ≦ X, Y, Z ≦ K
# X + Y + Z = S
# 2 ≦ K ≦ 2500
# 0 ≦ S ≦ 3K
K, S = list(map(int, input().split()))
cnt = 0
# X
for i in range(K + 1):
# Y
for j in range(K + 1):
Z = S - i - j
if 0 <= Z and Z <= K:
cnt += 1
print(cnt)
| p03835 |
# -*- coding: utf-8 -*-
K, S = list(map(int, input().split()))
# 絶対TLE…
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) | # -*- coding: utf-8 -*-
K, S = list(map(int, input().split()))
ans = 0
for x in range(K+1):
for y in range(K+1):
# zは全部回さないで、Sを満たすようなものだけ用意する
z = S - x - y
# 候補となるzがKの範囲内であれば有効
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(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()))
ans = 0
for i in range(k + 1):
for j in range(k + 1):
for h 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):
z = s - i - j
if 0 <= z <= k:
ans += 1
print(ans)
| p03835 |
K,S = list(map(int, input().split()))
ans = 0
for x in range(K+1):
max_y = S - x if S - x < K else K
for y in range(max_y + 1):
max_z = S - x - y if S - x -y < K else K
for z in range(max_z + 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):
z = S - x - y
if 0 <= z and z <= K:
ans += 1
print(ans)
| p03835 |
k,s = list(map(int,input().split()))
count = 0
num = list(range(k+1))
for x in num:
for y in num:
if x + y > s:
break
for z in num:
if x + y + z == s:
count += 1
elif x + y + z > s:
break
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:
break
a = s - x - y
if a >= 0 and a <= 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 h in range(k+1):
if(i+j+h==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()))
cnt = 0
for i in range(k+1):
if i > s:
continue
for j in range(k+1):
if i + j > s:
continue
for l in range(k+1):
if i + j + l == s:
cnt += 1
print(cnt) | k, s = list(map(int, input().split()))
cnt = 0
for i in range(k+1):
if i > s:
continue
for j in range(k+1):
if i + j > s or i + j + k < s:
continue
cnt += 1
print(cnt) | p03835 |
K,S = list(map(int, input().split()))
ret = 0
for A in range(S+1):
if A > K: continue
for B in range(S+1-A):
if B > K:continue
# print(A,B,S-A-B)
if S-A-B <= K:
# print(A,B,S-A-B)
ret += 1
print(ret) | K,S = list(map(int, input().split()))
# debug
# print([(A,B,S-A-B) for A in range(K+1) for B in range(K+1) if 0 <= S-A-B <= K])
print((sum(1 for A in range(K+1) for B in range(K+1) if 0 <= S-A-B <= K))) | p03835 |
from collections import defaultdict
def main():
K, S = list(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)
if __name__ == '__main__':
main()
| from collections import defaultdict
def main():
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)
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 sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()
k,s = na()
ans = 0
for x in range(k+1):
for y in range(k+1):
z = s - (x+y)
if x+y+z == s and z >= 0 and z <= k:
ans += 1
print(ans)
| import sys
stdin = sys.stdin
na = lambda: list(map(int, stdin.readline().split()))
k,s = na()
ans = 0
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)
| p03835 |
k,s = list(map(int,input().split()))
count = 0
for i in range(k + 1):
for j in range(k + 1):
for t in range(k + 1):
if i + j + t == 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 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):
if 0 <= s-x-y <= k:
count += 1
print(count) | p03835 |
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) | 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 |
def resolve():
K, S = list(map(int, input().split()))
ans = 0
for i in range(K+1):
for j in range(K+1):
for p in range(K+1):
if i+j+p == S:
ans += 1
print(ans)
resolve() | def resolve():
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)
resolve() | p03835 |
K, S = list(map(int, input().split()))
import itertools
count = 0
for pattern in list(itertools.product(list(range(K+1)), repeat=2)):
#print(pattern)
if S-K <= sum(pattern) <= S:
count += 1
print(count) | K, S = list(map(int, input().split()))
import itertools
count = 0
for pattern in itertools.product(list(range(K+1)), repeat=2):
#print(pattern)
if S-K <= sum(pattern) <= S:
count += 1
print(count)
| p03835 |
K, S = list(map(int, input().split()))
import itertools
count = 0
for pattern in itertools.product(list(range(K+1)), repeat=2):
#print(pattern)
if S-K <= sum(pattern) <= S:
count += 1
print(count)
| 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 |
k,s = list(map(int,input().split()))
n = 0
m = k+1
for x in range(m):
for y in range(m):
z = s-(x+y)
if z <= k and z >= 0 and x+y+z==s:
n += 1
print(n)
| k,s = list(map(int,input().split()))
n = 0
for x in range(k+1):
for y in range(k+1):
z = s-(x+y)
if z <= k and z >= 0 and x+y+z==s:
n += 1
print(n)
| 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):
z=s-x-y
if x+y<=s and z<=k:
cnt+=1
print(cnt)
| p03835 |
k , s = list(map(int,input().split()))
a = 0
for i in range(k+1):
for j in range(k+1):
for h in range(k+1):
if (i + j + h ) == s:
a += 1
print(a)
| 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 and z <= 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 s == x+y+z:
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 (s-x-y) >= 0 and (s-x-y) <= k:
ans += 1
print(ans)
| p03835 |
import itertools
k, s = list(map(int, input().split()))
a = list(itertools.combinations_with_replacement(list(range(0, k+1)), 3))
ans = 0
for i in a:
if sum(i) == s:
if i[0] == i[1] == i[2]:
ans += 1
elif i[0] != i[1] != i[2] != i[0]:
ans += 6
else:
ans += 3
print(ans) | 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) | p03835 |
k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
if x > s:
break
if x+k+k < s:
continue
for y in range(k+1):
xy = x+y
if xy > s:
break
if xy+k < s:
continue
for z in range(k+1):
xyz = x+y+z
if xyz > s:
break
if xyz == 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 += max(0, 0<=s-x-y<=k)
print(ans) | p03835 |
k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
if x > s:
break
if x+k+k < s:
continue
for y in range(k+1):
ans += max(0, 0<=s-x-y<=k)
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 itertools
K,S = list(map(int, input().split()))
X = list(range(K+1))
count=0
for x,y in list(itertools.product(X, X)):
if x+y <= S and x+y+K>=S:
count+=1
print(count) | 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()))
a=0
for x in range(k+1):
for y in range (x+1):
for z in range (y+1):
if x + y + z == s and x!=y and y!=z and z!=x:
a+=6
elif x+y+z==s and x==y and x!=z:
a+=3
elif x+y+z==s and y==z and x!=y:
a+=3
elif x+y+z==s and x==z and x!=y:
a+=3
elif x+y+z==s and x==y and y==z:
a+=1
break
print(a)
| k,s = list(map(int,input().split()))
a=0
for x in range(k+1):
for y in range(k+1):
if 0<=s-x-y<=k:
a+=1
print(a)
| p03835 |
import itertools
max_range, sum_ = list(map(int, input().split()))
count = 0
for x, y, z in itertools.combinations_with_replacement(list(range(max_range + 1)), r=3):
if x + y + z == sum_:
len_set = len({x, y, z})
if len_set == 1:
count += 1
elif len_set == 2:
count += 3
else:
count += 6
print(count)
| max_range, sum_ = list(map(int, input().split()))
count = 0
for x in range(0, min(max_range + 1, sum_ + 1)):
for y in range(0, min(max_range + 1, sum_ - x + 1)):
if sum_ - x - y <= max_range:
count += 1
print(count)
| p03835 |
K,S = list(map(int,input().split()))
count = 0
for i in range(K+1):
if i == S:
count += 1
break
for j in range(K+1):
if i + j == S:
count += 1
break
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 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()))
cnt = 0
for i in range(K+1):
flg = False
for j in range(K+1):
if flg == True:
break
for k in range(K+1):
ijk_sum = i + j + k
if ijk_sum == S:
flg = True
lim_tmp = min(K - j, k)
cnt += lim_tmp + 1
break
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 k >= 0 and k <= K:
cnt += 1
print(cnt) | p03835 |
# -*- coding: utf-8 -*-
def main():
c = 0
k, s = list(map(int, input().split()))
#k, s = map(int, "2 2".split())
for x in range(k + 1):
for y in range(k + 1):
for z in range(k + 1):
if s == x + y + z:
c += 1
print(c)
return
if __name__ == '__main__':
main()
| K, S = list(map(int, input().split()))
c = 0
for X in range(K + 1):
for Y in range(K + 1):
if S - K <= X + Y <= S:
c += 1
print(c) | 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 |
from sys import stdin
def main():
K, S = [int(x) for x in stdin.readline().rstrip().split()]
result = 0
for X in range(S + 1):
for Y in range(S + 1):
Z = S - (X + Y)
if Z < 0:
break
if X <= K and Y <= K and Z <= K:
result += 1
print(result)
if __name__ == "__main__":
main()
| from sys import stdin
def main():
K, S = [int(x) for x in stdin.readline().rstrip().split()]
result = 0
for X in range(S + 1):
if K < X:
break
for Y in range(S + 1):
if K < Y:
break
Z = S - (X + Y)
if Z < 0:
break
if X <= K and Y <= K and Z <= K:
result += 1
print(result)
if __name__ == "__main__":
main()
| p03835 |
from sys import stdin
def main():
K, S = [int(x) for x in stdin.readline().rstrip().split()]
result = 0
for X in range(S + 1):
if K < X:
break
for Y in range(S + 1):
if K < Y:
break
Z = S - (X + Y)
if Z < 0:
break
if X <= K and Y <= K and Z <= K:
result += 1
print(result)
if __name__ == "__main__":
main()
| from sys import stdin
def main():
K, S = [int(x) for x in stdin.readline().rstrip().split()]
result = 0
for X in range(K + 1):
for Y in range(K + 1):
Z = S - (X + Y)
if Z < 0:
break
if X <= K and Y <= K and Z <= K:
result += 1
print(result)
if __name__ == "__main__":
main()
| p03835 |
import sys
K,S = list(map(int,input().split()))
#0<=S<=3K
res = 0
for X in range(0,K+1):
if X > S:
break
print(res)
sys.exit(0)
for Y in range(0,K+1):
if X + Y > S:
break
elif (0<=(S-X-Y)) and ((S-X-Y) <= K):
res += 1
print(res)
| K,S = list(map(int,input().split()))
print((sum([0<=S-X-Y<=K for X in range(0,K+1) for Y in range(0,K+1)]))) | 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 |
K, S = list(map(int,input().split()))
ans = 0
for k in range(K+1):
for j in range(S-k+1):
if j <= K and 0 <= S-k-j <= 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):
if 0 <= S-(X+Y) <= K:
ans += 1
print(ans)
| p03835 |
K, S = (int(x) for x in input().split())
sum = 0
for x in range(K + 1):
for y in range(K + 1):
for z in range(K + 1):
if (x + y + z == S):
sum += 1
print(sum) | K, S = (int(x) for x in input().split())
sum = 0
for x in range(K + 1):
for y in range(K + 1):
if ((S - x - y) >= 0 and (S - x - y) <= K):
sum += 1
print(sum) | p03835 |
import itertools
K,S=list(map(int,input().split()))
l=list( itertools.product(list(range(K+1)), repeat=3 ) )
cnt=0
for i,j,k in l:
if i+j+k==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):
z=S-x-y
if z>=0 and z<=K:
cnt+=1
print(cnt)
| p03835 |
(k,s),c=list(map(int,input().split())),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),c=list(map(int,input().split())),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()))
ans = 0
for x in range(0,K+1):
for y in range(0,K+1):
if x + y > S:
break
for z in range(0,K+1):
if x + y + z == S:
ans += 1
if x + y + z > S:
break
print(ans)
| 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 <= K:
ans += 1
print(ans)
| p03835 |
K, S = list(map(int,input().split()))
yz = []
for y in range(K+1):
for z in range(y,K+1):
if y == z:
yz.append([y+z,1])
else:
yz.append([y+z,2])
cnt = 0
for x in range(K+1):
for i in range(len(yz)):
if x + yz[i][0] == S and yz[i][1] == 1:
cnt += 1
elif x + yz[i][0] == S and yz[i][1] == 2:
cnt += 2
print(cnt) | K, S = list(map(int,input().split()))
cnt=0
for y in range(K+1):
for z in range(y,K+1):
if y == z and 0 <= S-y-z <=K:
cnt+=1
elif 0 <= S-y-z <=K:
cnt += 2
print(cnt) | p03835 |
k,s = list(map(int,input().split()))
a = 0
for x in range(k+1):
for y in range(k+1):
z = s - x - y
if x + y + z == s and 0 <= z <= k:
a += 1
print(a) | k,s = list(map(int,input().split()))
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((sum(0<=S-x-y<=K for x in range(K+1)for y in range(K+1)))) | K, S = list(map(int, input().split()))
ans = 0
for x in range(K + 1):
remainder = S - x
if remainder < 0:
break
elif remainder > K * 2:
continue
else:
ans += remainder + 1 - 2 * max(remainder - K, 0)
print(ans) | p03835 |
K, S = [int(i) for i in input().split()]
c = 0
for X in range(K + 1):
for Y in range(K + 1):
Z = S - X - Y
if 0 <= Z <= K:
c += 1
print(c) | K, S = [int(i) for i in input().split()]
ans = 0
# X <= Y <= Zとしても一般性を失わない
for x in range(K + 1):
for y in range(x, K + 1):
z = S - x - y
if z < y:
break
if z <= K:
if x == y == z:
ans += 1
elif x == y or y == z or z == x:
ans += 3
else:
ans += 6
print(ans)
| p03835 |
n,s=list(map(int,input().split()))
ans=0
for i in range(n+1):
for j in range(n+1):
for k in range(n+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):
z=s-i-j
if 0<=z<=k:
ans+=1
print(ans) | p03835 |
K, S = list(map(int, input().split()))
cnt = 0
for x in range(S + 1) :
for y in range(S - x + 1) :
z = S - x - y
if x <= K and y <= K and z <= K :
cnt += 1
print(cnt) | K, S = list(map(int, input().split()))
cnt = 0
for x in range(S + 1) :
if x > K :
continue
for y in range(S - x + 1) :
if y > K :
continue
z = S - x - y
if z > K:
continue
cnt += 1
print(cnt) | p03835 |
k,s = list(map(int,input().split()))
cnt,x = 0,0
total = (k+1)**2
if (k*2) >= s:
x = 0
else:
x = s-(k*2)
while(x<=k):
res = s-x
for i in range(k+1):
for j in range(k+1):
if i+j == res:
#print(i,j)
cnt += 1
x += 1
print(cnt) | k,s = list(map(int,input().split()))
cnt,x = 0,0
for y in range(k+1):
for z in range(k+1):
x = s-y-z
if 0 <= x <= k:
cnt += 1
print(cnt) | p03835 |
line = input().split(" ")
k = int(line[0])
s = int(line[1])
count = 0
for i in range(k+1):
for j in range(k+1):
for l in range(k+1):
if s == i + j + l:
count += 1
print(count) | line = input().split(" ")
k = int(line[0])
s = int(line[1])
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(k+1):
for j in range(k+1):
for k in range(k+1):
result = i + j + k
if result == 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):
result = s - i - j
if 0 <= result <= 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()))
res = 0
for x in range(0, k + 1):
for y in range(0, k + 1):
z = s - x - y
if 0 <= z <= k:
res += 1
print(res) | p03835 |
k,s=list(map(int,input().split()))
temp=[x+y+z for z in range(k+1) for y in range(k+1) for x in range(k+1)].count(s)
print(temp)
| k,s=list(map(int,input().split()))
temp=[1 for y in range(k+1) for x in range(k+1) if 0<=s-x-y<=k]
print((len(temp)))
| 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 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):
sumz=S-x-y
if sumz>=0 and sumz<=K:
count+=1
print(count)
| p03835 |
K,S=list(map(int, input().split()))
cnt=0
for i in range(K+1):
X=i
for j in range(K+1):
Y=j
if S-(X+Y)in range(K+1):
cnt+=1
print(cnt) | K,S=list(map(int, input().split()))
cnt=0
if K <= S:
for i in range(K+1):
for j in range(K+1):
if S - (i+j) <= K and S >= i+j:
cnt += 1
else:
for i in range(S+1):
for j in range(S+1):
if S - (i+j) <= K and S >= i+j:
cnt += 1
print(cnt) | p03835 |
K,A = list(map(int,input().split()))
ans = 0
for a in range(K+1):
for b in range(K+1):
for c in range(K+1):
if a+b+c == A:
ans += 1
print(ans) | K,A = list(map(int,input().split()))
ans = 0
for a in range(K+1):
for b in range(K+1):
c = A-(a+b)
if 0 <= c <= K:
ans += 1
print(ans) | p03835 |
K, S = [int(i) for i in input().split()]
cnt = 0
x_flg = bool()
out = int()
for x in range(0,K+1):
for y in range(0,K+1):
if 0 <= S - x < K:
cnt += S - x + 1
break
z = S - (x + y)
if K >= x and K >= y and K >= z and z >= 0:
cnt += 1
elif z < 0:
break
print(cnt) | K, S = [int(i) for i in input().split()]
cnt = 0
for x in range(0,K+1):
if 0 <= S - x <= K:
cnt += S - x + 1
elif 0 <= S - x <= 2*K:
cnt += 2*K - S + x + 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 x in range(K+1):
for y in range(K+1):
z = S - y - x
if 0 <= z <= K:
ans += 1
print(ans)
| p03835 |
k,s=list(map(int,input().split()))
cnt=0
for i in range(k+1):
if i>s:
continue
for j in range(k+1):
if i+j>s:
continue
for l in range(k+1):
if i+j+l==s:
cnt+=1
print(cnt) | k,s=list(map(int,input().split()))
cnt=0
for i in range(k+1):
if i>s:
continue
for j in range(k+1):
if i+j>s:
continue
l=s-i-j
if 0<=l<=k:
cnt+=1
print(cnt) | p03835 |
k, s = list(map(int, input().rstrip("\n").split()))
count = 0
for x in range(k + 1):
for y in range(k + 1):
if x + y > s:
x = k + 1
y = k + 1
continue
count += (s <= x + y + k)
print(count) | k, s = list(map(int, input().split()))
print((sum(0 <= s - (x + y) <= k for y in range(k + 1) for x in range(k + 1))))
| p03835 |
k, s = list(map(int, input().split()))
print((sum(0 <= s - (x + y) <= k for y in range(k + 1) for x in range(k + 1))))
| [print(sum(0 <= s - (x + y) <= k for y in range(k + 1) for x in range(k + 1))) for k, s in [map(int, input().split())]]
| p03835 |
k, s = list(map(int, input().split()))
count = 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:
count +=1
elif x == y or y==z:
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(k+1):
if -1<s-x-y<k+1:
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 0<=z 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()))
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) | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
K,S = list(map(int, readline().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 |
from sys import stdin
K, S = [int(x) for x in stdin.readline().rstrip().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) | from sys import stdin
K, S = [int(x) for x in stdin.readline().rstrip().split()]
count = 0
for x in range(K+1):
for y in range(K+1):
if (x + y >= S - K) and (x + y <= S):
count += 1
print(count) | p03835 |
K, S = list(map(int, input().split()))
count = 0
for i in range(K+1):
for l in range(K+1):
for m in range(K+1):
if i + l + m == S:
count = count + 1
print(count) | K, S = list(map(int, input().split()))
count = 0
for i in range(K+1):
for l in range(K+1):
if S - i - l <= K and S - i - l >=0:
count = 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 S==x+y+z and 0<=z 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(K+1):
z=S-x-y
if 0<=z and z<=K:
cnt+=1
print(cnt) | p03835 |
k,s=list(map(int,input().split()))
o=0
for i in range(k+1):
for u in range(k+1):
for y in range(k+1):
if (i+u+y)==s:
o+=1
print(o) | k,s=list(map(int,input().split()))
o=0
for i in range(k+1):
for u in range(k+1):
if 0<=(s-i-u)<=k:
o+=1
print(o) | 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
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()))
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):
z = S-(x+y)
if 0 <= z <= K:
ans+=1
print(ans) | p03835 |
k,s = list(map(int, input().rstrip().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().rstrip().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()))
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):
z = s - x - y
if 0 <= z and z <= k:
ans += 1
print(ans)
| p03835 |
import math
from math import gcd,pi,sqrt
INF = float("inf")
import sys
sys.setrecursionlimit(10**6)
import itertools
from collections import Counter,deque
def i_input(): return int(eval(input()))
def i_map(): return list(map(int, input().split()))
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return eval(input())
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def main():
k,s = i_map()
ans = 0
l = list(itertools.combinations_with_replacement(list(range(k+1)),3))
for i in l:
x = i[0]
y = i[1]
z = i[2]
if x+y+z == s:
if len(set(i)) == 1:
ans += 1
elif len(set(i)) == 2:
ans += 3
else:
ans += 6
print(ans)
if __name__=="__main__":
main()
| import math
from math import gcd,pi,sqrt
INF = float("inf")
import sys
sys.setrecursionlimit(10**6)
import itertools
from collections import Counter,deque
def i_input(): return int(eval(input()))
def i_map(): return list(map(int, input().split()))
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return eval(input())
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def main():
k,s = i_map()
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)
if __name__=="__main__":
main()
| p03835 |
k,s= list(map(int,input().split()))
count = 0
arr = []
for i in range(0,k+1):
arr.append(i)
def binary_search(arr,i):
x = arr
low = 0
high = len(x)-1
t = (low + high) // 2
# 探索の下限のlowが上限のhighになるまで探索
# lowがhighに達すると数は見つからなかったということ
while (low<=high):
if (i==x[t]):
break
elif (i > x[t]):
low = t + 1
elif (i < x[t]):
high = t - 1
t = (low + high) // 2
if (i==x[t]):
return t
else:
return -1
for i in range(0,k+1):
for j in range(0,k+1):
l = s - i - j
answer = binary_search(arr,l)
# print(i,j,l)
if(answer!=-1):
# print('clear',i,j,l)
count += 1
print(count)
| k,s= list(map(int,input().split()))
count = 0
# arr = []
# for i in range(0,k+1):
# arr.append(i)
# def binary_search(arr,i):
# x = arr
# low = 0
# high = len(x)-1
# t = (low + high) // 2
# # 探索の下限のlowが上限のhighになるまで探索
# # lowがhighに達すると数は見つからなかったということ
# while (low<=high):
# if (i==x[t]):
# break
# elif (i > x[t]):
# low = t + 1
# elif (i < x[t]):
# high = t - 1
# t = (low + high) // 2
# if (i==x[t]):
# return t
# else:
# return -1
# for i in range(0,k+1):
# l = s - i - j
# arr = arr[]
# answer = binary_search(arr,l)
# # print(i,j,l)
# if(answer!=-1):
# # print('clear',i,j,l)
# count += 1
for i in range(0,k+1):
for j in range(i,k+1):
l = s-i-j
if l>=j and l <= k:
if i!=j and j != l and i!=l:
# print(i,j,l)
count += 6
elif i == j and j == l and i == l:
# print(i,j,l)
count += 1
else:
# print(i,j,l)
count += 3
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()))
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):
test = s-x-y
if 0 <= test and test <= k:
ans += 1
print(ans) | 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
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 <= 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 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:
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,n = list(map(int,input().split()))
ans = 0
for i in range(k+1):
for j in range(k+1):
if 0 <= n-i-j <= k:
ans+=1
print(ans)
| p03835 |
k, s = list(map(int, input().split()))
k = k+1
count = 0
for x in range(k):
for y in range(k):
for z in range(k):
if s == x + y + z:
count += 1
print(count) | k, s = list(map(int, input().split()))
k = k+1
count = 0
for x in range(k):
for y in range(k):
z = s - x - y
if z >=0 and 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):
for m in range(k+1):
if i+j+m == 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()))
ans = 0
for i in range(k + 1):
for j in range(i + 1):
for l in range(j + 1):
if i + j + l == s:
if i == j == l:
ans += 1
elif i == j or j == l or l == i:
ans += 3
else:
ans += 6
print(ans)
| k, s = list(map(int, input().split()))
ans = 0
for i in range(k + 1):
for j in range(i + 1):
l = s - (i + j)
if 0 <= l <= k and l <= j <= i:
if i == j == l:
ans += 1
elif i == j or j == l or l == i:
ans += 3
else:
ans += 6
print(ans)
| p03835 |
K, S = list(map(int, input().split()))
re = 0
for x in range(K+1):
for y in range(K+1):
z = min(K, max(0, S-x-y))
if x + y + z == S:
re += 1
print(re) | K, S = list(map(int, input().split()))
re = 0
for x in range(min(S+1, K+1)):
for y in range(min(S+1-x, K+1)):
if S - x - y <= K:
re += 1
print(re) | 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):
z = S - i - j
if 0 <= z <= K:
cnt += 1
print(cnt) | 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(x, K+1):
for z in range(y, K+1):
if x + y + z == S:
if x == y and y == z:
count += 1
elif x == y or y == z or z == x:
count += 3
else:
count += 6
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 <= K and z >= 0:
count += 1
print(count)
| p03835 |
k, s = [int(i) for i in input().split()]
ans = 0
for x in range(k, -1, -1):
for y in range(k, -1, -1):
for z in range(k, -1, -1):
if x + y + z is s:
ans += 1
print(ans)
| k, s = [int(i) for i in input().split()]
ans = 0
for x in range(k, -1, -1):
for y in range(k, -1, -1):
if 0 <= s - x - y <= k:
ans += 1
print(ans)
| p03835 |
k, s = list(map(int,input().split()))
ans = 0
x = 0
y = 0
z = 0
for i in range(k+1):
y = 0
for n in range(k+1):
z = 0
for m in range(k+1):
if x + y + z == s:
ans += 1
z += 1
y += 1
x += 1
print(ans) | k, s = list(map(int,input().split()))
x = 0
y = 0
z = 0
ans = 0
for i in range(k+1):
for n in range(k+1):
z = s - (i + n)
if 0 <= z and z <= k:
ans += 1
print(ans) | p03835 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.