problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03835 | s229152142 | Wrong Answer | k, s = map(int, input().split())
r = range(0, k + 1)
cnt = 0
for x in r:
for y in r:
if x + y > s: continue
for z in r:
if x + y + z == r:
cnt += 1
print(cnt)
|
p03835 | s129362357 | Wrong Answer | K, S = map(int, input().split())
ans = 0
for x in range(K+1):
for y in range(K+1):
z = K - x - y
if 0 <= z <= K:
ans += 1
print(ans)
|
p03835 | s844793564 | Wrong Answer | k, s = map(int, input().split())
counter = 0
for x in range(k + 1):
if x >= s:
break
for y in range(x, k + 1):
z = s - x - y
if y >= s:
break
if y <= z <= k:
if x == y == z:
counter += 1
elif x == y or y == z:
counter += 3
else:
counter += 6
print(counter)
|
p03835 | s757978131 | Wrong Answer | K,N=map(int,input().split())
cnt=0
def souatari(K,N):
ans=0
if 2*K<N:
return 0
elif 2*K>=N and K<N:
return 2*K-N+1
elif K>=N:
return N+1
for i in range(K+1):
cnt+=souatari(K,N-i)
print(cnt)
1,9
2,8
3,7
4,6
5,5
2,9
3,8
4,7
5,6
0,10
1,9
2,8
3,7
4,6
5,5
|
p03835 | s504985971 | Wrong Answer | input_str = input().split()
k = int(input_str[0])
s = int(input_str[1])
count = 0
for x in range(k+1):
if x == s:
count += 1
else:
for y in range(k+1-x):
if x+y == s:
count += 1
else:
for z in range(k+1-x-y):
if x+y+z == s:
count += 1
print(count) |
p03835 | s677182918 | Wrong Answer | import itertools
ans = 0
k, s = map(int, input().split())
sa = [int(i) for i in range(k+1)]
tt = [int(i) for i in range(k+1)]
c = itertools.product(sa,repeat=2)
for i in c:
if i[0] + i[1] - s in tt:
ans+=1
print(ans) |
p03835 | s636812776 | Wrong Answer | a,b = list(map(int, input().split()))
ans = 0
for i in range(a):
for j in range(a):
for k in range(a):
if i+j+k==b:
ans += 1
print(ans) |
p03835 | s256621134 | Wrong Answer | #B - Sum of Three Integers
K,S = map(int,input().split())
#0<=S<=3K
res = 0
for X in range(0,K+1):
if X > S:
break
for Y in range(0,K+1):
if X + Y > S:
break
elif 0<=(X + Y - S) and (X + Y - S) <= K:
res += 1
print(res) |
p03835 | s169651538 | 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
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(z,o,t)
print(z*6 + o*3 + t) |
p03835 | s272656120 | 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*10-(S-K-3)*12)) |
p03835 | s889391162 | Wrong Answer | k,s=map(int,input().split())
count=0
for x in range(k+1):
for y in range(k+1-x):
z=s-x-y
if z>=0 and z<=k:
count+=1
print(count) |
p03835 | s462474433 | Wrong Answer | # -*- coding: utf-8 -*-
K, S = map(int, input().split())
count = 0
for x in range(0, K+1):
for y in range(0, K+1):
for z in range(0, K+1):
print(x, y, z)
if x + y + z == S:
count += 1
print(count)
|
p03835 | s712662441 | Wrong Answer | splited = input().split(" ")
k = int(splited[0])
s = int(splited[1])
z = [i for i in range(k+1)]
def check_sum(p):
l, r = 0, k
while(r - l >= 1):
i = int((r + l) / 2)
if z[i] == p:
return True
elif z[i] < p:
l = i + 1
else:
r = i
return False
result = 0
for x in range(k+1):
for y in range(k+1):
if check_sum(s-x-y):
result = result + 1
print(result)
|
p03835 | s555627446 | Wrong Answer | k, s = map(int, input().split())
l = set()
for i in range(k+1):
for j in range(k+1):
if i+j+k >= s:
l.add((i, j, s-k-j))
else:
continue
print(len(l)) |
p03835 | s117283635 | Wrong Answer | info = [int(i) for i in input().split(' ')]
K = info[0]
S = info[1]
count = 0
for x in range(K+1):
tmp = x
if tmp > S:
continue
for y in range(K+1):
tmp = x+y
if tmp > S:
continue
for z in range(K+1):
ans = x+y+z
if ans == S:
count += 1
print(count) |
p03835 | s146675594 | 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(k,-1,-1):
if s-i-j<=k:
c += 1
print(c) |
p03835 | s154563102 | Wrong Answer | k,s = map(int,input().split())
ans = 0
if s>3*k:
print(0)
elif s==3*k:
print(1)
elif s-k<=0:
for i in range(s+1,0,-1):
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 | s653802651 | Wrong Answer | n, s = map(int, input().split())
cnt=0
for i in range(n+1):
for j in range(n+1):
S = s-i-j
if S<=n:
cnt+=1
print(cnt) |
p03835 | s401663245 | 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 <= K and x + y + z == S:
cnt +=1
print(cnt) |
p03835 | s989063368 | Wrong Answer | K, S = map(int, input().split())
res = 0
for ed in range(min(S, K), -1, -1):
res += (S-ed+1)*(S-ed)//2 # Σ^n{k} = n*(n+1)/2
print(res) |
p03835 | s304661224 | Wrong Answer | k, s = map(int, input().split())
if s==3*k:
print(1)
else:
ans=0
for i in range(k+1):
if i>s:
break
for j in range(k+1):
if i+j+k>=s and s-i-j>=0:
ans+=1
else:
break
print(ans) |
p03835 | s536982528 | Wrong Answer | k, s = map(int, input().split())
count=0
for i in range(k+1):
if s-i-2*k >=0:
for j in range(k+1):
if s-i-j-k>=0:
for h in range(k+1):
if i+j+h ==s:
count+=1
print(count) |
p03835 | s724516175 | Wrong Answer | K,S = map(int,input().split())
num = 0
for i in range(K+1):
for j in range(K+1) :
k = S - i - j
if k <= K :
num += 1
print(num)
|
p03835 | s894481642 | Wrong Answer | k, s = map(int, input().split())
count = 0
for i in range(k+1):
rem = s - i
for j in range(rem+1):
y, z = j, rem-j
if y <= 5 and z <= 5:
if s == y+z+i:
count += 1
print(count)
|
p03835 | s531514872 | Wrong Answer | import bisect
k,s=map(int, input().split())
p=[]
for i in range(k+1):
p.append(i)
pp=[]
for i in p:
for j in p:
pp.append(i+j)
pp.sort()
ans=0
for x in pp:
if pp[bisect.bisect_right(pp,s-x)-1]==s-x:
ans+=1
print(ans) |
p03835 | s207293228 | Wrong Answer | import math
k, s = map(int, input().split())
res = 0
for x in range(k+1):
for y in range(k+1):
if x+y < s:
z = s - x - y
res += 1
print(res) |
p03835 | s849879810 | Wrong Answer | import sys
num = sys.stdin.readline().split(' ')
K = int(num[0])
S = int(num[1])
counter = 0
for i in range(K+1):
for j in range(K+1):
for k in range(S-i-j):
if i+j+k == S:
counter += 1
else:
continue
print(counter) |
p03835 | s580225843 | Wrong Answer | K, S = map(int, input().split())
X = []
Y = []
Z = []
count = 0
for i in range(0 ,K + 1):
for j in range(0 ,K + 1):
for k in range(0 ,K + 1):
X.append(i)
Y.append(i)
Z.append(i)
if S == X[i] + Y[j] + Z[k]:
count += 1
print(str(count)) |
p03835 | s781360022 | Wrong Answer |
import itertools
K,S = map(int, input().split())
X = list(range(K+1))
count=0
for x,y in list(itertools.product(X, X)):
if x+y >= S-K:
count+=1
print(count) |
p03835 | s124446932 | Wrong Answer | K, S = [int(n) for n in input().split(" ")]
cnt = 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:
cnt +=1
print(cnt) |
p03835 | s360030319 | Wrong Answer | k, s = 5, 15
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)
|
p03835 | s693823074 | Wrong Answer | K,S = map(int,input().split())
ans = 0
for x in range(S+1):
for y in range(S+1):
if x+y > S:
break
for z in range(S+1):
if x+y+z == S:
ans+=1
print(ans) |
p03835 | s959997933 | Wrong Answer | k,s=map(int,input().split())
x=[0]*k
for i in range(0,k):
x[i]=i
x.append(k)
a=int(s/3)-1
count=0
for i in range(0,len(x)):
stemp=s-x[i]
for j in range(0,min(k+1,stemp)):
if stemp-x[j] in x:
count=count+1
print(count)
|
p03835 | s359923797 | Wrong Answer | k,s=map(int,input().split())
p=0
for i in range(k+1):
for j in range(k+1):
if s- i - j <= k:
p += 1
print(p) |
p03835 | s674289221 | Wrong Answer | k,s=map(int,input().split())
ans=0
if s%3==0:
ans+=1
for i in range(k):
if 2*k<=s<3*k:
ans+=3
for i in range(k-1):
for j in range(i+1,k):
for k in range(j+1,k+1):
if i+j+k==s:
ans+=6
print(ans) |
p03835 | s609942364 | Wrong Answer | k,s= map(int,input().split())
cnt=0
for x in range(s+1):
for y in range(s+1):
if 0 <= s-x-y <= k:
cnt+=1
print(cnt)
|
p03835 | s598930654 | Wrong Answer | k, s =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(i,j,s-i-j)
print(cnt) |
p03835 | s898120172 | Wrong Answer | K,S = map(int,input().split())
res = 0
for a in range(K):
for b in range(K):
for c in range(K):
if a+b+c == S:
res += 1
break
break
print(res)
|
p03835 | s165466672 | Wrong Answer | def main():
K,S = map(int,input().split())
ans = 0
ListK = [i for i in range(K)]
for x in ListK:
for y in ListK:
for z in ListK:
if x + y + z == S:
ans += 1
print(ans)
if __name__ == '__main__':
main() |
p03835 | s447587337 | Wrong Answer | input_str = input().split()
k = int(input_str[0])
s = int(input_str[1])
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 | s936429207 | Wrong Answer | K,S=map(int,input().split())
# if S%3==0:
# x=int(S/3)
# elif S%2==0:
# x=int(S/2)
# else:
# x=int(S)
ans=0
for i in range(0,K+1):
for j in range(0,K+1):
for k in range(0,K+1):
print(i,j,k)
if i+j+k==S:
ans+=1
print(ans)
|
p03835 | s935040995 | Wrong Answer | K, S = map(int, input().split())
cnt = 0
for x in range(K+1):
for y in range(K+1):
if 0 <= S - x - y and 0 - x - y <= K:
cnt += 1
print(cnt) |
p03835 | s131867040 | Wrong Answer | K, S = map(int, input().split())
count = 0
for x in range(1,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 | s551871163 | Wrong Answer | K, S = map(int, input().split())
res = 0
for ed in range(min(S, K), -1, -1):
res += (S-ed)*(S-ed-1)//2 # Σ^n{k} = n*(n+1)/2
print(res) |
p03835 | s348517889 | 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 and z<=k:
ans += 1
print(ans) |
p03835 | s615400753 | Wrong Answer | if __name__ == '__main__':
b, c = map(int, input().split())
num = b*3 -c
if num == 0 or c ==0:
num =1
else:
if num > b:
num = b*3
else:
num = c*3
print(num)
|
p03835 | s168901293 | Wrong Answer | K, S = 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(i, j, S-(i+j))
|
p03835 | s799128807 | Wrong Answer | K,S=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):
com=X+Y+Z
if(com==S):
count+=1
else:
pass
print(count) |
p03835 | s944416719 | Wrong Answer | k,s = 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
elif s - i - j > k: break
print(ans) |
p03835 | s995943175 | Wrong Answer | 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 | s544648125 | Wrong Answer | #!/usr/bin/env python
# -*- coding: utf-8 -*-
(K, S) = 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:
r += 1
print(r)
|
p03835 | s028696803 | Wrong Answer | k,s = map(int,input().split())
start = s//3
ans = 0
if s < k:
k = s
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 | s118248653 | Wrong Answer | k,s= map(int,input().split())
ans=0
for i in range(k):
for j in range(k):
z=s-i-j
if 0<=z<=k:
ans+=1
print(ans)
|
p03835 | s496094076 | Wrong Answer | K, S = 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)])
|
p03835 | s019513815 | Wrong Answer | import itertools
s,k = map(int,input().split())
permutations_lis = list(itertools.product(range(k),repeat=3))
cnt = 0
for i in permutations_lis:
if i[0] + i[1] + i[2] == s:
cnt += 1
print(cnt) |
p03835 | s634821781 | Wrong Answer | K, S = map(int, input().split())
ans = 0
for X in range(K+1):
for Y in range(K+1):
Z = K -(X + Y)
if 0 <= Z <= K:
ans += 1
print(ans) |
p03835 | s962322034 | Wrong Answer | k, s = 2,2
ans = 0
for x in range(k+1):
for y in range(k+1):
if s-x-y >= 0:
if x+y+(s-x-y) == s:
ans += 1
print(ans)
|
p03835 | s590278465 | Wrong Answer | k, s = map(int, input().split())
ans = 0
for x in range(k):
for y in range(k):
for z in range(k):
if s == x+y+z:
ans += 1
print(ans) |
p03835 | s146574425 | Wrong Answer | k, s = map(int, input().split())
ans = 0
for x in range(k+1)[::-1]:
y = min(s-x, k)
z = s-x-y
if z > k:
break
ans += y - z + 1
print(ans) |
p03835 | s235499566 | Wrong Answer | # coding: utf-8
x=input().split(" ")
k=int(x[0])
s=int(x[1])
sum=0
for i in range(k+1):
if s-i<=k*2 and s-i>=k:
sum+=k*2-s+i+1
elif s-i<k:
sum+=s-i+1
print(sum) |
p03835 | s092348535 | 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 x in range(a+1):
if sums-x <2*a:
for y in range(a+1):
if sums-x-y<a:
if (sums-x-y == x) | (sums-x-y == y):
ret+=1
else:
ret+=2
if sums-x == 2*a:
ret+=1
print(ret-mai) |
p03835 | s528049506 | Wrong Answer | K,S=map(int,input().split())
ans=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==0 and Y==0:
ans=ans+3
elif X==0:
ans=ans+3
else:
ans=ans+1
print(ans) |
p03835 | s763815200 | Wrong Answer | k, s = map(int, input().split())
c = int(s / 3)
ans = (k - c)
if ans == 0:
print(1)
else:
print(ans*3) |
p03835 | s009393966 | 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 | s048823331 | Wrong Answer | K,S=map(int,input().split())
ans=0
t=S//3
for x in range(K+1):
if 0<=S-x and S-x<=2*K:
ans+=1
print(ans*(ans+1)//2) |
p03835 | s524554128 | Wrong Answer | 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 | s740042051 | Wrong Answer | K, S = 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 | s472213576 | Wrong Answer | K,S=map(int,input().split())
ans=1
a=max(0,S-2*K)
for i in range(a,K+1):
if i>S:
break
for j in range(a,K+1):
if i+j>S :
break
if S-i+j<=K :
ans+=1
print(ans) |
p03835 | s562200411 | 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 S == x+y+z:
count += 1
print(count)
|
p03835 | s063284388 | Wrong Answer | K, S = map(int,input().split())
ans_ls = [0 for _ in range(K*3+1)]
for n in range(K+1):
if n <= K:
ans_ls[n] = (n+1)*(n+2)//2
ans_ls[-1*n-1] = (n+1)*(n+2)//2
sum_ans = sum(ans_ls)
if K%2 == 0:
ans_ls[(K//2)*3] = (K+1)**3-sum_ans
else:
ans_ls[(K*3//2)] = ((K+1)**3-sum_ans)//2
ans_ls[(K*3//2)+1] = ((K+1)**3-sum_ans)//2
print(ans_ls[S])
|
p03835 | s223252106 | Wrong Answer | k,s = map(int,input().split())
ans = 0
for i in range(k+1):
for j in range(k+1):
if (s-(i+j)) <= k:
ans += 1
print(ans) |
p03835 | s178023851 | 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
else:
ans += max(2*K-T+1,0)
print(ans)
|
p03835 | s071568504 | 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):
for z in range(0,k+1-x-y):
p = x+y+z
if x+y+z == s: i += 1
print(i) |
p03835 | s765462320 | Wrong Answer | def LI():
return list(map(int, input().split()))
K, S = LI()
ans = 0
for i in range(K+1):
total = S-i
kosu = total+1
if total > 2*K:
continue
if total > K:
kosu -= (total-K)*2
ans += kosu
else:
ans += kosu
print(ans)
|
p03835 | s463433123 | Wrong Answer | k,s=map(int,input().split())
res=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:
res+=1
print(res) |
p03835 | s559907200 | Wrong Answer | K,S=map(int,input().split())
ans=0
#a=max(0,S-2*K)
for i in range(K+1):
if i>S:
break
for j in range(K+1):
if S-i+j<=K :
ans+=1
print(ans) |
p03835 | s331708320 | 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(ans) |
p03835 | s302133397 | Wrong Answer | k,s=map(int,input().split())
count=0
if k*3==s:
print(1)
exit()
for x in range(k+1):
for y in range(k+1-x):
z=s-x-y
if z>=0 and z<=k:
count+=1
print(count) |
p03835 | s817064105 | Wrong Answer | 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:
continue
count+=1
print(count) |
p03835 | s898207115 | Wrong Answer | # coding: utf-8
# Your code here!
import itertools
k, s = map(int, input().split())
lst = [i for i in range(k+1)]
prod = itertools.product(lst, repeat=3)
ans = 0
print(ans)
|
p03835 | s571950928 | Wrong Answer | input = list(map(int,input().split()))
ans_count = 0
for i in range(0, input[0]):
for j in range(0, input[0]):
for k in range(0, input[0]):
if (i + j + k == input[1]):
ans_count+=1
print(ans_count) |
p03835 | s076861160 | 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):
print(x,y,z,x+y+z,S)
if x + y + z == S:
count = count + 1
print(count) |
p03835 | s727556499 | Wrong Answer | K, S = map(int, input().split())
cnt = 0
for i in range(K+1):
flg = False
for j in range(K+1):
if flg == True:
break
for k in range(K+1):
ijk_sum = i + j + k
if ijk_sum == S:
flg = True
cnt += (K+1 - j)
break
print(cnt) |
p03835 | s489806881 | Wrong Answer | K,S = map(int, input().split())
if K == S:
print( (K+5)*(K+4)//2 )
exit()
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 | s020850519 | Wrong Answer | k, s = map(int, input().split(" "))
answer = 0
for i in range(k + 1):
for j in range(k + 1):
rem = 3 * k - i - j
if 0 <= rem <= k:
answer += 1
print(answer)
|
p03835 | s010109055 | Wrong Answer | K,S=map(int,input().split())
ans=0
for i in range(K+1):
for j in range(K+1):
if (i+j)>S:
break
if (S-K)<=(i+j):
break
ans+=1
print(ans) |
p03835 | s054135041 | Wrong Answer | k, s = map(int, input().split())
cnt = 0
for i in range(k):
for j in range(k):
z = s - i - j
if 0 <= z <= k:
cnt += 1
print(cnt) |
p03835 | s160726791 | Wrong Answer | if __name__ == '__main__':
b, c = map(int, input().split())
num = b*3 -c
if num == 0 or c ==0:
num =1
else:
if num > b:
num = b*3
else:
num = num*3
print(num)
|
p03835 | s803926922 | 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 0<=z<=k and x+y+z==s:
ans += 1
print(ans) |
p03835 | s265092003 | 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 | s336606588 | Wrong Answer | K,S=map(int,input().split())
ANS=0
for i in range(K+1):
if i > S:
break
for j in range(K+1-i):
zz = i + j
if zz > S:
break
for k in range(K+1-zz):
z = i + j + k
if z == S:
#print(i,j,k)
ANS+=1
elif z >= S:
break
print(ANS) |
p03835 | s827032144 | Wrong Answer | k, s = list(map(int, input().split()))
count = 0
for p in range(k+1):
if p > s:
break
for q in range(k+1):
if p + q < s:
break
for r in range(k+1):
t = p + q + r
if t == s:
count += 1
break
print(count) |
p03835 | s902887420 | Wrong Answer | k,s = map(int,input().split())
ans = 0
for i in range(k):
for j in range(k):
if 0 <= s - i - j <= k: ans += 1
#elif s - i - j > k: break
print(ans) |
p03835 | s859610472 | Wrong Answer | K,S=map(int,input().split())
count=0
for A in range(2*K+1):
for Z in range(K+1):
if A+Z==S:
count+=1
print(count*2) |
p03835 | s893364134 | 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 S - (i + j) <= K:
r += 1
print(r) |
p03835 | s250214547 | Wrong Answer | import sys
in1 = sys.stdin.readlines()
#in1 = ['5 15']
K, S = map(int, in1[0].split())
RC = 0
for idx1 in range(K + 1):
for idx2 in range(K + 1):
if S - idx1 - idx2 <= K:
RC += 1
print(RC)
|
p03835 | s168066382 | 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 | s157126751 | Wrong Answer | K, S = 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) |
p03835 | s198190447 | Wrong Answer | x,y = list(map(int, input().split()))
count=0
for i in range(x+1):
for j in range(x+1):
k=y-i-j
if k<x and k>0:
count+=1
print(count) |
p03835 | s148487068 | Wrong Answer | K,S = map(int, input().split())
count = 0
for i in range(K):
for j in range(K-i):
for k in range(K-i-j):
if i + j + k == S:
count += 1
print(count) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.