problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03835 | s701935698 | Wrong Answer | K,S=map(int,input().split())
N=0
for X in range(K+1):
for Y in range(K+1):
if X+Y<=S:
N+=1
print(N) |
p03835 | s514242382 | Wrong Answer | (k, s) = list(map(int, input().split()))
count = 0
kmin = int(s / 3)
for x in range(kmin, k + 1):
for y in range(kmin, k + 1):
for z in range(kmin, k + 1):
if s == x + y + z:
count += 1
print(count) |
p03835 | s619685013 | 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:
break
else:
ans +=1
print(ans) |
p03835 | s048578174 | Wrong Answer | k, s = map(int, input().split())
ans = 0
for i in range(k + 1):
rest = s - i
if rest < 0:
break
elif rest > 2 * k:
continue
else:
for j in range(k + 1):
rest2 = rest - j
if rest2 < 0:
break
elif rest2 > k:
continue
else:
ans += k - rest2 + 1
break
print(ans) |
p03835 | s876354917 | Wrong Answer | K, S = map(int, input().split())
c = 0
for x in range(K):
for y in range(S - x):
z = S - x - y
if 0 <= z <= K:
c += 1
print(c) |
p03835 | s627473781 | Wrong Answer | k,s=map(int,input().split())
count=0
for x in range(k+1):
for y in range(k+1-x):
if s-x-y>=0:
count+=1
print(count) |
p03835 | s761244312 | Wrong Answer | K,S=map(int,input().split())
ans=0
c=0
if S%3==0:
c=S//3
for x in range(K+1):
if 0<=S-x and S-x<=2*K:
ans+=1
print(ans*(ans+1)//2-2*c) |
p03835 | s781562181 | Wrong Answer | k,s = list(map(int,input().split()))
ans = 0
for i in range(k):
for j in range(k):
if 0 <= s-i-j <= k:
ans += 1
print(ans)
|
p03835 | s891449079 | Wrong Answer | K,S=map(int,input().split())
r=K+1
count=0
for x in range(r):
if x>S:
break
for y in range(r):
if y>S:
break
z=S-x-y
if 0<=z and z<=r:
count+=1
print(count) |
p03835 | s348058199 | 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-x):
if x <= k & y <= k & s-x-y <= k & x+y <= s: i += 1
# if x+y+z == s: i += 1
print(i) |
p03835 | s367547102 | Wrong Answer | K, S = map(int, input().split())
count=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
if i+j+K == S:
count +=1
print(count)
|
p03835 | s651026166 | Wrong Answer | K,S = map(int,input().split())
res = 0
for x in range(K+1):
for y in range(K+1):
if S-x-y >= 0:
res+=1
print(res) |
p03835 | s897172696 | Wrong Answer | k, s = map(int, input().split())
count = 0
for i in range(k + 1):
for j in range(i, k + 1):
for l in range(j, k + 1):
x = i
y = j
z = l
if i + j + l == s:
count += 1
count *= 3
if s % 3 == 0:
count = 1
else:
count = count
print(count)
|
p03835 | s979503769 | Wrong Answer | k,s = map(int,input().split())
count = 0
for x in range(k+1):
for y in range(k+1-x):
if 0<=s-x-y<=k:
count+=1
print(count) |
p03835 | s546403441 | Wrong Answer | k, s = [int(i) for i in input().split()]
ans = 0
for i in range(k+1):
for j in range(k+1):
if s-i-j >= 0:
ans += 1
print(ans) |
p03835 | s269754018 | Wrong Answer | [K, S] = list(map(int, input().split()))
count = 0
total = 0
for X in range(K+1):
if X > S:
break
for Y in range(K+1):
add_xy = X + Y
if S < add_xy and add_xy < (2/3) * S:
break
Z = S - X - Y
if 0 <= Z and Z <= K:
count +=1
if S < add_xy:
break
print(count) |
p03835 | s887554942 | Wrong Answer | K, S = map(int, input().split())
c = 0
for x in range(K):
if x > S:
continue
for y in range(S - x):
z = S - x - y
if 0 <= z <= K:
c += 1
print(c) |
p03835 | s197684776 | Wrong Answer | k,s = map(int,input().split())
count = 0
for x in range(k+1):
for y in range(k+1):
z = s-(x+y)
if z>=0 and z<k:
count += 1
print(count) |
p03835 | s317894601 | Wrong Answer | K,S=map(int,input().split())
if S==0:
print("1")
elif K>=S:
print(int(((S+1)*(S+2))/2))
else: #K<S(S>0)
if (S-K)<5:
print(int((((S+1)*(S+2))/2)-3*(((S-K-1)*(S-K))/2)))
else:
print(int((((S+1)*(S+2))/2)-3*(((5-1)*5)/2)-(S-K-5)*4)) |
p03835 | s702399110 | Wrong Answer | K, S = map(int, input().split())
Y = 0
for i in range(K+1):
for j in range(K+1):
if S-i-j <= K:
Y = Y+1
print(Y) |
p03835 | s475265159 | Wrong Answer | k,s = map(int,input().split())
count = 0
for x in range(k+1):
for y in range(k+1):
z = s - x - y
if k >= z and x + y + z == s:
count += 1
print(count) |
p03835 | s793838982 | Wrong Answer | k,s = map(int,input().split())
f = 0
for i in range(k):
for j in range(k):
for l in range(k):
if i+j+l==s:
f+=1
print(f) |
p03835 | s187693288 | Wrong Answer | k,s=map(int,input().split())
ans=0
for i in range(k+1):
for j in range(k+1-i):
if s-i-j<=k:
ans+=1
print(ans) |
p03835 | s942920050 | Wrong Answer | N,K=map(int,input().split())
count=0
for i in range (K+1):
for j in range (K+1):
k=N-i-j
if k>=0 and k<=K:
count+=1
print(count) |
p03835 | s803812087 | 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+1):
res += 1
print(res) |
p03835 | s696943807 | Wrong Answer | k, s = map(int, input().split())
count = 0
for a in range(k+1):
for b in range(k+1):
if a + b <= s:
count += 1
else:
pass
print(count) |
p03835 | s453141185 | Wrong Answer | K, S = map(int,input().split())
ans = 0
for X in range(0,K+1):
T = S-X
if T <= 2*K:
if K <= T:
ans += K-(T-K)+1
else:
ans += T+1
print(ans)
|
p03835 | s006124487 | Wrong Answer | K, S = list(map(int, input().split()))
ct = 0
for a in range(K+1):
for b in range(K+1):
if 0 <= a+b <= min(S,3*K-S):
ct += 1
print(ct) |
p03835 | s684772119 | Wrong Answer | k, s = map(int, input().split())
res = 0
for x in range(k):
for y in range(k):
for z in range(k):
if (x + y + z) == s:
res += 1
print(res) |
p03835 | s566381821 | 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):
for Z in range(S//3,K + 1):
if X + Y + Z == S:
ans += 1
print(ans) |
p03835 | s028737799 | Wrong Answer | k, s = map(int, input().split())
cnt = 0
for x in range(max(s - 2 * k, 0), k + 1):
for y in range(s - x - k, min(s - x + 1, k + 1)):
z = s - x - y
if 0 <= z <= k:
cnt += 1
else:
continue
print(cnt)
|
p03835 | s979785209 | Wrong Answer | K, S = map(int, input().split())
Sum = 0
for i in range((S // 3), K + 1):
for j in range(i + 1):
if 0 <= S - i - j <= K:
if i == j:
Sum += 1
else:
Sum += 2
print(Sum)
|
p03835 | s367240113 | Wrong Answer | import sys
input = sys.stdin.readline
k, s = map(int, input().split())
cnt = 0
max_v = max(2 * (k + 2), s + 1)
memo = [0] * max_v
for i in range(k + 1):
for j in range(k + 1):
v = i + j
if v > s:
break
memo[v] += 1
for i in range(k + 1):
for j in range(max_v):
v = i + j
if v > s:
break
elif v == s:
cnt += memo[j]
|
p03835 | s037655847 | Wrong Answer | K,S = map(int,input().split())
ans = 0
for x in range(S+1):
for y in range(S+1):
for z in range(S+1):
if x+y+z == S:
ans+=1
print(ans) |
p03835 | s293937728 | Wrong Answer | K, S = map(int, input().split())
count = 0
for i in range(K+1):
for j in range(K+1):
if i + j <= S:
count += 1
print(count) |
p03835 | s279552714 | Wrong Answer | k,s = map(int,input().split())
ans = 0
for x in range(k+1):
for y in range(x, k+1):
z = s - x - y
if z>=y and z<=k:
tmp = set([x,y,z])
if len(tmp)==3:
ans += 6
if len(tmp)==2:
ans += 3
else:
ans += 1
print(ans) |
p03835 | s940470568 | 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 | s571342269 | Wrong Answer | a,b=list(map(int,input().split()))
count=0
for x in range(a+1):
for y in range(a+1):
if b < x+y:
break
if b-x-y <= z:
count+=1
print(count)
|
p03835 | s515004631 | Wrong Answer | a,b = list(map(int, input().split()))
ans = 0
if 3*a < b:
print(ans)
else:
for i in range(a+1):
if i+2*a > b and i < b:
for j in range(a+1):
if i+j+a > b:
for k in range(a+1):
if i+j+k == b:
ans += 1
print(ans)
|
p03835 | s419309463 | Wrong Answer | s,k=map(int,input().split())
print([x+y+z for x in range(0,k+1) for y in range(0,k+1) for z in range(0,k+1)].count(s)) |
p03835 | s603739767 | Wrong Answer | K, S = map(int, input().split())
count = 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:
count = count + 1
print(count * 3)
|
p03835 | s846322587 | Wrong Answer | K, S = map(int, input().split())
ans=0
for i in range(K+1):
for j in range(K+1):
if not S-i-j>K:
ans+=1
print(ans) |
p03835 | s437533849 | Wrong Answer | k,s=map(int,input().split())
count=0
if s%3==0:
count+=1
for i in range(0,s//2+1):
if 0<=s-2*i<=k and i<=k and s-2*i!=i:
count+=3
print(count)
for i in range(0,k-1):
for j in range(i+1,k):
if k>=s-i-j>j:
count+=6
print(count) |
p03835 | s978641852 | Wrong Answer | k,s = map(int,input().split())
a = 0
for x in range(k+1):
for y in range(x+1,k+1):
for z in range(y+1,k+1):
if x+y+z == s:
if x != y and y != z and z != x:
a += 6
elif (x == y and y != z) or (x == z and z != y) or (z == y and y!= x):
a += 3
else:
a += 1
print(a)
|
p03835 | s529721471 | 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 0 <= S-i-j <= K:
ans += 1
print(ans)
|
p03835 | s749307893 | Wrong Answer | k, s = map(int, input().split())
ans = 0
s3 = s // 3
m = max(k, s3)
for x in range(0, m + 1):
print(x)
for y in range(0, m + 1):
ad = s - x - y
if ad <= k and ad >= 0:
ans += 1
print(ans) |
p03835 | s718485139 | Wrong Answer | n,m = map(int,input().split())
cnt = 0
for i in range(n+1):
for j in range(n+1):
if m-i+j <= n:
cnt += 1
print(cnt) |
p03835 | s391445767 | Wrong Answer | K,S=map(int,input().split())
ans = 0
z = 0
for x in range(K):
for y in range(K):
z = S - x - y
if z >= 0 and z <= K:
ans += 1
print(ans) |
p03835 | s829151646 | Wrong Answer | a,b=input().split()
a=int(a)
b=int(b)
c=0
for i in range(b+1):
for k in range(b+1):
if a<=i+k<=a+b:
c=c+1
print(c) |
p03835 | s169929706 | Wrong Answer | s,t=map(int,input().split())
ans=0
for i in range(1,s+1,1):
for j in range(1,s+1,1):
if not s<t-i-j:
ans+=1
print(ans) |
p03835 | s921339463 | 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 z>=0 and z<=2500:
cnt+=1
print(cnt) |
p03835 | s987086059 | 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 ((x + y + (s-x-y)) == s) and (s-x-y >= 0):
ans+=1
print(ans)
|
p03835 | s833012033 | Wrong Answer | k, s = map(int, input().split())
ans = 0
for i in range(k+1):
for j in range(k+1):
z = s - i + j
if 0<= z <= k:
ans += 1
print(ans)
|
p03835 | s422107042 | Wrong Answer | K,S = map(int,input().split())
ii = 0
for i in range(K+1):
for j in range(K+1):
k = S-i-j
if k <= K:
ii+=1
print(ii) |
p03835 | s121656936 | 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 0<=z<=k:
print(x,y,z)
cnt=cnt+1
else:
continue
print(cnt) |
p03835 | s257174207 | Wrong Answer | s,k=map(int,input().split())
print(len([1 for x in range(0,k+1) for y in range(0,k+1) if 0<=s-x-y<=k])) |
p03835 | s720423623 | Wrong Answer | #91 B - Sum of Three Integers
K,S = map(int,input().split())
cnt = 0
for x in range(K+1):
for y in range(K+1):
z = S - (x + y)
print(x,y,z)
if K >= z >= 0:
cnt += 1
print(cnt) |
p03835 | s655398472 | Wrong Answer | K, S = 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)
|
p03835 | s168996424 | Wrong Answer | K,S = map(int,input().split())
count = 0
for i in range(K):
for j in range(K):
for l in range(K):
if i+j+l == S:
count += 1
print(count) |
p03835 | s040741350 | Wrong Answer | a,b = map(int,input().split())
ans = 0
for x in range(b+1):
for y in range(b+1):
z = b-x-y
if z <= a and z >= 0:
ans +=1
else:
continue
print(ans)
|
p03835 | s273293962 | Wrong Answer | k, s = map(int, input().split())
ans = 0
for x in range(k+1):
for y in range(k+1):
for z in range(s-x-y):
if x+y+z==s:
ans += 1
print(ans) |
p03835 | s459856491 | Wrong Answer | K, S = map(int, input().split())
res = 0
for x in range(K+1):
m = S-x
if (m == 0 or m == 2*K):
res += 1
elif (m > 0 and m < 2*K):
res += m + 1
print(res) |
p03835 | s436857379 | Wrong Answer | #import
#import math
#import numpy as np
#= int(input())
#= input()
K, S = map(int, input().split())
#= list(map(int, input().split()))
#= [input(), input()]
#= [list(map(int, input().split())) for _ in range(N)]
#= {i:[] for i in range(N)}
r = 0
for i in range(K + 1):
for j in range(K + 1):
if i + j <= S:
r += 1
print(r) |
p03835 | s271883426 | Wrong Answer | k,s = map(int,input().split())
f = 0
for i in range(k):
for j in range(k):
for l in range(k):
if i+j+l==s:
f+=1
print(f) |
p03835 | s522880036 | 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 | s223728327 | Wrong Answer | # coding: utf-8
# Your code here!
ans = 0
print(ans)
|
p03835 | s745754381 | Wrong Answer | K, S = map(int, input().split())
x = S if K>S else K
print(3+sum(range(3,3+(x-1))))
|
p03835 | s386959123 | 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 | s140029388 | Wrong Answer | k, s = map(int, input().split())
count = 0
for i in range(k+1):
for l in range(k+1):
z = s - i - l
if z <= k:
count += 1
print(count)
|
p03835 | s857442511 | 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 += 1
print(ans)
|
p03835 | s346702638 | Wrong Answer | K,S = map(int,input().split())
if S == 0:
print(1)
exit()
z = 0
o = 0
t = 0
for i in reversed(range(K+1)):
if i < (S-1)//3 + 1:
break
else:
num = min(S-i,i)-(S-i+1)//2 + 1
z += num
if (S-i) % 2 == 0:
z -= 1
o += 1
if num > 1 and min(S-i,i) == i:
z -= 1
o += 1
if S % 3 == 0:
t += 1
o -= 1
print(z*6 + o*3 + t) |
p03835 | s495625549 | Wrong Answer | K, S = map(int, input().split())
count = 0
for x in range(K+1):
for y in range(K+1):
z = S - (x + y)
if z >= 0:
count += 1
print(count) |
p03835 | s569624337 | Wrong Answer | K, S = map(int, input().split())
count = 0
for x in range(K+1):
if S-x<=2*K:
for y in range(K+1):
if S-x-y<=K:
count += 1
# for z in range(K+1):
# if x+y+z==S:
# count += 1
print(count) |
p03835 | s063419446 | Wrong Answer | K,S = map(int, input().split())
count = 0
for i in range(K):
for j in range(K):
for k in range(K):
if i + j + k == S:
count += 1
print(count)
|
p03835 | s064090324 | 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
ans += (z and z <= k)
print(ans) |
p03835 | s837904778 | Wrong Answer | K, S = map(int, input().split())
pattern = 0
for i in range (0,K+1):
for j in range (0,K+1):
if S - (i) - j >= 0:
pattern += 1
print(pattern) |
p03835 | s022518808 | Wrong Answer | x,y = list(map(int, input().split()))
count=0
for i in range(1,x+1):
for j in range(1,x+1):
for k in range(1,x+1):
a=i+j+k
if y==a:
count+=1
print(count) |
p03835 | s837574675 | Wrong Answer | k,s = map(int,input().split())
ans = 0
if s>3*k:
print(0)
elif s-k<=0:
for i in range(s+1,0,-1):
print(i)
ans += i
else:
for i in range(k+1):
for j in range(k+1):
if s-k<=i+j<=s:
ans += 1
print(ans) |
p03835 | s951267953 | Wrong Answer | K,S = (int(x) for x in 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):
#print(x,y,z)
if x + y + z == S:
count += 1
print(x,y,z)
print(count) |
p03835 | s768659652 | Wrong Answer | k, s = map(int, input().split())
ans = 0
s3 = s // 3
m = min(k, s3)
for x in range(m, 0, -1):
print(x)
for y in range(m, 0, -1):
for z in range(s - x - y, 0, -1):
xyz = x + y + z
if x + y + z == s:
ans += 1
elif xyz < s:
break
print(ans) |
p03835 | s544959718 | Wrong Answer | k,s=map(int,input().split())
ans=0
for i in range(k+1):
for j in range(k+1-i):
if 0<=s-(i+j) and s-(i+j)<=k:
ans+=1
print(ans) |
p03835 | s811418833 | Wrong Answer | ans = 0
k,s = map(int, input().split())
for x in range(k+1):
for y in range(k+1):
if s - (x+y) <= k:
ans += 1
print(ans) |
p03835 | s703468211 | Wrong Answer | K,S=map(int,input().split())
ans = 0
for i in range(K):
for j in range(K):
for k in range(K):
if i + j + k == S:
ans += 1
print(ans) |
p03835 | s893110598 | 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 and z > 0:
ans += 1
print(ans)
|
p03835 | s463116048 | Wrong Answer | def main():
k, s = list(map(int, input().split()))
if k*3 == s:
print(1)
exit()
else:
print(k*3)
if __name__ == '__main__':
main()
|
p03835 | s558913823 | 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 | s289106364 | Wrong Answer | K, S = map(int, input().split())
res = 0
for x in range(K+1):
m = S-x
if m == 0:
res += 1
if (m > 0 and m < 2*K):
res += m + 1
if m == 2*K:
res += 1
print(res) |
p03835 | s746704317 | Wrong Answer | K,S = map(int,input().split())
alist = [i+j+h==S for i in range(0,K+1) for j in range(0,K+1) for h in range(0,K+1)]
print(len(alist)) |
p03835 | s266781817 | 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
print(ans)
if __name__ == '__main__':
main() |
p03835 | s190008294 | Wrong Answer | k,s=map(int,input().split())
ans=0
for i in range(2,k+1):
for j in range(2,k+1):
if s-(i+j) in range(2,k+1):
ans+=1
print(ans) |
p03835 | s467194537 | Wrong Answer | k,s = map(int,input().split())
count = 0
for x in range(k):
for y in range(k):
z = s - x - y
if k > z and x + y + z == s:
count += 1
print(count)
|
p03835 | s476533207 | Wrong Answer | k, s = 5, 15
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)
|
p03835 | s778379865 | Wrong Answer | k, s = list(map(int, input().split()))
count = 0
for p in range(k+1):
for q in range(min(k+1, s-p+1)):
for r in range(min(k+1, s-p-q+1)):
print(p, q, r)
t = p + q + r
if t == s:
count += 1
break
print(count)
|
p03835 | s000939290 | Wrong Answer | K,S=map(int,input().split())
count=0
for i in range(K+1):
for j in range(K+1):
if((S-i-j)<=K+1 and 0<=S-i-j):
count=count+1
print(count)
|
p03835 | s165537314 | Wrong Answer | import math
k,s = map(int, input().split())
#n, x = map(int, input().split())
#h = list(map(int, input().split()))
#s = list(str(input()))
counter = 0
for i in range(k+1):
for ii in range(k+1):
for iii in range(k+1):
if (s == i+ii+iii):
counter = counter + 1
print(i, ii, iii)
print(counter) |
p03835 | s447258294 | Wrong Answer | K,S = map(int,input().split())
z = 0
o = 0
t = 0
for i in reversed(range(K+1)):
if i < (S-1)//3 + 1:
break
else:
num = min(S-i,i)-(S-i+1)//2 + 1
z += num
#print(num)
if S-i % 2 == 0:
z -= 1
o += 1
if min(S-i,i) == i:
z -= 1
o += 1
if S % 3 == 0:
t += 1
o -= 1
#print(o,z,t)
print(z*6 + o*3 + t) |
p03835 | s456353269 | Wrong Answer | s,t=map(int,input().split())
ans=0
for i in range(s):
for j in range(s):
for k in range(s):
if i+j+k==t+3:
ans+=1
print(ans) |
p03835 | s148480166 | Wrong Answer | Max, Sum = map(int, input().split())
counter = 0
for i in range(Max+1):
for j in range(Max+1):
if Max -i -j >= 0:
k = Max -i -j
if i + j + k == Sum:
counter += 1
print(counter) |
p03835 | s672950389 | Wrong Answer | k,s=map(int,input().split())
count=0
for x in range(k+1):
for y in range(k+1):
if x+y>=s-k:
count +=1
print(count) |
p03835 | s552356982 | Wrong Answer | from sys import stdin
def LI(): return list(map(int,stdin.readline().rstrip().split()))
tmp = LI()
k,s = [tmp.pop(0) for i in range(2)]
c=0
for i in range(k,-1,-1):
if i<=s:
for j in range(i,-1,-1):
if s-i-j<=k:
c += 1
print(c) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.