problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03835 | s582379048 | Wrong Answer | import itertools
k,s=map(int,input().split())
arr=[]
cnt=0
for x in range(k+1):
for y in range(x,k+1):
z=s-x-y
if 0<=z<=k:
if x==y==z:
cnt+=1
elif x==y or y==z or z==x:
cnt+=3
else:
cnt+=6
print(cnt) |
p03835 | s316616925 | Wrong Answer | K,S=map(int,input().split())
ans=0
for i in range(S+1):
if S-i<i:
break
for j in range(i,S+1):
if S-i-j<j:
break
for k in range(j,S+1):
if i+j+k==S:
if i==j==k:
ans+=1
else:
if i==j or j==k or k==i:
ans+=3
else:
ans+=6
print(ans) |
p03835 | s168176199 | Wrong Answer | k, s = map(int, input().split())
ans = 0
for x in range(k+1):
for y in range(k+1):
if s - x - y <= k:
ans += 1
print(ans)
|
p03835 | s702238666 | Wrong Answer | K,S = map(int,input().split())
cnt = 0
for x in range(K+1):
for y in range(K+1):
z = S - x - y
if z <= K:
cnt +=1
print(cnt) |
p03835 | s747562153 | Wrong Answer | K, S = map(int, input().split())
res = 0
for X in range(min(S, K), -1, -1):
for Y in range(min(K, S - X), -1, -1):
if S - X - Y >= 0:
res += 1
print(res) |
p03835 | s252683405 | Wrong Answer | K, S = map(int, input().split())
ans = 0
for x in range(0, K+1):
for y in range(0, K+1):
if 0 <= S - (x + y) <= K:
ans += 1
print(x, y, S-(x+y))
print(ans)
|
p03835 | s156301486 | Wrong Answer | def main():
K,S = map(int,input().split())
ans = 0
ListK = [i+1 for i in range(K)]
for x in ListK:
for y in ListK:
if S - (x + y) <= K:
ans += 1
if __name__ == '__main__':
main() |
p03835 | s484016951 | Wrong Answer | K, S = map(int, input().split())
K = K + 1
count = 0
for i in range(K):
for j in range(K):
z = S - i - j
if z < K and z > 0:
count += 1
print(count) |
p03835 | s503674742 | Wrong Answer | K,S= map(int,input().split())
ans = 0
for X in range(K+1):
T = S-X
if T <= K:
ans += T + 1
elif T <= 2*K:
ans += 2*K-T+1
print(ans)
|
p03835 | s694646556 | Wrong Answer | K,S = map(int,input().split())
ans = 0
for x in range(K+1):
for y in range(K+1):
N = S - x -y
if N <= K:
ans +=1
print(ans) |
p03835 | s902646950 | Wrong Answer | K,S=map(int, input().split())
count = 0
for x in range(K+1):
for y in range(S-x+1):
for z in range(S-x-y+1):
if x+y+z == S:
count = count + 1
print(count)
|
p03835 | s998428643 | Wrong Answer | from math import *
def nHr(n, r):
if 0 < r:
return factorial(n+r-1) / (factorial(r) * factorial(n-1))
else:
return 0
lst = input().split()
K = int(lst[0])
S = int(lst[1])
a = nHr(3, S)
b = (3 * nHr(3, S - K)) - (3 * nHr(3, S - (2*K)))
print(int(a - b)) |
p03835 | s342502151 | Wrong Answer | a,b=map(int,input().split())
ans=0
for i in range(a+1):
for j in range(a+1):
if (b-i-j)<=a:
ans+=1
print(ans) |
p03835 | s211345715 | Wrong Answer | k,s=map(int,input().split())
t=0
for i in range(k+1):
for j in range(k+1):
l=s-i-j
if i+j+l==s:
t+=1
print(t)
|
p03835 | s704515760 | Wrong Answer | K, S = map(int, input().split())
cnt = 0
for i in range(K+1):
for j in range(K-i+1):
if S - i - (K - j) <= K:
cnt += 1
print(cnt)
|
p03835 | s407785329 | Wrong Answer | K , S = map(int , input().split())
ans = 0
for x in range(K):
for y in range(K):
if x + y + (S-(x+y)) == S:
ans += 1
print(ans) |
p03835 | s408868577 | Wrong Answer | K, S = map(int, input().split())
ans = 0
for X in range(S//3, K + 1):
for Y in range(S // 3, K + 1):
if X + Y > S:
continue
for Z in range(S//3,K + 1):
if X + Y + Z == S:
ans += 1
print(ans) |
p03835 | s696008603 | Wrong Answer | def main():
K, S = map(int, input().split())
ans = 0
for X in range(K + 1):
for _ in range(K - X + 1):
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p03835 | s234992334 | Wrong Answer | K,S= map(int,input().split())
ans = 0
for X in range(0,K+1):
for Y in range(X,K+1):
for Z in range(Y,K+1):
if X + Y + Z == S:
if X == Y == Z:
ans += 1
else:
ans += 3
print(ans) |
p03835 | s918091819 | Wrong Answer | K, S = map(int, input().split())
res = 0
for XY in range(2*K+1):
Z = S - XY
if Z in range(K):
res += 2
else:
res += 1
print(res) |
p03835 | s675850992 | Wrong Answer | a,sums=list(map(int,input().split()))
if a*3==sums:
print(1)
else:
ret=0
mai=2 if sums%3==0 & sums // 3 <= a else 0
for i in range(a):
if sums-i <2*a:
for d in range(a):
if sums-i-d<a:
if sums-i-d == d:
ret+=1
else:
ret+=2
if sums-i == 2*a:
ret+=1
print(ret*3-mai) |
p03835 | s962886611 | Wrong Answer | K, S = map(int, input().split())
ways = 0
for i in range(K+1):
for j in range(K+1):
k = S - i - j
if k >= 0 and k <= 2*K:
ways += 1
print(ways) |
p03835 | s953723155 | Wrong Answer | k, s = map(int, input().split())
count = 0
for i in range(k+1):
rem = s - i
for j in range(rem+2):
y, z = j, rem-j
if y <= 5 and z <= 5:
if s == y+z+i:
count += 1
print(count)
|
p03835 | s096184886 | Wrong Answer | k,s = map(int,input().split())
a = 0
for x in range(k+1):
for y in range(k+1):
if s-(x+y) <= k:
a += 1
print(a) |
p03835 | s311037739 | Wrong Answer | k,s = map(int,input().split())
ans = 0
if(s == 0):
print(1)
exit()
elif(s == 3*k):
print(1)
exit()
for i in range(0,k+1):
for j in range(0,k+1):
z = s - i - j
if(z >= 0 and z >= k):
ans += 1
print(ans) |
p03835 | s265842744 | Wrong Answer | k, s = map(int,input().split(' '))
count = 0
for x in range(2,k+1):
for y in range(2,k+1):
if x + y > s:
continue
for z in range(2,k+1):
if x + y + z == s:
count += 1
print(count) |
p03835 | s959354614 | Wrong Answer | k, s = map(int, input().split())
cnt = 0
for x in range(k+1):
if x == k:
cnt += 1
continue
for y in range(k-x+1):
if x+y == s:
cnt += 1
break
for z in range(k-x-y+1):
if x+y+z == s:
cnt += 1
break
print(cnt)
|
p03835 | s642861281 | Wrong Answer | K, S = map(int, input().split())
ans = 0
for x in range(K+1):
for y in range(K+1):
if S - K == x + y:
ans += 1
print(ans) |
p03835 | s027451441 | Wrong Answer | 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(S-X-Y,S-X-Y+1):
if X+Y+Z == S:
ans = ans + 1
print(ans) |
p03835 | s953561961 | Wrong Answer | k, s = map(int, input().split())
ans = 0
for x in range(k+1)[::-1]:
y = max(0, min(s-x, k))
z = s-x-y
if z > k or z < 0:
break
ans += y - z + 1
print(ans) |
p03835 | s855890597 | Wrong Answer | K , S = map(int , input().split())
ans = 0
for x in range(K):
for y in range(K):
if x + y + (S-(x+y)) == S:
ans += 1
ans += ans/2
print(int(ans)) |
p03835 | s825397520 | Wrong Answer | k,s=map(int,input().split())
ans = 0
for x in range(k+1):
for y in range(k+1):
z = s - x -y
if z<0 or k<z:
break
else:
ans +=1
print(ans) |
p03835 | s383063660 | Wrong Answer | k, s = map(int, input().split())
count = 0
temp = s-2*k if (s-2*k)>0 else 0
for x in range(temp, k+1):
for y in range(x+1, k+1):
for z in range(y+2, k+1):
if x+y+z == s:
count += 6
for z in range(temp, k+1):
if x*2 + z == s:
if x == z:
count += 1
else:
count += 3
print(count) |
p03835 | s634579856 | Wrong Answer | K, S = map(int, input().split())
ans = 0
for x in range(K+1):
for y in range(K+1):
if S-x-y <= K: ans += 1
print(ans) |
p03835 | s756068893 | Wrong Answer | K,S = map(int,input().split())
count = 0
for i in range(K+1):
for j in range(K+1-i):
for k in range(K+1-i-j):
if i+j+k == S:
count+=1
print(count) |
p03835 | s818717704 | Wrong Answer | result = 0
k, s = map(int, input().split())
for i in range(s + 1):
for j in range(s - i + 1):
if i + j + (s - i - j) <= s:
result += 1
print(result) |
p03835 | s282127965 | Wrong Answer | # vim: fileencoding=utf-8
def main():
k, s = map(int, input().split())
c = 0
for i in range(k + 1):
for j in range(k + 1):
z = s - i - j
if z > 0 and z <= k:
c += 1
print(c)
if __name__ == "__main__":
main()
|
p03835 | s703488904 | Wrong Answer | K, S = map(int, input().split())
count = 0
for x in range(K+1):
if S-x<=2*K and S-x>=0:
for y in range(K+1):
if S-x-y<=K and S-x-y>=0:
print(x, y)
count += 1
# for z in range(K+1):
# if x+y+z==S:
# count += 1
print(count) |
p03835 | s014032176 | Wrong Answer | k,s=map(int,input().split())
ret=0
for i in range(k):
for j in range(k):
if 0<=(i+j)<=s:
ret+=1
print(ret) |
p03835 | s401644487 | Wrong Answer | k, s = map(int, input().split())
# init (x<=y<=z)
if k<s:
z=k
if k<s-z:
y=k
x = s-2*k
else:
y=s-z
x=0
else:
z=s
x,y = 0, 0
print(len(sum([[None for j in range(z-x-i+1)] for i in range(z-y+1)], [])))
|
p03835 | s853847484 | Wrong Answer | k, s = map(int, input().split())
ans = 0
for x in range(k + 1):
for y in range(k + 1):
z = s - (x + y)
if z <= k:
ans += 1
print(ans) |
p03835 | s590984745 | Wrong Answer | k, s = map(int, input().split())
ans = 0
for x in range(k):
for y in range(k):
z = s-x-y
if k >= z >= 0:
ans += 1
print(ans) |
p03835 | s991353823 | Wrong Answer | k,s = map(int, input().split())
ans = 0
for x in range(k+1):
for y in range(k+1):
if 0 <= s-x-y <= k:
ans += k+x+y-s+1
break
print(ans)
|
p03835 | s010429844 | Wrong Answer | k, s = list(map(int, input().split()))
minz = max(0, s-2*k)
maxz = k
def f(s, k):
if k >= s:
return (s+1)
else:
return (2*k-s)+1
ans = 0
for i in range(minz, maxz+1):
ans += f(s-i, k)
print(ans) |
p03835 | s180798372 | Wrong Answer | K, S = map(int, input().split())
ans = 0
for x in range(K+1):
for y in range(K+1-x):
z = K - x - y
if x + y + z == S:
ans += 1
print(ans) |
p03835 | s462273970 | Wrong Answer | k,s = map(int,input().split())
ans = 0
if s>3*k:
print(0)
elif s==3*k:
print(1)
else:
for i in range(k+1):
for j in range(k+1):
if s-k<=i+j<=s:
ans += 1
print(ans) |
p03835 | s323120081 | Wrong Answer | a,b=map(int,input().split())
c=0
for x in range(a+1):
for y in range(a+1):
if b-x-y>=0:c+=1
print(c) |
p03835 | s121227643 | Wrong Answer | K,S = map(int, input().split())
ans = 0
for x in range(K+1):
for y in range(K+1):
print(S-x-y)
if 0 <= S-x-y <= K:
ans += 1
print(ans) |
p03835 | s139848874 | Wrong Answer | K,S=map(int,input().split())
ans=0
for i in range(S):
for j in range(S-i):
for k in range(S-i-j):
if i+j+k<=K:
ans+=1
print(ans) |
p03835 | s745546140 | Wrong Answer | k, s = map(int, input().split())
cnt = 0
for x in range(k + 1):
for y in range(max(0,s // 3 - x), k + 1):
for z in range(max(0,s - x - y), k + 1):
if x + y + z == s:
cnt += 1
break
else:
continue
print(cnt)
|
p03835 | s085361888 | Wrong Answer | input_str = input().split()
k = int(input_str[0])
s = int(input_str[1])
print(k)
print(s)
count = 0
for x in range(k+1):
for y in range(k+1-x):
for z in range(k+1-x-y):
if x+y+z == s:
count += 1
print(count)
|
p03835 | s831448816 | Wrong Answer | k, s = map(int, input().split())
if k * 3 < s:
print(0)
else:
r = k * 3 - s
r = min(k, r, s)
ans = (r + 2) * (r + 1) // 2
print(ans) |
p03835 | s190133933 | Wrong Answer | K, S = map(int, input().split())
cnt = 0
from itertools import combinations_with_replacement as cmbr
for x, y in cmbr(range(K+1),2):
if 0 <= S-x-y <= K:
cnt += 1
print(cnt) |
p03835 | s860366832 | Wrong Answer | i,j=map(int,input().split())
a=0
for x in range(i+1):
for y in range(i+1):
if j-(x+y)<=i:
a+=1
print(a) |
p03835 | s685197925 | Wrong Answer | k ,s = map(int, input().split())
count = 0
for x in range(min(k+1,s + 1)):
for y in range(x,min(x+k+1,s +1)):
count += 1
print(count) |
p03835 | s256701886 | Wrong Answer | import sys
input = sys.stdin.readline
def main():
k, s = map(int, input().split())
vals = [x + y + z for x in range(k+1) for y in range(k+1) for z in range(k+1) if x + y + z == s]
print(len([vals]))
if __name__ == '__main__':
main() |
p03835 | s361880895 | Wrong Answer | k,s=map(int,input().split())
print(abs(s-3*k+2)*abs(s-3*k+1)//2) |
p03835 | s856664304 | Wrong Answer | K, S = map(int, (input().split()))
ans = 0
for x in range(0, K + 1):
for y in range(0, K + 1):
z = S - x - y
if z <= K:
ans += 1
print(ans)
|
p03835 | s928855312 | Wrong Answer | k,s=map(int,input().split())
count=0
for i in range(0,k+1):
for k in range(0,k+1):
if s-i-k>=0:
count+=1
print(count) |
p03835 | s942087397 | Wrong Answer | k,s = map(int,input().split())
start = s//3
ans = 0
for i in range(start,k+1):
for j in range(start,k+1):
for l in range(start,k+1):
if i+j+l == s:
ans += 1
print(ans) |
p03835 | s832247855 | Wrong Answer | def main():
S, K = map(int, input().split())
ans = 0
for X in range(K+1):
Y_min = max(0, S-X-K)
Y_max = min(K, S-X)
ans += max(0, Y_max - Y_min + 1)
print(ans)
if __name__ == "__main__":
main() |
p03835 | s728186652 | Wrong Answer | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
K, S = map(int, readline().split())
ans = 0
for X in range(0, K + 1):
for Y in range(0, K + 1):
Z = S - X - Y
if Z <= K:
ans += 1
print(ans) |
p03835 | s169512353 | Wrong Answer | k, s = map(int, input().split())
cnt = 0
for i in range(k+1):
for j in range(k+1):
c = s - (i + j)
if c >= 0 and s == i + j + c:
cnt += 1
print(cnt) |
p03835 | s565284157 | Wrong Answer | from sys import stdin
[K, S] = [int(x) for x in (stdin.readline().rstrip().split())]
# combination of given X, Y, Z, that satisfy
# 0<= X, Y, Z <= K
# 0<= S <=3K
# X+Y+Z = S
# 2<= K<=2500
count = 0
for i in range(K+1):
for j in range(K+1):
if i+j<=S:
count+=1
print(count)
|
p03835 | s442940477 | Wrong Answer | k ,s = map(int, input().split())
count = 0
for x in range(k+1):
for y in range(x,x+k+1):
for z in range(y,y+k+1):
print(x,y,z)
if x + y + z == s:
count += 1
print(count) |
p03835 | s351197127 | Wrong Answer | def f(K, S):
z = list(range(0,K+1))
answer = []
for i in z:
s_z = S - i
if K < s_z:
if (K + 1) > (s_z - K):
answer.append(K + 1 - (s_z - K))
else:
answer.append(s_z + 1)
return sum(answer) |
p03835 | s479169661 | Wrong Answer | k,s = map(int,input().split())
ans = 0
for x in range(1,k+1):
for y in range(1,k+1):
if s-x-y>=0 and s-x-y<=k:
ans += 1
print(ans) |
p03835 | s639348160 | Wrong Answer | K = 2
S = 2
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 | s133557629 | Wrong Answer | r,g=map(int,input().split())
X=0
for i in range(g+1):
for j in range(g+1):
k=g-i-j
if k>=0 and k<=g:
X+=1
print(X)
|
p03835 | s125389492 | Wrong Answer | K, S = map(int, input().split())
cnt = 0
for x in range(K):
for y in range(K):
z = S-x-y
if 0 <= z and z <= K:
cnt+=1
print(cnt) |
p03835 | s394612610 | Wrong Answer | k,s = map(int,input().split())
ans = 0
for x in range(k+1):
for y in range(k+1):
z = s -(x+y)
if 0 <= z <= k:
ans += 1
print(x,y,z)
print(ans) |
p03835 | s806077074 | Wrong Answer | k,s = map(int,input().split())
a = min(k,s)
ans = 0
for x in range(a+1):
for y in range(a+1):
if s - x - y >= 0:
ans+= 1
print(ans) |
p03835 | s009684546 | Wrong Answer | k, s = map(int, input().split())
ans = 0
for x in range(k+1):
for y in range(x+1, k+1):
z = s - x - y
l = {x, y, z}
if y < z <= k:
ans += 6
for x in range(k+1):
y = x
z = s - x - y
if z != x and z >= 0:
ans += 3
if s % 3 == 0:
ans += 1
print(ans) |
p03835 | s282297380 | Wrong Answer | K,S = map(int, input().split())
ans = 0
for X in range(K+1):
S1 = S - X
if S1 < 0:
break
else:
if S1 <= K:
ans += S1 + 1
elif S1 <= 2 * K:
ans += S1 - 2*K + 1
else:
continue
print(ans) |
p03835 | s170391210 | Wrong Answer | k,s = map(int,input().split())
count = 0
for i in range(k+1):
for j in range(k+1):
l = s-(i+j)
print(i,j,l)
if i+j+l == s and l >= 0 and l <= k and i <= k and j <= k:
#print("解：",i,j,l)
count += 1
print(count) |
p03835 | s937694821 | Wrong Answer | k, s = map(int, input().split())
i = 0
x = 0
for x in range(0,k+1):
for y in range(0,k+1):
if x <= k & y <= k & s-x-y <= k & x+y <= s: i += 1
# if x+y+z == s: i += 1
print(i) |
p03835 | s943018502 | Wrong Answer | k, s = map(int, input().split())
p = 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:
p+=1
if (x+y+z) >= s:
break
if (x+y+z) >= s:
break
print(p) |
p03835 | s044495804 | Wrong Answer | K, S = map(int, input().split())
count = 0
for x in range(K+1):
for y in range(1,K+1):
for z in range(1,K+1):
if x + y + z == S:
count = count + 1
print(count) |
p03835 | s016952134 | Wrong Answer |
k,s=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+k==s:
ans+=1
print(ans) |
p03835 | s868676402 | Wrong Answer | k, s = list(map(int, input().split()))
x = k - max(0,s-2*k) + 1
print(x*(x+1)//2) |
p03835 | s031939235 | Wrong Answer | k,s=map(int,input().split())
count=0
for x in range(k+1):
for y in range(k+1):
if s-x-y>=0:
count+=1
print(count) |
p03835 | s112072182 | Wrong Answer | k, s = map(int, input().split())
ans = 0
if s <= k:
ans = (s+2)*(s+1)/2
else:
for i in range(k+1):
for j in range(k+1):
ans = ans + (0 <= s-i-j <= k)
print(ans) |
p03835 | s617898842 | Wrong Answer | K, S = [int(i) for i in input().split()]
ans = 0
for i in range(K+1):
for j in range(i, K+1):
if S-i-j <= K:
ans += 1
print(ans)
|
p03835 | s363118035 | Wrong Answer | k,s = map(int, input().split())
l = 0
if s <= k:
l = int((k+2)*(k+1)/2)
else:
for x in range(0,k+1):
if s-x > 2*k:
l += 0
elif k < s-x <= 2*k:
l += 2*k - s + x + 1
elif s-x <= k:
l += s-x+1
print(l)
|
p03835 | s826170575 | Wrong Answer | [K, S] = list(map(int, input().split()))
count = 0
total = 0
flag = False
for X in range(K, -1, -1):
for Y in range(K, -1, -1):
Z = S - X - Y
if 0 <= Z and Z <= K:
count +=1
if K < Z:
flag = True
if flag:
break
print(count) |
p03835 | s417236358 | Wrong Answer | K,S=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 |
p03835 | s602353877 | Wrong Answer | k,s = map(int,input().split())
x = 0
for d in range(0,k+1):
for y in range(0,k+1):
z = s - d - y
if x+y+z == s and z<k+1 and z>=0:
x = x+1
print (x)
|
p03835 | s947560837 | Wrong Answer | k, s = [int(x) for x in input().split()]
cnt = 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:
cnt += 1
elif x == y or y == z:
cnt += 3
else:
cnt += 3
print(cnt)
|
p03835 | s862429969 | Wrong Answer | if __name__ == '__main__':
b, c = map(int, input().split())
num = b*3 -c
if num == 0:
num =1
else:
if num > b:
num = b*3
else:
num = b *3
print(num)
|
p03835 | s756327851 | Wrong Answer | k, s = map(int, input().split())
c = 0
for x in range(k+1):
for y in range(k+1):
if s-(x+y) <= k:
c += 1
print(c) |
p03835 | s187633538 | Wrong Answer | k,s = map(int,input().split())
cnt=0
for i in range(s+1):
for j in range(s+1):
if i+j<=s:
cnt+=1
print(cnt) |
p03835 | s097053754 | Wrong Answer | k, s = map(int, input().split())
pat = 0
for x in range(k+1):
for y in range(k+1):
if s >= x + y and k >= x + y :
pat += 1
print(pat) |
p03835 | s407926201 | Wrong Answer | #coding: utf-8
K,S=map(int,input().split(" "))
answer=0
for X in range(K+1):
for Y in range(K+1):
if S-(X+Y)<=K:
answer+=1
print(answer)
|
p03835 | s563890729 | Wrong Answer | K, S = [int(x) for x in input().split()]
ans = 0
for x in range(K+1):
for y in range(K+1):
a = S-x-y
if a <= K:
ans +=1
print(ans) |
p03835 | s073121162 | Wrong Answer | k,s = map(int,input().split())
count = 0
for l in range(k+1):
for m in range(k+1-l):
for n in range(k+1-l-m):
if l + m + n == s:
count += 1
print(count)
|
p03835 | s761747642 | Wrong Answer | K, S = map(int, input().split())
count = 0
for x in range(K + 1):
for y in range(K + 1):
if S - x - y <= K:
count += 1
print(count) |
p03835 | s176605853 | Wrong Answer | def actual(K, S):
my_range = lambda n: range(n + 1)
count = 0
for x in my_range(K):
for y in my_range(K):
z = S - (x + y)
if z >= 0:
count += 1
return count
K, S = map(int, input().split())
print(actual(K, S)) |
p03835 | s440680892 | Wrong Answer | # coding: utf-8
# Your code here!
k, s = map(int, input().split())
cnt = 0
for i in range(k+1):
for j in range(k+1):
if s-i-j <= k:
cnt += 1
print(cnt) |
p03835 | s143817370 | Wrong Answer | k, s = map(int,input().split())
ans = 0
for x in range(k+1):
for y in range(k+1):
if s-x-y <= k:
ans += 1
print(ans) |
p03835 | s691319819 | Wrong Answer | K,S= map(int, input().split())
number_lis = []
ans = 0
for i in range(0,K+1):
number_lis.append(i)
for j in number_lis:
for k in number_lis:
for l in number_lis:
if 0<= (S - (j + k)) <=K:
ans = ans + 1
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.