input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
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 and y != z and z != x:
count += 6
else:
count += 3
print(count) | k, s = list(map(int, input().split()))
count = 0
for x in range(k+1):
for y in range(k+1):
if s-k <= x + y <= s:
count += 1
print(count) | p03835 |
K, S = list(map(int, input().split()))
counter = 0
for x in range(K + 1):
for y in range(K + 1):
if S - (x + y) <= K:
z = S - (x + y)
if z >= 0 and z <= K:
counter += 1
print(counter) | K, S = list(map(int, input().split()))
counter = 0
for x in range(K + 1):
for y in range(K + 1):
z = S - (x + y)
if z >= 0 and z <= K:
counter += 1
print(counter) | p03835 |
K, S = list(map(int, input().split()))
ans = 0
for x in range(K + 1):
for y in range(K + 1):
for z in range(K + 1):
if x + y + z == S:
ans += 1
print(ans)
| K, S = list(map(int, input().split()))
ans = 0
for x in range(K + 1):
for y in range(K + 1):
if 0 <= S - x - y <= K:
ans += 1
print(ans)
| p03835 |
k,s=list(map(int,input().split()))
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()))
ans=0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x+y+z==s:
ans+=1
print(ans) | k,s=list(map(int,input().split()))
ans=0
for x in range(k+1):
for y in range(k+1):
if 0<=s-x-y<=k:
ans+=1
print(ans) | p03835 |
K, S = list(map(int, input().split()))
ans = 0
for 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 |
K, S = list(map(int,input().split()))
ans = 0
for x in range(K+1):
for y in range(K+1):
if S - x - y >= 0 and S - x - y <= K:
ans += 1
print(ans) | K, S = list(map(int,input().split()))
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 |
import itertools
k,s = list(map(int,input().split()))
ans = 0
x = [i for i in range(k + 1)]
y = [i for i in range(k + 1)]
z = [i for i in range(k + 1)]
arr = list(itertools.product(x,y,z))
for i in arr:
if sum(i) == 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):
for k in range(k + 1):
if i + j + k == s:
ans += 1
print(ans) | p03835 |
k,s=(int(x) for x in input().split())
ans=0
for i in range(k+1):
for ii in range(k+1):
for iii in range(k+1):
if i+ii+iii==s:
ans+=1
print(ans) | k,s=(int(x) for x in input().split())
ans=0
for i in range(k+1):
for ii in range(k+1):
if 0<=s-i-ii<=k:
ans+=1
print(ans) | p03835 |
k, s = list(map(int, 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:
break
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().split(' ')))
r = 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:
r += 1
print(r) | k, s = list(map(int, input().split(' ')))
r = 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:
r += 1
print(r) | p03835 |
K, S = list(map(int,input().split()))
import itertools
ar = itertools.product(list(range(K+1)), repeat=3)
ans = 0
for a,b,c in ar:
if a+b+c == S: ans += 1
print(ans) | K, S = list(map(int,input().split()))
import itertools
ar = itertools.product(list(range(K+1)), repeat=2)
ans = 0
for a,b in ar:
if S - a-b <= K and a+b <= S: 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):
count+=S==X+Y+Z
print(count)
| K,S=list(map(int,input().split()))
count=0
for X in range(K+1):
for Y in range(K+1):
count+=X+Y<=S<=X+Y+K
print(count)
| p03835 |
K, S = list(map(int, input().split()))
l = [i for i in range(K+1)]
cnt = 0
for i in l:
if i > S:
break
elif i == S:
cnt += 1
break
elif i < S:
for j in l:
if i+j > S:
break
elif i+j == S:
cnt += 1
break
elif i+j < S:
if K >= S-i-j:
cnt += 1
print(cnt) | K, S = list(map(int, input().split()))
l = [i for i in range(K+1)]
cnt = 0
for i in l:
if i > S:
break
elif i == S:
cnt += 1
break
elif i < S:
tmp1 = S-i
if K-tmp1 >= 0:
cnt += tmp1 + 1
else:
tmp2 = 2*K + 1 - tmp1
if tmp2 > 0:
cnt += tmp2
print(cnt) | p03835 |
n, s = list(map(int, input().split()))
ans = 0
for x in range(n+1):
for y in range(n+1):
for z in range(n+1):
if x + y + z == s:
ans += 1
print(ans) | n, s = list(map(int, input().split()))
ans = 0
for x in range(n+1):
for y in range(n+1):
if 0 <= s - x - y <= n:
ans += 1
print(ans) | p03835 |
def main():
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)
main() | 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)
main() | p03835 |
K,S= input().split()
intK = int(K)
intS = int(S)
sum = 0
for X in range(intK+1):
for Y in range(intK+1):
Z = intS - (X+Y)
if (Z < 0) or Z > intK:
continue
if Z >= 0 and (X+Y+Z) == intS:
sum += 1
print(sum) | K,S= input().split()
intK = int(K)
intS = int(S)
sum = 0
for X in range(intK+1):
for Y in range(intK+1):
Z = intS - (X+Y)
if (Z < 0) or Z > intK:
continue
sum += 1
print(sum) | p03835 |
k,s=list(map(int,input().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:
#print('1','x',x,'y',y,'z',z)
ans+=1
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()))
c=0
for x in range(s+1):
for y in range(s+1-x):
for z in range(s+1-x-y):
if x>k or y>k or z>k:
continue
if x+y+z==s:
c+=1
print(c) | k,s=list(map(int,input().split()))
c=0
m=min(s,k)
for x in range(m+1):
for y in range(m+1):
if s<x+y:
break
elif s>x+y+k:
continue
else:
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):
s = x + y + z
if s == S:
count = count + 1
print((str(count))) | K,S = list(map(int,input().split()))
count = 0
for x in range(K+1):
for y in range(K+1):
z = S - x - y
if z >=0 and z <= K:
count +=1
print(count) | p03835 |
K, S = list(map(int, input().split()))
c = 0
for x in range(K + 1):
if x > S:
continue
for y in range(S - x + 1):
if y > K:
break
z = S - x - y
if 0 <= z <= K:
c += 1
print(c) | K, S = list(map(int, input().split()))
c = 0
for x in range(K + 1):
if x > S:
break
for y in range(S - x + 1):
if y > K:
break
z = S - x - y
if 0 <= z <= K:
c += 1
print(c) | p03835 |
k, s = list(map(int, input().split()))
cnt = 0
ls = [z for z in range(k+1)]
for x in range(k+1):
for y in range(k+1):
if s - x - y in ls:
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()))
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()))
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()))
l=[]
for i in range(max(0,s-2*k),min(s,k)+1):#xはmax(0,s-2*k)からmin(s,k)までの値をとる
l.append(min(s-i,k)+1-max(0,s-(i+k)))
#for j in range(max(0,s-(i+k)),min(s-i,k)+1):
#print(l)
print((sum(l))) | k,s=list(map(int,input().split()))
#xはmax(0,s-2*k)からmin(s,k)までの値をとる min(s,k)+1-max(0,s-2*k)通り
#xを決めた時、yはmax(0,s-(x+k)からmin(s-x,k)までの値をとる min(s-x,k)+1-max(0,s-(x+k))通り
#x,yを決めた時、zは一意 1通り
l=[]
for i in range(max(0,s-2*k),min(s,k)+1):
l.append(min(s-i,k)+1-max(0,s-(i+k)))
print((sum(l))) | 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()))
count = 0
for x in range(K + 1):
for y in range(K + 1):
for z in range(K + 1):
total = x + y + z
if total == 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 and z <= K:
count += 1
print(count) | p03835 |
k,s = [int(i) for i in input().split()]
r=0
for i in range(0,k+1):
for j in range(0,k+1):
for l in range(0,k+1):
if s-(i+j)==l:
r+=1
print(r)
| k,s = [int(i) for i in input().split()]
r=0
for i in range(0,k+1):
for j in range(0,k+1):
if 0<=s-(i+j)<=k:
r+=1
print(r)
| p03835 |
K , S = list(map(int,input().split()))
k = 0
for i in range(K+1):
for j in range(min([S-i+1,K+1])):
for l in range(K+1):
if i + j + l == S:
k += 1
break
print(k) | K , S = list(map(int,input().split()))
k = 0
for i in range(K+1):
for j in range(min([S-i+1,K+1])):
if 0 <= S - i - j <= K:
k += 1
print(k) | p03835 |
# vim: set fileencoding=utf-8 :
k, s = list(map(int, input().split()))
patterns = []
for x in range(k + 1):
nokori = s - x
for y in range(k + 1):
if 0 <= nokori - y <= k:
patterns.append([x, y, nokori - y])
ct = len(patterns)
print(ct)
| # vim: set fileencoding=utf-8 :
k, s = list(map(int, input().split()))
patterns = []
ct = 0
for x in range(k + 1):
nokori = s - x
for y in range(k + 1):
if 0 <= nokori - y <= k:
ct += 1
print(ct)
| 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()))
d = {}
for x in range(k+1):
for y in range(k+1):
z = s - x - y
if(z >= 0 and z <= k):
key = (x,y,z)
d[key] = 1
print((len(d)))
| k,s = list(map(int,input().split()))
d = {}
cnt = 0
for x in range(k+1):
for y in range(x+1):
z = s - x - y
if(z >= 0 and z <= y):
if(x == y and y == z):
cnt += 1
elif(x == y or y == z or z == x):
cnt += 3
else:
cnt += 6
print(cnt)
| p03835 |
k,s = input().split(' ')
k,s = int(k),int(s)
count = 0
for i in range(k+1):
if i > s:
break
for j in range(k+1):
if i+j > s:
break
for l in range(k+1):
x = i+j+l
if s == x:
count += 1
print(count) | k,s = input().split(' ')
k,s = int(k),int(s)
count = 0
for i in range(k+1):
if i > s:
break
for j in range(k+1):
if i+j > s:
break
z = s - (i+j)
if z <= k and z >= 0:
count += 1
print(count) | p03835 |
k,s = input().split(' ')
k,s = int(k),int(s)
count = 0
for i in range(k+1):
if i > s:
break
for j in range(k+1):
if i+j > s:
break
z = s - (i+j)
if z <= k and z >= 0:
count += 1
print(count) | k,s = input().split(' ')
k,s = int(k),int(s)
count = 0
for i in range(k+1):
for j in range(k+1):
z = s - (i+j)
if z <= k and z >= 0:
count += 1
print(count) | p03835 |
k,s=list(map(int,input().split()))
print((sum(x+y+z==s for x in range(k+1) for y in range(k+1) for z in range(k+1)))) | k,s=list(map(int,input().split()))
print((sum(0<=s-y-z<=k for y in range(k+1) for z in range(k+1)))) | 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):
z = S- (x + y)
if z>=0 and z<=K:
res += 1
print(res) | 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=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=ans+1
print(ans) | p03835 |
from sys import stdin
lis =[]
#k = int(stdin.readline().rstrip())
lis= stdin.readline().rstrip().split()
k = int(lis[0])
s = int(lis[1])
count = 0
x = 0
y = 0
z = 0
for x in range(k+1):
y = 0
for y in range(k+1):
z = 0
z = s - x - y
if x <= k and y <= k and z <= k and z >= 0:
count +=1
print(count)
| from sys import stdin
lis =[]
#k = int(stdin.readline().rstrip())
lis= stdin.readline().rstrip().split()
k = int(lis[0])
s = int(lis[1])
count = 0
x = 0
y = 0
z = 0
for x in range(k+1):
y = 0
for y in range(k+1):
z = 0
z = s - x - y
if z <= k and z >= 0:
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 S == x+y+z:
count+=1
print(count) | K,S = list(map(int,input().split()))
count = 0
countb=0
for x in range(K+1):
for y in range(K+1):
countb+=1
if 0 <= S - (x+y) <= K:
count+=1
print(count) | p03835 |
k,s = list(map(int,input().split()))
cnt = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if(x+y+z)==s:
cnt += 1
elif(x+y+z)>s:
break
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 |
# 蟻本1-6-1例題相当
# 数学的に解けそうであるが、とりあえず3重のfor文で回してみる
# 最大で2500^3≒100億となる
# また、条件分岐による打ち切りもしない(x+y<s-kなら、zの値に関係なく不成立だが、それを考慮しない)
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) | # 蟻本1-6-1例題相当
# 続いて、x、yを確定した際、zは一意に決まるか値が存在しないかのいずれかであることに着目する。
# よって2重のfor文で回してみる
# 最大で2500^2≒600万となる
# また、条件分岐による打ち切りもしない(x+y<s-kなら、zの値に関係なく不成立だが、それを考慮しない)
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 and s-x-y <= k:
count += 1
print(count) | p03835 |
# 蟻本1-6-1例題相当
# 続いて、x、yを確定した際、zは一意に決まるか値が存在しないかのいずれかであることに着目する。
# よって2重のfor文で回してみる
# 最大で2500^2≒600万となる
# また、条件分岐による打ち切りもしない(x+y<s-kなら、zの値に関係なく不成立だが、それを考慮しない)
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 and s-x-y <= k:
count += 1
print(count) | # 蟻本1-6-1例題相当
# 今回も、x、yを確定した際、zは一意に決まるか値が存在しないかのいずれかであることに着目する。
# よって2重のfor文で回してみる
# 最大で2500^2≒600万となる
# 最後に、x,yの取りうる範囲を考慮する
k, s = list(map(int,input().split()))
xmin = (s - 2 * k) if (s - 2 * k) > 0 else 0
xmax = k if k < s else s
count = 0
for x in range(xmin, xmax+1):
ymin = (s - k - x) if (s - k - x) > 0 else 0
ymax = k if k < s - x else s - x
for y in range(ymin, ymax+1):
if 0 <= s-x-y and s-x-y <= k:
count += 1
print(count) | p03835 |
# 蟻本1-6-1例題相当
# 今回も、x、yを確定した際、zは一意に決まるか値が存在しないかのいずれかであることに着目する。
# よって2重のfor文で回してみる
# 最大で2500^2≒600万となる
# 最後に、x,yの取りうる範囲を考慮する
k, s = list(map(int,input().split()))
xmin = (s - 2 * k) if (s - 2 * k) > 0 else 0
xmax = k if k < s else s
count = 0
for x in range(xmin, xmax+1):
ymin = (s - k - x) if (s - k - x) > 0 else 0
ymax = k if k < s - x else s - x
for y in range(ymin, ymax+1):
if 0 <= s-x-y and s-x-y <= k:
count += 1
print(count) | # 蟻本1-6-1例題相当
# 今回は、xのみ確定した際、y,zの取りうる値の組の数を求める。
# よって1重のfor文で回してみる
# 最大で2500となる
# 今回は、xの取りうる範囲を考慮しない
k, s = list(map(int,input().split()))
count = 0
for x in range(0, k+1):
if 0 <= s-x and s-x <= k: #(y,z) = (0, s-x), ... ,(s-x, 0)
count += s-x+1
elif k <= s-x and s-x <= 2*k: #(y,z) = (s-x-k, k), ... ,(k, s-x-k)
count += 2*k-(s-x)+1
print(count) | p03835 |
k, s = list(map(int, input().split()))
ans = 0
for a in range(0, k+1):
for b in range(0, k+1):
for c in range(0, k+1):
if a+b+c == s:
ans += 1
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 and z <= k:
ans += 1
print(ans)
| p03835 |
a = input().split()
k = int(a[0])
s = int(a[1])
count = 0
for n1 in range(k+1):
for n2 in range(k+1):
for n3 in range(k+1):
if n1+n2+n3==s:
count += 1
print(count) | a = input().split()
k = int(a[0])
s = int(a[1])
count = 0
for n1 in range(k+1):
for n2 in range(k+1):
if 0<=(s - n1 - n2)<=k:
count += 1
print(count) | p03835 |
import itertools
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 & Z <= K:
ans += 1
print(ans) | K, S = list(map(int, input().split()))
res = 0
for x in range(K+1):
y_z = S - x
if y_z < 0:
continue
y_min = max(y_z-K,0)
y_max = min(y_z,K)
res += max(y_max-y_min+1,0)
print(res) | p03835 |
def main():
ans = 0
a,b = list(map(int,input().split()))
for x in range(a+1):
for y in range(a+1):
if x+y == b:
ans += 1
elif x + y < b:
for z in range(a+1):
if x + y + z == b:
ans += 1
elif x + y + z > b:
break
return ans
print((main()))
| def main():
ans = 0
a,b = list(map(int,input().split()))
for x in range(a+1):
for y in range(a+1):
z = b-x-y
if 0<=z and z<=a:
ans += 1
return ans
print((main()))
| p03835 |
K, S = list(map(int,input().split()))
count = 0
for x in range(0,K+1,1):
for y in range(0,K+1,1):
z = S - x - y
if x+y+z == S and z <= K and z >= 0:
count += 1
print(count) | K, S = list(map(int,input().split()))
count = 0
for x in range(0,K+1,1):
for y in range(0,K+1,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(min(k + 1, s - x + 1)):
for z in range(min(k + 1, s - x - y + 1)):
if x + y + z == s:
ans += 1
print(ans)
| k, s = list(map(int, input().split()))
ans = 0
for x in range(k + 1):
for y in range(k + 1):
if 0 <= s - x - y <= k:
ans += 1
print(ans)
| p03835 |
K, S = list(map(int, input().split()))
count = 0
for x in range(K + 1):
if x > S:
break
for y in range(K + 1):
z = S - (x + y)
if z < 0:
break
if 0 <= z and z <= 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):
z = S - (x + y)
if 0 <= z and z <= K:
count += 1
print(count)
| p03835 |
k, s = [int(i) for i in input().split()]
print(([a + b + c == s for a in range(k + 1) for b in range(k + 1) for c in range(k + 1)].count(True))) | k, s = [int(i) for i in input().split()]
print(([0 <= s-i-j <= k for i in range(k+1) for j in range(k+1)].count(True))) | 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 <= K:
count += 1
print(count) | p03835 |
N,M=list(map(int,input().split()))
counter=0
for a in range(N+1):
for b in range(N+1):
for c in range(N+1):
if a+b+c==M:
counter+=1
print(counter) | N,M=list(map(int,input().split()))
counter=0
for a in range(N+1):
for b in range(N+1):
if 0<=M-(a+b)<=N:
counter+=1
print(counter) | p03835 |
k,s=list(map(int,input().split()))
print((sum(x+y+z==s for x in range(k+1) for y in range(k+1) for z in range(k+1)))) | k,s=list(map(int,input().split()))
ans=0
for i in range(k+1):
for j in range(k+1):
if s-i-j<0: break
if s-i-j<=k: ans+=1
print(ans) | p03835 |
k,s = list(map(int, input().split()))
res = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x+y+z == s:
res += 1
print(res)
| k,s = list(map(int, input().split()))
res = 0
for x in range(k+1):
for y in range(k+1):
z = s-x-y
if 0<=z and z<=k:
res += 1
print(res)
| 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 0<= i <= K and 0<= j <= K and 0<=k<=K and 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 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) <= K:
count +=1
print(count) | p03835 |
K,S = list(map(int,input().split()))
cnt = []
for a in range(K+1):
for b in range(K+1):
if S-a-b>=0 and S-a-b<=K:
cnt.append(S-a-b)
print((len(cnt))) | K,S = list(map(int,input().split()))
cnt = 0
for a in range(K+1):
for b in range(K+1):
if S-a-b>=0 and S-a-b<=K:
cnt += 1
print(cnt) | p03835 |
k, s = list(map(int,input().split()))
counter = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x + y + z == s:
counter += 1
break
elif x + y + z > s:
break
print(counter) | k, s = list(map(int,input().split()))
counter = 0
for x in range(k+1):
for y in range(k+1):
if (s- (x + y) <= k) and (s - (x+ y) >= 0):
counter += 1
print(counter) | p03835 |
k, s = list(map(int,input().split()))
counter = 0
for x in range(k+1):
for y in range(k+1):
if (s- (x + y) <= k) and (s - (x+ y) >= 0):
counter += 1
print(counter) | 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()))
count = 0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if x+y+z == S:
count += 1
print(count) | K, S = list(map(int, input().split()))
count = 0
for x in range(K+1):
for y in range(K+1):
z = S - x - y
if z >= 0 and z <= K:
count += 1
print(count) | p03835 |
k, s = list(map(int, input().split()))
ans = 0
for i in range(k+1):
for j in range(k+1):
for m in range(k+1):
if i+j+m==s:
ans += 1
print(ans) | k, s = list(map(int, input().split()))
ans = 0
for i in range(k+1):
for j in range(k+1):
if s-i-j <= k and 0<=s-i-j:
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 and 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 -1 < S-x-y < K+1:
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 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()))
print((len([1 for i in range(K+1) for j in range(K+1) for k in range(K+1) if i+j+k==S])))
| K,S=list(map(int,input().split()))
print((len([True for x in range(K+1) for y in range(K+1) if (S-x-y>=0) and (S-x-y<=K)])))
| 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):
sum = i + j + k
if sum == S:
cnt+=1
print(cnt) | K, S = list(map(int, input().split()))
cnt = 0
for i in range(K + 1):
for j in range(K + 1):
if S - (i + j) < 0 or S-(i+j)>K:
cnt = cnt
else:
cnt += 1
print(cnt)
| p03835 |
k, s = input().split(" ")
count = 0
for x in range(int(k)+1):
for y in range(int(k)+1):
z = int(s) - x -y
if z >= 0 and z <= int(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):
z = s - x -y
if z >= 0 and z <= k:
count += 1
print(count) | p03835 |
k, s = list(map(int, input().split()))
res = 0
for x in range(k+1):
if x <= s:
for y in range(k+1):
if (x + y) <= s:
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):
z = s - (x + y)
if z >= 0 and z <= k:
res += 1
print(res)
| 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 K>=S-i-j>=0:
count+=1
print(count) | p03835 |
k, s = [int(x) for x in input().split(' ')]
r = 0
for a in range(k + 1):
if a > s:
break
for b in range(k + 1):
if a + b > s:
break
for c in range(k + 1):
if a + b + c == s:
r += 1
break
if a + b + c > s:
break
print(r)
| k, s = [int(x) for x in input().split(' ')]
r = 0
for a in range(k + 1):
if a > s:
break
for b in range(k + 1):
if a + b > s:
break
elif s - (a + b) < k + 1:
r += 1
print(r)
| p03835 |
k, s = [int(x) for x in 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 x==z:
count+=1
elif x==y or x==z or y==z:
count+=3
else:
count+=6
print(count) | k, s = [int(x) for x in input().split()]
count=0
for x in range(k+1):
for y in range(k+1):
if (s-(x+y) <= k and s-(x+y) >=0):
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
for k in range(K+1):
z = k
if x + y + z == 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()))
num = 0
for x in range(K + 1):
for y in range(K + 1):
z = S - x - y
if z <= K and 0 <= z:
num += 1
print(num) | K, S = list(map(int, input().split()))
num = 0
for x in range(K + 1):
rest = S - x
if 0 <= rest and rest <= K:
num += rest + 1
elif K < rest and rest <=2*K:
num += 2*K + 1 - rest
print(num) | 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 i + j <= S and i + j >= S - 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
i = list(range(k+1))
for x in i:
for y in i:
z = s-x-y
if 0 <= 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 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<=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 S - (X + Y) <= K and S - (X + Y) >= 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):
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 = [int(i) for i in input().split()]
counter = 0
for x in range(K + 1):
for y in range(K + 1):
for z in range(K + 1):
if x + y + z == S:
counter += 1
print(counter) | K, S = [int(i) for i in 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 |
count=0
K,S=list(map(int,input().split()))
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):
if (i+j+k)==S:
count+=1
print(count) | count=0
K,S=list(map(int,input().split()))
for i in range(K+1):
for j in range(K+1):
if S-i-j>=0 and S-i-j<=K:
count+=1
print(count) | p03835 |
k,s = list(map(int,input().split()))
counter = 0
x = 0
while x <= k and x <= s:
y = 0
while y <= k and x+y<= s:
z = s-y-x
if 0<=z<=k:
counter += 1
y += 1
x += 1
print(counter) | k,s = list(map(int,input().split()))
counter = 0
for x in range(k+1):
if s-x >= k:
for y in range(k+1):
z = s-x-y
if 0<=z<=k:
counter += 1
else:
for y in range((s-x)+1):
z = s-x-y
if 0<=z<=k:
counter += 1
print(counter) | p03835 |
k,s=list(map(int,input().split()))
ans=0
for x in range(k,-1,-1):
if s-x > k*2:
break
if s < x:
continue
for y in range(k,-1,-1):
if s-x-y > k:
break
if s < x+y:
continue
for z in range(k,-1,-1):
if s-x-y-z > 0:
break
if x+y+z==s:
ans +=1
print(ans)
| k,s=list(map(int,input().split()))
ans=0
for x in range(k,-1,-1):
if s-x > k*2:
break
if s < x:
continue
for y in range(k,-1,-1):
if s-x-y > k:
break
if 0<= s-x-y <=k:
ans +=1
print(ans)
| p03835 |
# ABC 051 B Sum of Three Integers
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) | # ABC 051 B Sum of Three Integers
k, s = list(map(int, input().split()))
res = 0
for x in range(k+1):
for y in range(k+1):
if 0 <= s-x-y <= k:
res += 1
print(res)
| p03835 |
import math
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) | import math
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 K >= z:
ans += 1
print(ans) | p03835 |
K, S = list(map(int, input().split()))
ans = 0
for i in range(K+1):
for j in range(K+1):
for l in range(K+1):
if i + j + l == S:
ans += 1
print(ans) | K, S = list(map(int, input().split()))
ans = 0
for 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()))
ans = 0
for x in range(k+1):
for y in range(k+1):
z = s - (x + y)
if z < 0:
continue
if z <= k:
# print(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):
z = s - (x + y)
if 0 <= z <= k:
ans += 1
print(ans) | p03835 |
import itertools
N = input().split()
N = [int(i) for i in N]
num = [i for i in range(N[0]+1)]
count = 0
#1
for i in range(N[0]+1):
if(3*i == N[1]):
count += 1
l2 = list(itertools.combinations(num, 2))
l3 = list(itertools.combinations(num, 3))
#print(num)
#print(l2)
#2
for i in range(len(l2)):
if((l2[i][0] + 2*l2[i][1]) == N[1]):
count += 1*3
if((l2[i][0]*2 + l2[i][1]) == N[1]):
count += 1*3
#3
for i in range(len(l3)):
if((l3[i][0] + l3[i][1] + l3[i][2]) == N[1]):
count += 1*6
print(count)
| N = input().split()
N = [int(i) for i in N]
count = 0
for i in range(N[0]+1):
for j in range(N[0]+1):
k = N[1] - i - j
if((k <= N[0])and(k>=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):
total = i+j+k
if total==s:
cnt += 1
print(cnt) | 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 i+j>s:
break
if i+j+k>=s:
cnt += 1
print(cnt) | p03835 |
k, s = list(map(int, input().split()))
cnt = 0
for a in range(k+1):
for b in range(k+1):
for c in range(k+1):
if a+b+c == s:
cnt += 1
print(cnt)
| k, s = list(map(int, input().split()))
cnt = 0
for a in range(k+1):
for b in range(k+1):
if 0 <= s-a-b <= 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 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 & 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 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()))
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
ans += (0 <= z <= k)
print(ans) | p03835 |
k,s=list(map(int,input().split()))
l=list(range(k+1))
count=0
for i in l:
for j in l:
k=s-i-j
if l.count(k)==1:
count+=1
print(count) | k,s=list(map(int,input().split()))
l=list(range(k+1))
count=0
for i in l:
for j in l:
q=s-i-j
if 0<=q<=k:
count+=1
print(count) | p03835 |
# -*- coding: utf-8 -*-
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 z < 0 or z > K:
continue
if x + y + z == S:
count += 1
print(count)
| K, S = list(map(int, input().split()))
c = 0
for x in range(K+1):
for y in range(K+1):
if 0 <= (S-x-y) <= K:
c += 1
print(c)
| p03835 |
K,S=list(map(int,input().strip().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(x,y,z)
print(count)
| """
K,S=map(int,input().strip().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(x,y,z)
print(count)
"""
K,S=list(map(int,input().strip().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(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 s - k <= x + y <= s:
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):
Z = S - X - Y
if Z in range(0,K+1):
res += 1
print(res) | 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):
if 0 <= s-x-y <= k:
cnt += 1
print(cnt) | p03835 |
K,S=list(map(int,input().split()))
z = list(range(0,K+1))
answer = []
for i in z:
s_z = S - i
if K < s_z:
for x in list(range(s_z - K,K+1)):
y = s_z - x
answer.append([x, y, z])
else:
for x in list(range(0,s_z+1)):
y = s_z - x
answer.append([x, y, z])
print((len(answer))) | K,S=list(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 |
K,S=list(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))) | K,S=list(map(int,input().split()))
z = list(range(0,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 + 1 - (s_z - K))
else:
ans.append(s_z + 1)
print((sum(ans))) | p03835 |
K,S=list(map(int,input().split()))
z = list(range(0,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 + 1 - (s_z - K))
else:
ans.append(s_z + 1)
print((sum(ans))) | import sys
input = sys.stdin.readline
K,S=list(map(int,input().split()))
z = list(range(0,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 + 1 - (s_z - K))
else:
ans.append(s_z + 1)
print((sum(ans))) | p03835 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.