input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
a, b = list(map(int, input().split()))
ans = 0
for x in range(a+1):
for y in range(a+1):
for z in range(a+1):
if x + y + z == b:
ans += 1
print(ans) | a, b = list(map(int, input().split()))
ans = 0
for x in range(a+1):
for y in range(a+1):
z = b - x - y
if z >= 0 and a >= z:
ans += 1
print(ans) | p03835 |
k,s = list(map(int, input().split()))
count = 0
for i in range(k+1):
x = k - i
for j in range(k+1):
y = k - j
for l in range(k+1):
z = k - l
ss = x+y+z
if ss == s:
count += 1
print(count) | k,s = list(map(int, input().split()))
count = 0
for i in range(k+1):
x = k - i
for j in range(k+1):
y = k - j
z = s - x - y
if 0 <= z <= k:
count += 1
print(count) | p03835 |
# coding: utf-8
# Your code here!
maximum, equal = list(map(int, input().split()))
counter = 0
for i in range(maximum + 1):
for j in range(maximum + 1):
for k in range(maximum + 1):
if equal == i + j + k:
counter += 1
print(counter)
| # coding: utf-8
# Your code here!
K, S = list(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 |
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 0 <= 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 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):
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 i in range(K+1):
for j in range(K+1):
for k in range(K+1):
if int(i + j + k) == 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 |
# coding: utf-8
input_lines=input().split()
K = int(input_lines[0])
S = int(input_lines[1])
M=0
for i in range(K+1):
for j in range(i,K+1):
for k in range(j,K+1):
if i+j+k==S:
if i==j==k:
M+=1
elif i==j or j==k:
M+=3
else:
M+=6
print(M) | # coding: utf-8
input_lines=input().split()
K = int(input_lines[0])
S = int(input_lines[1])
M=0
for i in range(K+1):
for j in range(i,K+1):
k =S-i-j
if i<=j<=k<=K:
if i==j==k:
M+=1
elif i==j or j==k:
M+=3
else:
M+=6
print(M) | p03835 |
import itertools
import math
k, s = list(map(int, input().split()))
ans = 0
for i in itertools.combinations_with_replacement(list(range(k+1)), 3):
if sum(i) == s:
n_unique = len(set(i))
if n_unique == 1:
ans += 1
elif n_unique == 2:
ans += 3
elif n_unique == 3:
ans += 6
print(ans) | k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
for y in range(k+1):
z = s - x - y
if (z >= 0) and (z <= k):
ans += 1
print(ans) | p03835 |
K,S = list(map(int,input().split()))
ans = 0
for a in range(K+1):
for b in range(K+1):
if 0 <= S-a-b <= K:
ans += 1
print(ans) | K,S =list(map(int,input().split()))
ans = 0
for i in range(K+1):
for j in range(K+1):
if 0<= S-i-j <= K:
ans += 1
print(ans) | p03835 |
k, s = list(map(int, input().split()))
count = 0
for i in range(k, -1,-1):
for j in range(k, -1,-1):
z = s - i - j
if i + j + z == s and k >= z and z >= 0:
count += 1
print(count) | k, s = list(map(int, input().split()))
count = 0
for i in range(0, k+1):
for j in range(0, 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(0,k+1):
for y in range(0,k+1):
z = s - x - y
#print("{} {} {}".format(x, y, z))
if 0 <= z <= k and 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()))
l = []
for i in range(k+1):
for j in range(k+1):
l.append([i,j])
#print(len(l))
q = 0
for r in range(k+1):
for p in range(len(l)):
if r + sum(l[p]) == s:
q += 1
#print(k,s,l)
print(q)
| k,s = list(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 |
k, s = list(map(int, input().split()))
sum_set = []
for i in range(k + 1):
for j in range(k + 1):
m = s - i - j
if 0 <= m <= k:
comb = [i, j, m]
sum_set.append(comb)
else:
continue
print((len(sum_set)))
| k, s = list(map(int, input().split()))
count = 0
for i in range(k + 1):
for j in range(k + 1):
m = s - i - j
if 0 <= m <= k:
count += 1
print(count)
| p03835 |
K, S = list(map(int, input().split()))
count=0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if x + y + z == S:
count+=1
print(count) | K, S = list(map(int, input().split()))
count=0
for x in range(K+1):
for y in range(K+1):
if 0 <= S-(x+y) <= K:
count+=1
print(count) | p03835 |
k,s = list(map(int, input().split()))
cnt=0
for i in range(k+1):
for j in range(k+1):
if s>=i+j>=s-k:
cnt+=1
print(cnt) | k,s = list(map(int, input().split()))
cnt=0
minX=max(s-2*k, 0)
maxX=min(s, k)
for x in range(minX, maxX+1):
rest=s-x
if k>=rest:
cnt+=rest+1
else:
cnt+=2*k-rest+1
print(cnt) | p03835 |
a,b=list(map(int,input().split()))
print(([_+y+z for _ in range(a+1) for y in range(a+1) for z in range(a+1)].count(b)))
| 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 i in range(K+1):
for j in range(i,K+1):
for k in range(j,K+1):
if i+j+k==S:
if i<j<k:
ans+=6
elif i<j==k or i==j<k:
ans+=3
else:
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):
k=S-(i+j)
if 0<=k<=K:
ans+=1
print(ans)
| p03835 |
import itertools
K, S = list(map(int, input().split()))
num = list(range(K+1))
count = 0
for x in range(K+1):
if K < 1/2 * (S - x):
continue
for y in range(min(S - x + 1, K + 1)):
if K < (S - x - y):
continue
for z in range(min(S - x - y + 1, 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):
if K < 1/2 * (S - x):
continue
for y in range(min(S - x + 1, K + 1)):
if K < (S - x - y):
continue
else:
count += 1
print(count) | p03835 |
K, S = [int(i) for i in input().split()]
cnt = 0
if S <= K:
for x in range(S+1):
for y in range(S+1):
for z in range(S+1):
if x + y + z == S:
cnt += 1
else :
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 = [int(i) for i in 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 |
import math
import itertools
import statistics
#import numpy as np
import collections
#n = int(input())
k, s = list(map(int, input().split()))
#a = list(map(int, input().split()))
count = 0
for x in range(k+1):
for y in range(s-x+1):
z = s-x-y
ans = x+y+z
if ans==s and y <= k 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(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 |
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 >= 0 and K >= S-x-y:
count += 1
print(count) | p03835 |
k, s = list(map(int, input().split()))
l = set()
for i in range(k+1):
for j in range(k+1):
if i+j+k >= s and s-i-j >= 0:
l.add((i, j, s-i-j))
else:
continue
print((len(l))) | k, s = list(map(int, input().split()))
count = 0
for i in range(k+1):
for j in range(k+1):
if i+j+k >= s and s-i-j >= 0:
count += 1
else:
continue
print(count) | p03835 |
k, s = list(map(int, input().split()))
counter = 0
for x in range(k + 1):
for y in range(x, k + 1):
z = s - x - y
if y <= z <= k:
if x == y == z:
counter += 1
elif x == y or y == z:
counter += 3
else:
counter += 6
print(counter)
| k, s = list(map(int, input().split()))
counter = 0
for i in range(k + 1):
counter += max(min(k, s - i) - max(0, s - k - i) + 1, 0)
print(counter)
| p03835 |
K, S = list(map(int,input().split()))
count = 0
for X in range(K+1):
for Y in range(K+1):
for Z in range(K+1):
if X + Y + Z == S:
count += 1
print(count) | K, S = list(map(int,input().split()))
count = 0
#ZはXとYが決まった時点で自動的に決まる。
for X in range(K+1):
for Y in range(K+1):
Z = S - X - Y
#範囲が条件ないならOK
if 0 <= Z and Z <= K:
count += 1
print(count) | 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):
if(x + y > s):
break
for z in range(k+1):
if (x + y + z == s):
count = count + 1
print(count) | 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):
if(x + y > s):
break
if(s - (x + y) <= k):
count = count + 1
print(count) | p03835 |
k, s = list(map(int, input().split()))
apple = [i + j + l for i in range(k + 1) for j in range(k + 1) for l in range(k + 1)]
print((apple.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-z-y <= k]))) | p03835 |
K, S = list(map(int, input().split()))
x = S if K>S else K
ans = 0
for i in range(x+1):
x1 = S-i
for j in range((K if x1>K else x1)+1):
x2 = S-i-j
for k in range((K if x2>K else x2)+1):
if i+j+k==S:
#print("{} {} {}".format(i,j,k))
ans += 1
print(ans) | K, S = list(map(int, input().split()))
x = S if K>S else K
ans = 0
for i in range(x+1):
x1 = S-i
for j in range((K if x1>K else x1)+1):
if S-i-j <= K:
ans += 1
print(ans) | p03835 |
k,s=list(map(int,input().split()))
ans=0
for i in range(k+1):
for j in range(k+1):
for x in range(k+1):
if i+j+x==s:
ans+=1
print(ans) | 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()))
result = 0
for x in range(k + 1):
for y in range(k + 1):
for z in range(k + 1):
if x + y + z == s:
result += 1
break
print(result)
| k, s = list(map(int, input().split()))
result = 0
for x in range(k + 1):
for y in range(k + 1):
z = s - x - y
if 0 <= z <= k:
result += 1
print(result)
| p03835 |
k, s = list(map(int, input().split()))
result = 0
for x in range(k + 1):
for y in range(k + 1):
z = s - x - y
if 0 <= z <= k:
result += 1
print(result)
| k, s = list(map(int, input().split()))
result = 0
for x in range(0, k + 1):
for y in range(0, k + 1):
if 0 <= s - x - y <= k:
result += 1
print(result)
| p03835 |
K,S = list(map(int,input().split()))
counter = 0
counter_d = 0
counter_tri =0
for i in range(K+1):
for j in range(i+1,K+1):
for k in range(j+1,K+1):
if i+j+k ==S:
counter +=6
for i in range(K+1):
for k in range(K+1):
if 2*i+k== S:
if i == k:
counter += 1
else:
counter +=3
print(counter)
| K,S = list(map(int,input().split()))
counter = 0
for i in range(K+1):
for j in range(K+1):
if 0<=S-i-j<=K:
counter +=1
# print(str(i)+' '+str(j)+ ' ' + str(S-i-j))
print(counter)
| p03835 |
count = 0
a,b = list(map(int,input().split()))
for i in range(a+1):
for j in range(a+1):
for k in range(a+1):
if i + j + k == b:
count +=1
print(count) | count = 0
a,b = list(map(int,input().split()))
for i in range(a+1):
for j in range(a+1):
z = b - i - j
if 0<=z<=a:
count +=1
print(count) | p03835 |
a,b=list(map(int,input().split()))
n=0
for x in range(a+1):
for y in range(a+1):
for z in range(a+1):
if x+y+z==b:
n+=1
print(n)
| a,b=list(map(int,input().split()))
n=0
for y in range(a+1):
for z in range(a+1):
p=b-y-z
if 0<=p and p<=a:
n+=1
print(n)
| 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 >= 0 and S-x-y <= K:
ans += 1
print(ans)
| p03835 |
k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
for y in range(k+1):
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()))
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()));a=0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x+y+z == s: a+=1
print(a) | k,s = list(map(int,input().split()))
c=0
for i in range(k+1):
for j in range(k+1):
if 0 <= s-i-j <= k:
c+=1
print(c) | p03835 |
K,S=list(map(int,input().split()))
a=[];ans=0
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):a.append((i,j,k))
for i in a: ans+=1 if sum(i)==S else 0
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):ans+=1 if i+j+k==S else 0
print(ans) | p03835 |
K,S=list(map(int,input().split()))
ans=0
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):ans+=1 if i+j+k==S else 0
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 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) | K,S=list(map(int,input().split()));print((len([0 for i in range(K+1) for j in range(K+1) if(0<=S-i-j and S-i-j<=K)]))) | 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
ans += 1 if z>=0 and z<=k else 0
print(ans) | p03835 |
a,b = list(map(int,input().split()))
c = 0
for i in range(a+1):
for j in range(a+1):
for k in range(a+1):
if i+j+k== b:
c+=1
print(c) | a,b = list(map(int,input().split()))
c = 0
for i in range(a+1):
for j in range(a+1):
z = b-i-j
if i+j+z==b and 0<=z<=a:
c+=1
print(c) | p03835 |
def actual(K, S):
my_range = lambda n: list(range(n + 1))
count = 0
for x in my_range(K):
for y in my_range(K):
for z in my_range(K):
if x + y + z == S:
count += 1
return count
K, S = list(map(int, input().split()))
print((actual(K, S))) | def actual(K, S):
my_range = lambda n: list(range(n + 1))
count = 0
for x in my_range(K):
for y in my_range(K):
z = S - (x + y)
if 0 <= z <= K:
count += 1
return count
K, S = list(map(int, input().split()))
print((actual(K, S))) | p03835 |
k, s = list(map(int, input().split()))
count = 0
for l in range(k+1):
for m in range(k+1):
for n in range(k+1):
if l+m+n == 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 |
# B
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) | # B
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=list(map(int,input().split()))
cnt=0
for i in range(s+1):
for j in range(i,s+1):
if i<=k and j-i<=k and s-j<=k:
cnt+=1
print(cnt)
| k,s=list(map(int,input().split()))
cnt=0
for i in range(s+1):
if i>k:
break
cnt+= max(0,min(i+k,s)-max(s-k,i)+1)
print(cnt)
| p03835 |
k, s = list(map(int, input().split()))
ans = 0
for i in range(k+1):
for j in range(k+1):
for m in range(k+1):
if i+j+m == 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):
for y in range(k+1):
for z in range(k+1):
if s==x+y+z:
count+=1
print(count) | k,s=list(map(int,input().split()))
count=0
for x in range(k+1):
for y in range(k+1):
if k>=s-(y+x)>=0:
count+=1
print(count) | p03835 |
def solve(K, S):
import bisect
count = 0
z_array = [i for i in range(K+1)]
for x in range(K+1):
for y in range(K+1):
z = S - x - y
index = bisect.bisect_left(z_array, z)
if(index != K+1 and z_array[index] == z):count+=1
return count
def main():
K, S = list(map(int, input().split()))
print((solve(K, S)))
#print(solve(2, 2))
#print(solve(5, 15))
main() |
def solve(K, S):
import bisect
count = 0
z_array = [i for i in range(K+1)]
for x in range(K+1):
for y in range(K+1):
z = S - x - y
if(z >= 0 and z <= K):count+=1
return count
def main():
K, S = list(map(int, input().split()))
print((solve(K, S)))
#print(solve(2, 2))
#print(solve(5, 15))
main() | p03835 |
import sys
input = sys.stdin.readline
K,S=list(map(int,input().split()))
crt=0
for x in range(0,K+1):
for y in range(0,K+1):
z=S-x-y
if 0<=z<=K:
crt+=1
print(crt) | K,S=list(map(int,input().split()))
crt=0
for x in range(0,K+1):
for y in range(0,K+1):
z=S-x-y
if 0<=z<=K:
crt+=1
print(crt) | p03835 |
k, s = list(map(int, input().split()))
ans = 0
for l in range(k+1):
for n in range(k+1):
for m in range(k+1):
if l+n+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 0 <= s-i-j <= k: ans += 1
print(ans) | p03835 |
K, S = list(map(int, input().split()))
cnt = 0
for x in range(K + 1):
for y in range(K + 1):
for z in range(K + 1):
if x + y + z == S:
cnt += 1
print(cnt) | K, S = list(map(int, input().split()))
cnt = 0
for x in range(K + 1):
for y in range(K + 1):
if 0 <= S - x - y <= K:
cnt += 1
print(cnt)
| 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()));k+=1;print((sum(k>s-I//k-I%k>=0for I in range(k*k)))) | k,s=list(map(int,input().split()));print((sum(max(0,min(2*k+i-s+1,s-i+1))for i in range(k+1)))) | 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 = (int(i) for i in input().split())
answer = 0
for i in range(((s-s%3)//3)+1):
n = s-i
for i2 in range(i,((n-n%2)//2)+1):
for i3 in range(i2,k+1):
if i+i2+i3==s:
if i==i2 and i2==i3: answer += 1
elif i==i2 or i2==i3: answer += 3
else: answer += 6
break
print(answer) | k,s = (int(i) for i in input().split())
answer = 0
for i in range(k+1):
for j in range(k+1):
if 0<=s-(i+j)<=k: answer += 1
print(answer) | 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()))
tmp = 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:
tmp += 1
print(tmp) | K, S = list(map(int, input().split()))
tmp = 0
for x in range(0,(K+1)):
for y in range(0,(K+1)):
if 0 <= S - x - y <= K:
tmp += 1
print(tmp) | 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 K >= S-X-Y >= 0:
ans += 1
print(ans) | p03835 |
k,s=list(map(int,input().split()))
print(([x+y+z for x in range(k+1) for y in range(k+1) for z in range(k+1)].count(s))) | k,s=list(map(int,input().split()))
print(([x+y+s-(x+y) for x in range(k+1) for y in range(k+1) if 0<= s-x-y <= k].count(s))) | p03835 |
K,S=list(map(int,input().split()))
A=[]
for i in range(K+1) :
for j in range(K+1) :
if S-i-j>K or S-i-j<0 :
continue
A.append([i,j,S-i-j])
print((len(A))) | K,S=list(map(int,input().split()))
ans=0
for i in range(K+1) :
if S-i>2*K :
continue
elif S-i<0 :
break
elif 0<=S-i<=K :
ans+=S-i+1
else :
ans+=2*K+i-S+1
print(ans) | p03835 |
k,s = list(map(int,input().split()))
ans = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x + y + z == s:
ans += 1
print(ans) | k,s = list(map(int,input().split()))
ans = 0
for x in range(k+1):
for y in range(k+1):
if 0 <= s - x - y <= k:
ans += 1
print(ans) | p03835 |
K, S = list(map(int, input().split()))
print(([x+y+z == S for x in range(K+1) for y in range(K+1)
for z in range(K+1)].count(True)))
| K, S = list(map(int, input().split()))
print(([0 <= S - x - y <= K for x in range(K+1)
for y 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 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==s-z:
cnt += 1
break
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 |
import itertools
K,S = (int(i) for i in input().split())
A=()
for i in range(K+1):
A=A+(i,)
L=list(itertools.combinations_with_replacement(A,3))
SUM=0
for i in range(len(L)):
if L[i][0]+L[i][1]+L[i][2]==S:
if len(L[i]) == len(set(L[i])) + 2:
SUM = SUM + 1 # sonomama! 3tu tyouhuku
if len(L[i]) == len(set(L[i])) + 1:
SUM = SUM + 3 # kakeru3 2tu tyouhuku
if len(L[i]) == len(set(L[i])): # kakeru6 tyouhuku 0
SUM = SUM + 6
print(SUM) | K,S=list(map(int,input().split()))
b=sum(0<=S-x-y<=K for x in range(K+1)for y in range(K+1))
print(b) | 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):
sumn = x + y + z
if sumn == 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):
sumn = S - (x + y)
if sumn >= 0 and sumn <= 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):
sumn = S - (x + y)
if sumn >= 0 and sumn <= K:
ans += 1
print(ans) | K, S = list(map(int, input().split()))
count = 0
for x in range(K+1):
for y in range(K+1):
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 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):
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):
z = s - x - y
if 0 <= z and z <= k:
ans += 1
print(ans) | p03835 |
# B - Sum of Three Integers
def main():
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
else:
print(cnt)
if __name__ == "__main__":
main() | # B - Sum of Three Integers
def main():
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
else:
print(cnt)
if __name__ == "__main__":
main() | 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()))
n = k + 1
count = 0
for i in range(n):
for j in range(n):
for l in range(n):
if i + j + l == s:
count += 1
print(count) | k, s = list(map(int, input().split()))
n = k + 1
count = 0
for i in range(n):
for j in range(n):
if ( 0 <= s - i - j <= k):
count += 1
print(count) | p03835 |
k, s = list(map(int, input().split()))
n = k + 1
count = 0
for i in range(n):
for j in range(n):
if ( 0 <= s - i - j <= k):
count += 1
print(count) | k,s = list(map(int,input().split()))
print((sum(0<=s-i-j<=k for i in range(k+1) for j in range(k+1)))) | p03835 |
a = list(map(int,input().split()))
num=0
for l in range(a[0]+1):
for m in range(a[0]+1):
if(a[1]-l-m <= a[0] and a[1]-l-m >= 0):
num+=1
print(num) | inputs= list(map(int,input().split()))
k = inputs[0]
s = inputs[1]
answer = 0
for i in range(k+1):
x = i
for l in range(k+1):
y = l
z = s-x-y
if z >= 0 and z <= k :
answer += 1
print(answer) | p03835 |
K, S = list(map(int,input().split()))
count = 0
for i in range(0,K+1):
if i > S:
continue
for j in range(0,K+1):
if i + j > S:
continue
for k in range(0,K+1):
if i + j + k > S:
continue
if i + j + k == S:
count += 1
print(count) | K, S = list(map(int,input().split()))
count = 0
for i in range(0,K+1):
if i > S:
continue
for j in range(0,K+1):
if 0 <= (S - i - j) <= K:
count += 1
print(count) | p03835 |
k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
for y in range(k+1):
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 x+y > s:
continue
if 0 <= s-x-y <= k:
ans += 1
print(ans)
| p03835 |
k, s = list(map(int, input().split()))
ans = 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:
ans += 1
elif a + b + c > s:
break
print(ans) | k, s = list(map(int, input().split()))
ans = 0
for a in range(k+1):
for b in range(k+1):
if 0 <= s - a - b <= k:
ans += 1
print(ans) | p03835 |
K,S=list(map(int,input().split()))
ans=0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if x+y+z==S:
ans+=1
print(ans)
| K,S = list(map(int,input().split()))
ans = 0
for x in range(K+1):
for y in range(K+1):
if 0 <= S-x-y <= K:
ans += 1
print(ans) | p03835 |
K, S = list(map(int, input().split()))
count= 0
Z1 = [i for i in range(K+1)]
for i in range(K+1):# X
for j in range(K+1):#Y
Z = S - i - j
if Z in Z1:
count += 1
print(count) | K, S = list(map(int, input().split()))
count= 0
for i in range(K+1):# X
for j in range(K+1):#Y
Z = S - i - j
if 0 <= Z <= K:
count += 1
#print(i,j,Z)
print(count) | p03835 |
K, S = list(map(int, input().split()))
count= 0
for i in range(K+1):# X
for j in range(K+1):#Y
Z = S - i - j
if 0 <= Z <= K:
count += 1
#print(i,j,Z)
print(count) | K, S = list(map(int, input().split()))
ans = 0
for i in range(K + 1):
for j in range(K + 1):
#print(i, j)
if 0 <= S - i - j <= K:
ans += 1
print(ans) | p03835 |
import itertools
ans = 0
k, s = list(map(int, input().split()))
sa = [int(i) for i in range(k+1)]
c = itertools.product(sa,repeat=3)
for i in c:
if i[0] + i[1] + i[2] == 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 i in range(k + 1):
for j in range(k + 1):
if i + j > s:
break
elif s - i - j <= k:
cnt += 1
print(cnt)
| k, s = list(map(int, input().split()))
cnt = 0
for i in range(k + 1):
for j in range(k + 1):
if 0 <= s - i - j <= k:
cnt += 1
print(cnt)
| p03835 |
def slove():
import sys
input = sys.stdin.readline
k, s = list(map(int, input().rstrip('\n').split()))
cnt = 0
for i in range(k + 1):
for j in range(k + 1):
n = s - i - j
if 0 <= n <= k:
cnt += 1
print(cnt)
if __name__ == '__main__':
slove()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
k, s = list(map(int, readline().split()))
cnt = 0
for x in range(k + 1):
for y in range(k + 1):
ts = s - x - y
if 0 <= ts <= k:
cnt += 1
print(cnt)
if __name__ == '__main__':
solve()
| p03835 |
k,s = list(map(int, input().split()))
cnd = list(range(0, k+1))
print((str(sum([1 for x in cnd for y in cnd for z in cnd if x+y+z == s])))) | k,s = list(map(int, input().split()))
cnd = list(range(0, k+1))
print((str(sum([1 for x in cnd for y in cnd if s-x-y in cnd])))) | p03835 |
# -*- coding: utf-8 -*-
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=count+1
print(count) | # -*- coding: utf-8 -*-
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=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()))
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()))
n = 0
for x in range(k+1):
for y in range(k+1):
z = s-x-y
if 0<=z<=k:
n+=1
print(n) | p03835 |
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 0<=z<=k:
n+=1
print(n) | 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()))
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) | 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 |
#-*-coding:utf-8-*-
def main():
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)
if __name__ == '__main__':
main() | #-*-coding:utf-8-*-
def main():
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)
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):
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(min(S-x, K)+1):
if S-x-y <= K: ans += 1
print(ans) | p03835 |
K,s=list(map(int,input().split()))
cnt=0
for i in range(K+1):
for j in range(K+1):
if s-i-j >= 0 and s-i-j<=K:
cnt+=1
print(cnt) | K,s=list(map(int,input().split()))
cnt=0
for i in range(K+1):
if s-i>2*K:
continue
for j in range(K+1):
if s-i-j<0:
break
if s-i-j<=K:
cnt+=1
print(cnt) | p03835 |
K,S = list(map(int, input().split()))
count = 0
for x in range(K+1):
for y in range(K+1):
z = S-x-y
if 0 <= z <= K:
count += 1
print(count) | K,S = list(map(int,input().split()))
ans = 0
for x in range(K+1):
rem = S - x
if rem < 0: break
if rem > 2*K: continue
for y in range(K+1):
z = rem - y
if z < 0: break
if z > K: continue
ans += 1
print(ans)
| p03835 |
K,S = list(map(int,input().split()))
ans = 0
for x in range(K+1):
rem = S - x
if rem < 0: break
if rem > 2*K: continue
for y in range(K+1):
z = rem - y
if z < 0: break
if z > K: continue
ans += 1
print(ans)
| K,S = list(map(int,input().split()))
ans = 0
for a in range(K+1):
if a > S: break
for b in range(K+1):
c = S-a-b
if 0 <= c <= 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):
z = S - i - j
if 0 <= z <= K:
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):
z = S - x - y
if 0 <= z <= 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):
z = S - y - x
if 0 <= z <= K:
cnt += 1
print(cnt) | def main():
K, S = list(map(int, input().split()))
ans = 0
for i in range(K+1):
for j in range(K+1):
tmp = i + j
if 0 <= S - tmp <= K:
ans += 1
print(ans)
if __name__ == "__main__":
main() | p03835 |
K, S = list(map(int, input().split()))
counter = 0
for x in range(K + 1):
for y in range(K + 1):
z = S - (x + y)
if 0 <= z <= K:
counter += 1
print(counter)
| K, S = list(map(int, input().split()))
ans = 0
for x in range(K+1):
for y in range(min(K, S-x)+1):
z = S - x - y
if K >= z >= 0:
ans += 1
print(ans) | p03835 |
def main():
k, s = list(map(int, input().split()))
ans = 0
for x in range(max(0, s-2*k), k + 1):
for y in range(max(0, s-2*k), k + 1):
for z in range(k + 1):
if x + y + z == s:
ans += 1
break
print(ans)
if __name__ == '__main__':
main()
| 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 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(x, K + 1):
z = S - (x + y)
if y <= z and z <= K:
if x == y and y == z:
ans += 1
elif x == y or y == z or z == x:
ans += 3
else:
ans += 6
print(ans) | p03835 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.