problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03471 | s079784098 | Wrong Answer | n,y=map(int,input().split())
if y>10000*n:
print("-1 -1 -1")
else:
for i in range(n+1):
print(i)
for j in range(n-i+1):
if y==10000*i+5000*j+(n-i-j)*1000:
print(i,j,(n-i-j))
exit()
print("-1 -1 -1") |
p03471 | s196148706 | Wrong Answer | import sys
num, price = map(int,sys.stdin.readline().rstrip().split())
for x in range(num+1):
for y in range(num-x+1):
sum = x *1000 + y * 5000 + (num-x-y) * 1000
if sum == price:
print(x, y, num-x-y)
sys.exit()
print(-1,-1,-1) |
p03471 | s796116711 | Wrong Answer | import sys
n, y = map(int, input().split())
max_yukiti = y // 10000
flag = False
for i in range(max_yukiti + 1):
for j in range(n+1):
k = n - i - j
# print(i,j,k)
if k < 1:
break
if 10000 * i + 5000 * j + 1000 * k == y:
print(i,j,k)
sys.exit()
if ~flag:
print(-1,-1,-1) |
p03471 | s119805406 | Wrong Answer | N,Y=map(int,input().split())
ans=0
for x in range (N):
for y in range(N):
if 10000*x+5000*y+1000*(N-x-y)==Y:
print(x,y,N-x-y)
exit()
print(-1,-1,-1) |
p03471 | s616929545 | Wrong Answer | def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
n,y = iim()
for i in range(n+1):
for j in range(n+1):
k = n - i - j
v = 10000*i+5000*j+1000*k
if k > 0 and v == y:
print(i,j,k)
exit()
print(-1,-1,-1) |
p03471 | s887384756 | Wrong Answer |
n, y = map(int, input().split())
hasuu = n % 5
exist = False
for sen in range(hasuu, n):
for gosen in range(n):
man = n - gosen - sen
if man < 0:
break
if y == man * 10000 + gosen * 5000 + sen * 1000:
exist = True
break
if exist:
break
if exist:
print('{} {} {}'.format(man, gosen, sen))
else:
print('-1 -1 -1') |
p03471 | s579859521 | Wrong Answer | n, sum = map(int, input().split())
for x in range(n+1):
for y in range(n+1):
z = n - x - y
if 10000 * x + 5000 * y + 1000 * z == sum:
break
else:
continue
break
else:
continue
break
else:
x, y, z = -1, -1, -1
print("{} {} {}".format(x, y, z)) |
p03471 | s431150566 | Wrong Answer | m = input().split()
N = int(m[0])
Y = int(m[1])
ans = [0] * 3
for a in range(N+1):
for b in range(N - a + 2):
c = N - (a + b)
money = (a * 10000) + (b * 5000) + (c * 1000)
if money == Y:
ans[0] = a
ans[1] = b
ans[2] = c
break
else:
continue
break
if ans == [0, 0, 0]:
ans = [-1, -1, -1]
x = ans[0]
y = ans[1]
z = ans[2]
print(str(x) + ' ' + str(y) + ' ' + str(z))
|
p03471 | s572423750 | Wrong Answer | n, y = map(int, input().split())
def fun(n, y):
for i in range(y//10000):
for j in range(y//5000):
k = (y - 10000*i - 5000*j)//1000
if i + j + k == n:
return (i, j, k)
return (-1, -1, -1) |
p03471 | s497407186 | Wrong Answer | import sys
#N枚のお金N，合計金額Y
N, Y = map(int, input().split())
a = 0 #1000円札の枚数
b = 0 #5000円札の枚数
c = 0 #10000円札の枚数
X = 0 #合計金額
for a in range(N+1):
for b in range(N-a+1):
X = 1000*a + 5000*b + 10000*(N-a-b)
if X == Y:
print(a, b, N-a-b)
sys.exit()
print("-1 -1 -1") |
p03471 | s525384721 | Wrong Answer | n, y = map(int, input().split())
for i in range(n+1):
for j in range(i, n+1):
res = y - (10000*i + 5000*j)
if (res == 1000*(n - i - j)) and ((n - i - j)>=0):
print(i, j, n-i-j)
exit()
print('-1 -1 -1')
|
p03471 | s637068283 | Wrong Answer | n,Y=map(int,input().split())
cnt=0
for x in range(n+1):
for y in range(n+1):
s=Y-10000*x-5000*y
z=s//1000
if z>=0 and z<=n:
print('{} {} {}'.format(x,y,z))
cnt+=1
break
if cnt==0:
print('{} {} {}'.format(-1,-1,-1)) |
p03471 | s178436086 | Wrong Answer | from sys import stdin
n,y = map(int,stdin.readline().rstrip().split())
for i in range(n+1):
for j in range(n-i+1):
k = n-i+j
if 10000*i+5000*j+1000*k == y:
print(i,j,k)
exit()
print(-1,-1,-1) |
p03471 | s066811397 | Wrong Answer | all = list(map(int, input().split()))
N = all[0]
Y = all[1]
yu = -1
hi = -1
no = -1
for i in range(N):
for j in range(N-i):
c = (N-(i+j))
total = 10000*i + 5000*j + 1000*c
if Y==total:
yu = i
hi = j
no = c
break
else:
continue
else:
continue
break
print(yu)
print(" ")
print(hi)
print(" ")
print(no)
print(" ")
|
p03471 | s097063731 | Wrong Answer | N,Y = map(int,input().split())
for x in range(N+1):
for y in range(N+1):
z = N - x - y
if z < 0:
continue
if 10000 * x + 5000 * y + 1000 * z == Y:
print(x,y,z)
break
else:
print(-1,-1,-1) |
p03471 | s243945998 | Wrong Answer | N, Y = map(int, input().split())
resx, resy, resz = (-1, -1, -1)
xmax = min(N, Y//10000)
for x in range(xmax+1):
ymax = (Y - 10000*x)//5000
for y in range(ymax+1-x):
z = N - x - y
total = 10000*x + 5000*y + 1000*z
if total == Y:
resx, resy, resz = (x, y, z)
break
print(resx, resy, resz) |
p03471 | s014441002 | Wrong Answer | from itertools import *
N,Y = map(int,input().split())
man,gosen,sen = 0,0,0
for i in range(N):
for j in range(N-i):
k = N-i-j
for xyz in combinations([i,j,k],3):
x,y,z = xyz
if 10000*x + 5000*y + 1000*z == Y:
# print(10000*x + 5000*y + 1000*z)
print(x,y,z)
exit()
print(-1,-1,-1) |
p03471 | s434183561 | Wrong Answer | n,y=map(int,input().split())
f=0
for i in range (n+1):
if f==1:
break
for j in range(n+1):
for k in range(n+1):
if i+j+k==n:
if 10000*i+5000*j+1000*k==y:
print("{} {} {}".format(i,j,k))
f=1 |
p03471 | s972880951 | Wrong Answer | import math
N,Y = map(int, input().split())
breakRoop = False
for x in range(N):
for y in range(N-x):
z = N-x-y
total = x*1000 + y*5000 + z*10000
if total == Y:
print(x, y, z)
breakRoop = True
break
if breakRoop:
break
if not breakRoop:
print(-1, -1, -1)
|
p03471 | s428841211 | Wrong Answer | N, Y = map(int, input().split())
Anser = [-1, -1, -1]
flag = False
for i in range(N+1):
if flag == True: break
for j in range(N+1):
if flag == True: break
for k in range(N+1):
if flag == True: break
if Y == 10000*i + 5000*j +1000*k:
Anser =[i, j, k]
flag = True
print(*Anser) |
p03471 | s762977335 | Wrong Answer | N,Y = list(map(int,input().split()))
Y = Y // 1000
A = Y // 10
B = Y - A*10
C = B // 5
D = B - C*5
ans = A+C+D
if ans == N:
print('{0} {1} {2}'.format(A,C,D))
exit()
for i in range(0,A+1):
for j in range(0,C+1):
answer = ans + i*9 + j*4
if answer == N:
print('{0} {1} {2}'.format(A-i,C-j,D+i*10+j*5))
exit()
print('-1 -1 -1') |
p03471 | s962291974 | Wrong Answer | N,Y = map(int,input().split())
flag = False
for i in range(N):
y = int(Y/4000-9*(i+1)/4-N/4)
x = N - (i+1) - y
if (x >=0) & (y >= 0) & (x*1000 + y*5000 +(i+1)*10000 == Y):
print('{0} {1} {2}'.format(i+1 ,y,x ))
flag = True
break
if flag == False:
print('-1 -1 -1') |
p03471 | s787825829 | Wrong Answer | N, Y = map(int, input().split())
result = []
for a in range(N+1):
for b in range(N+1):
c = N - a - b
total = a * 10000 + b * 5000 + c * 1000
if (total == Y) and (a + b + c == N):
result.append([a, b, c])
if len(result) == 0:
print("-1 -1 -1")
else:
print(" ".join(map(str, result[0]))) |
p03471 | s693026353 | Wrong Answer | N,Y = map(int,input().split())
sum = 0
for i in range(N):
for j in range(N):
for k in range(N):
if(((i+j+k<=N) and k*1000+j*5000+i*10000)==Y):
flag = True
print(k,j,i)
exit()
print(-1,-1,-1) |
p03471 | s031147080 | Wrong Answer | a,sums= list(map(int,input().split()))
yuki = sums//10000
taishi = (sums%10000) //5000
noguchi = (sums%5000) //1000
while a>yuki+taishi+noguchi:
if a-(yuki+taishi+noguchi)%4==0:
taishi-=1
noguchi+=5
else:
yuki-=1
taishi+=2
if a==yuki+taishi+noguchi:
print(yuki,taishi,noguchi)
else:
print("-1 -1 -1") |
p03471 | s552509225 | Wrong Answer | n,y=map(int,input().split())
for i in range(n+1):
for j in range(n+1-i):
yen=0
k=n-i-j
if k>0:
yen=10000*i+5000*j+1000*k
if yen==y:
print(i,j,k)
exit()
print(-1,-1,-1) |
p03471 | s093970892 | Wrong Answer | n,y = map(int, input().split())
err = '-1 -1 -1'
for i in range(n+1):
for j in range(n+1-i):
if y == 10000 * (n+1-i-j) + 5000 * j + 1000 * i:
ans = str(n-i-j) + " " + str(j) + " " + str(i)
break
else:
ans = err
# 以下,多重ループを抜ける手法。
else:
continue
break
print(ans) |
p03471 | s320217106 | Wrong Answer | N, Y = list(map(int, input().split()))
results = [-1, -1, -1]
for x in range(N + 1):
for y in range(N - x + 1):
z = (N - x - y)
if 0 <= z <= 2000 and Y == 10000 * x + 5000 * y + 1000 * z:
results = [x, y, z]
print(results)
exit()
print(results) |
p03471 | s712143104 | Wrong Answer | n, y = map(int,input().split())
for i in range(n):
for j in range(n-i):
k = n-i-j
if 10000*i + 5000*j + 1000*k == y:
print(i,j,k)
exit()
print("-1 -1 -1")
|
p03471 | s238683273 | Wrong Answer | n , y = map(int,input().split())
y = y//1000
m = 0
for i in range(y//10+1):
y1 = y-10*i - n +i
if y1%4 == 0 and n-i-y1//4>=0:
print(i,y1//4,n-i-y1//4)
exit()
print('-1 -1 -1') |
p03471 | s491642024 | Wrong Answer | main_list = input().split()
n = int(main_list[0])
y = int(main_list[1][:-3])
for i in range(n+1):
for j in range(n-i+1):
if y == i*10 + j*5 + (n-i-j)*1:
print(" ".join(list(map(str,[i,j,n-i-j]))))
print(n,y)
|
p03471 | s948024156 | Wrong Answer | N,Y = map(int, input().split())
for i in range(Y//10000+1):
for j in range(Y//5000):
k = N-i-j
if 10000*i+5000*j+1000*k==Y and k>=0:
print(i, j, k)
break
else:
continue
break
else:
print(-1,-1,-1) |
p03471 | s298308382 | Wrong Answer | n , y = map(int , input().split())
no = -1
for o in range(n):
for f in range(n):
if 10000*n - 9000*o -5000*f == y:
print(n-o-f , f , o)
exit(0)
print(no , no , no)
|
p03471 | s618809238 | Wrong Answer | n, X = map(int, input().split())
for i in range(n+1):
for j in range(n+1):
if i+j > n:
pass
else:
k = n-i-j
otoshi = 10000*i + 5000*j + 1000*k
if otoshi == X:
print(i, j, k)
break
else:
continue
break |
p03471 | s285632328 | Wrong Answer | def resolve():
N, Y = map(int, input().split())
resx, resy, resz = (-1, -1, -1)
n = min(N, Y//10000)
for x in range(n+1):
for y in range(n+1-x):
z = N - x - y
total = 10000*x + 5000*y + 1000*z
if total == Y:
resx, resy, resz = (x, y, z)
break
print(resx, resy, resz)
resolve() |
p03471 | s877724214 | Wrong Answer | import math
N,Y = map(int, input().split())
breakRoop = False
for x in range(N):
for y in range(N-x):
for z in range(N-x-y):
total = x*1000 + y*5000 + z*10000
if total == Y:
print(x, y, z)
breakRoop = True
break
if breakRoop:
break
if breakRoop:
break
if not breakRoop:
print(-1, -1, -1)
|
p03471 | s163648364 | Wrong Answer |
n,y = [ int(i) for i in input().split()]
for i in range(n+1):
for j in range(n-i+1):
if y == i*10000 + j*5000 + (n-i-j)*1000:
print(" ".join(list(map(str,[i,j,n-i-j]))))
print("-1 -1 -1") |
p03471 | s965175276 | Wrong Answer | n,y = map(int,input().split())
z= y//1000
if z != y/1000:
print(-1,-1,-1)
exit()
for i in range(n+1):
for j in range(n+1-i):
for k in range(n+1-i-j):
if 10*i + 5*j + k == z:
print(i,j,k)
exit()
elif 10*i + 5*j + k > z:
print(-1,-1,-1)
exit()
|
p03471 | s619408362 | Wrong Answer | n, y = map(int, input().split())
ans = 0
for x in range(n+1):
for p in range(n+1-x):
z = n - x - p
if y-10000*x-5000*p == 1000*z and x+p+z == n:
print(x, p, z)
ans += 1
break
if ans == 0:
print(-1, -1, -1) |
p03471 | s413476172 | Wrong Answer | N, Y = map(int, input().split())
if Y % 1000 != 0:
print(-1, -1, -1)
else:
# max(N)=2000 -> 2000**2 = 4*(10**6)
for a in range(N):
for b in range(N):
c = N - a - b
if c < 0:
continue
elif Y == 10000 * c + 5000 * b + 1000 * a:
print(c, b, a)
exit()
print(-1, -1, -1)
|
p03471 | s525575599 | Wrong Answer | N,Y = map(int,input().split())
change = False
for i in range(N+1):
for j in range(N+1-i):
if i*10000+j*5000+(N-i-j)*1000==Y:
print(i,j,N-i-j)
change = True
else:
break
if change != True:
print("-1 -1 -1") |
p03471 | s282399433 | Wrong Answer | n, y = map(int, input().split())
for i in range(n):
for j in range(n):
for k in range(n):
if sum([i*10000, j*5000, k*1000]) == y and sum([i, j, k]) == n:
print(i, j, k)
exit()
print(-1, -1, -1)
|
p03471 | s722540598 | Wrong Answer | N, Y = map(int, input().split())
if Y // 1000 == N:
print('0 0',N)
man_max = Y // 10000
gosen_max = Y // 5000
is_exist = False
for i_m in range(man_max+1):
for i_g in range(gosen_max+1):
if 99000*i_m + 4000*i_g == Y - 1000*N:
print(i_m, i_g, int(Y / 1000 - 10*i_m - 5*i_g))
is_exist = True
break
if not is_exist:
print(-1, -1, -1)
|
p03471 | s800689493 | Wrong Answer | N, Y = map(int, input().split())
q = -1
w = -1
r = -1
for a in range(N + 1):
for b in range(N + 1):
c = N - a - b
# if a > 0 and b > 0 and c > 0:
total = 10000*a + 5000*b + 1000*c
if total == Y:
q = a
w = b
r = c
print('{} {} {}'.format(q, w, r)) |
p03471 | s373086267 | Wrong Answer | N, Y = map(int, input().split())
q = Y//1000 - N
x = [0, 4, 8, 3, 7, 2, 6, 1, 5]
b = x.index(q%9)
c = (q - 4*b) // 9
a = N-c-b
if a<0 or Y%1000 != 0:
print(-1, -1, -1)
else:
print(c, b, a)
|
p03471 | s776216732 | Wrong Answer | def main():
ans = [-1, -1, -1]
N, Y = map(int, input().split())
for a in range(N+1):
for b in range(N+1):
for c in range(N+1):
if 1000*a + 5000*b + 10000*c == Y and a + b + c == N:
ans = [a, b, c]
print(*ans)
if __name__ == "__main__":
main() |
p03471 | s305396526 | Wrong Answer | n,y=map(int,input().split())
n+=1
if y>10000*n:
print("-1 -1 -1")
else:
for i in range(n):
for j in range(n-i):
for g in range(n-i-j):
if y==10000*i+5000*j+g*1000:
print(i,j,g)
exit()
print("-1 -1 -1") |
p03471 | s462634987 | Wrong Answer | n,y = map(int,input().split())
for i in range(n+1):
for j in range(n+1-i):
k = n - i - j
if (10000 * i + 5000 * j + 1000 * k == y) & (i+j+k==9):
print(i,j,k)
exit()
print('-1 -1 -1') |
p03471 | s113756128 | Wrong Answer | n, result = map(int, input().split())
for x in range(n + 1):
for y in range(n + 1):
if x + y + (n - x - y) == 9:
if 10000 * x + 5000 * y + 1000 * (n - x - y) == result:
print(x, y, (n - x - y))
exit()
print("-1,-1,-1") |
p03471 | s728083209 | Wrong Answer | N,Y = map(int,input().split())
x = 0
y = 0
z = 0
flag = False
for i in range(N):
for j in range(N):
if int((Y-10000*i-5000*j)/1000) == N-i-j:
x = i
y = j
z = N-i-j
flag = True
break
break
if flag == False:
print(-1,-1,-1)
else:
print(x,y,z)
|
p03471 | s573252099 | Wrong Answer | N, Y = map(int, input().split())
cnt = 0
for x in range(1, N + 1):
for y in range(1, N + 1):
if x * 10000 + y * 5000 + (N - x - y) * 1000 == Y:
cnt += 1
print(cnt) |
p03471 | s868703193 | Wrong Answer | n, y = map(int, input().split())
a = y // 10000
x = y % 10000
b = x // 5000
c = (x % 5000) // 1000
print((f"-1 -1 -1", f"{a} {b} {c}")[a + b + c <= n]) |
p03471 | s416053168 | Wrong Answer | n, y = map(int, input().split())
j=True
if y % 1000 != 0 or y // 10000 > n:
print(-1, -1, -1)
for th in range(0, n+1) :
for fh in range(0, n-th+1) :
if th * 10000 + fh * 5000 + (n-fh-th) * 1000 == y :
print (th, fh, n-fh-th)
j = False
break
else :
continue
break
if j == True:
print(-1, -1, -1) |
p03471 | s776826770 | Wrong Answer | N, Y = map(int, input().split())
for x in range(Y//10000+1):
for y in range((Y - (10000*x))//5000+1):
z = (Y - (10000*x) - (5000*y))//1000
if x + y + z == N:
print(x, y, z)
exit()
if x + y + z > N:
break
else:
print(-1, -1, -1) |
p03471 | s498881606 | Wrong Answer | N, Y = map(int, input().split())
Y //= 1000
if 10*N < Y or N > Y:
print('-1 -1 -1')
for a in range(N+1):
for b in range(N-a+1):
if Y - 10*a - 5*b == N - a - b:
c = N - a - b
print('{} {} {}'.format(a,b,c))
exit()
print('-1 -1 -1') |
p03471 | s776248965 | Wrong Answer | a, b = map(int, input().split())
count = 0
for i in range(a+1):
for j in range(a+1):
c = a - (i+j)
s = (10000*i + 5000*j + 1000*c)
if b == s:
count+=1
break
else:
continue
break
if count == 0:
print(-1,-1,-1)
else:
print(i,j,c) |
p03471 | s537664499 | Wrong Answer | N, Y = map(int, input().split())
for a in range(0, 10):
for b in range(0, N - a + 1):
c = N - a - b
if (10000 * a + 5000 * b + 1000 * c) == Y:
print(a, b, c)
exit()
print(-1, -1, -1)
|
p03471 | s503627973 | Wrong Answer | N, Y = map(int, input().split())
x, y, z = -1, -1, -1
for i in range(N+1):
for j in range(N+1):
if 10000*i + 5000*j + 1000*(max(N-i-j, 0)) == Y:
x = i
y = j
z = N - (i+j)
break
print(x, y, z) |
p03471 | s601655511 | Wrong Answer | def main():
N, Y = (int(i) for i in input().split())
for i in range(N+1):
for j in range(N+1):
k = Y - 10000*i+5000*j
if k % 1000 or k < 0:
continue
k //= 1000
if i+j+k == N:
return print(i, j, k)
print(-1, -1, -1)
if __name__ == '__main__':
main()
|
p03471 | s126798746 | Wrong Answer | N,Y = list(map(int, input().split()))
ans = [-1,-1,-1]
for a in range(N+1):
for b in range(N+1-a):
c = N - a - b;
total = 10000 * a + 5000 * b + 1000 * c
if total == Y:
ans = [ a , b , c ]
print(ans)
|
p03471 | s189746466 | Wrong Answer | import sys
N, Y = list(map(int , input().split()))
for x in range(N):
for y in range(N):
z = N - x- y
if z >=0:
if 10000*x+5000*y+1000*z ==Y:
print('{} {} {}'.format(x,y,z))
sys.exit()
print('-1 -1 -1') |
p03471 | s224951999 | Wrong Answer | import sys
N,Y = map(int,input().split())
for i in range(N):
for j in range(N-i):
k = N-i-j
ans = i*10000 + j*5000 + k*1000
if ans == Y:
print("{0} {1} {2}" .format(i,j,k))
sys.exit()
print("-1 -1 -1") |
p03471 | s189580018 | Wrong Answer | n,y = map(int,input().split())
satu = [1000,5000,10000]
sen = [1000 * i for i in range(n+1)]
gsen = [1000 * i for i in range(n+1)]
man = [10000 * i for i in range(n+1)]
for i in range(n+1):
for j in range(n+1-i):
if man[i]+ gsen[j] + sen[n-i-j] == y:
print(i,j,n-i-j)
exit()
print("-1 -1 -1")
|
p03471 | s320175243 | Wrong Answer | n, y = map(int, input().split())
a = 0
a += (y%5000)//1000
n -= a
y -= a*1000
if n*10000>=y and y>=n*1000:
if y>= 5000*n:
m = (y-5000*n)//5000
print(m,n-m,a)
else:
m = y-1000*n
for i in range(n//2+1):
m2 = m
m2 -= 9000*i
if m2%4000 == 0:
j = m2//4000
print(i,j,n-i-j+a)
exit(0)
print(-1,-1,-1)
else:
print(-1,-1,-1) |
p03471 | s382050580 | Wrong Answer | N, Y = map(int, input().split())
Y //= 1000
p = [-1, -1, -1]
for i in range(N):
for j in range(N - i):
if 9 * i + 4 * j == Y - N:
p = [i, j, N - i - j]
print(p[0], p[1], p[2]) |
p03471 | s946126565 | Wrong Answer | n,y=map(int, input().split())
count = 0
for i in range(n):
for j in range(n-i):
k = int((y - (i * 10000) - (j * 5000))/1000)
if i + j + k == n and (i * 10000) + (j * 5000) + (k * 1000) == y:
print(i, j, k)
count += 1
break;
break;
if count == 0:
print(-1, -1, -1)
|
p03471 | s334891235 | Wrong Answer | N,Y = map(int,input().split())
ans = -1,-1,-1
for x in range(N+1):
for y in range(N+1-x):
z = N - x - y
if 10000*x + 5000*y + 1000*z == Y:
ans = x,y,z
exit()
print(*ans) |
p03471 | s531606585 | Wrong Answer | n, y = map(int, input().split())
f = False
for i in range(y // 10000 + 1):
for j in range((y - 10000 * i) // 5000 + 1):
if 10000 * i + 5000 * j + 1000 * (n - i - j) == y:
ans = "{} {} {}".format(i, j, n - i - j)
print(ans)
f = True
else:
pass
if f:
pass
else:
print("-1 -1 -1") |
p03471 | s772566339 | Wrong Answer | # coding: utf-8
# Your code here!
n,y = map(int,input().split())
total = 0
for i in range(n + 1):
total += i * 10000
for j in range(n - i + 1):
total += j * 5000
total += (n - i - j) * 1000
if total == y:
print(i ,j ,n-i-j)
exit()
total = 0
print(-1,-1,-1)
|
p03471 | s097081416 | Wrong Answer | n,y=map(int,input().split())
for i in range(n+1):
for j in range(i,n+1):
k=n-i-j
if k>=0 and i*10000+j*5000+k*1000==y:
print(i,j,k)
exit()
print(-1,-1,-1) |
p03471 | s663635425 | Wrong Answer | # https://atcoder.jp/contests/abc085/tasks/abc085_c
# N枚、Y円
N, Y = map(int, input().split())
for i in range(N + 1):
for j in range(N + 1):
z = N - (i + j)
if z < 0:
continue
total = i*1000 + j*5000 + z*10000
if total == Y:
print(i, j, z)
exit()
print('-1 -1 -1') |
p03471 | s665511309 | Wrong Answer | def main():
n, y = map(int, input().split())
five, y1 = divmod(y, 10000)
four, y2 = divmod(y1, 5000)
three, y3 = divmod(y2, 1000)
print(five, four, three, sep=' ') if y3 == 0 else print(-1, -1, -1)
if __name__ == "__main__":
main()
|
p03471 | s651894701 | Wrong Answer | N,Y = map(int,input().split())
for i in range(N):
for j in range(N):
for k in range(N):
if (10000*i + 5000*j + 1000*k == Y) and (i + j + k == N):
print(i,j,k,end=' ')
break |
p03471 | s292594255 | Wrong Answer | N, Y = map(int, input().split())
a = 10000
b = 5000
c = 1000
# p = 1 q = 1
# cの枚数 = 5
is_ok = False
for p in range(N+1):
for q in range(N-p+1):
tmp = Y - a * p - b * q
if tmp == 0 or (tmp % c == 0 and tmp / c <= N-p-q):
is_ok = True
break
if is_ok:
break
if is_ok:
print('{} {} {}'.format(p, q, N-p-q))
else:
print('-1 -1 -1')
|
p03471 | s805687968 | Wrong Answer | def main():
N, Y = (int(i) for i in input().split())
for i in range(N):
for j in range(N):
k = Y - 10000*i+5000*j
if k % 1000 or k < 0:
continue
k //= 1000
if i+j+k == N:
return print(i, j, k)
print(-1, -1, -1)
if __name__ == '__main__':
main()
|
p03471 | s402207528 | Wrong Answer | N,Y = input().split()
N,Y = map(int,(N,Y))
Z = Y
for i in range(2,N+1):
Y = Y-10000*i
for j in range(N+1-i):
Y = Y-5000*j
Y = Y-1000*(N-i-j)
if Y == 0:
print(i,end = " ")
print(j,end = " ")
print(N-i-j,end = " ")
break
else :
Y=Z-i*10000
else:
Y = Z
continue
break
else :
print(-1,end=" ")
print(-1,end=" ")
print(-1,end=" ") |
p03471 | s268519002 | Wrong Answer | N,Y=map(int,input().split())
l=0
for i in range (N+1):
for j in range(N+1-i):
if 10000*i+5000*j+1000*(N-i-j)==Y:
print(i, j, N-i-j)
break
else :
print(-1, -1, -1)
|
p03471 | s287731480 | Wrong Answer | import sys
N,Y = map(int,input().split())
for x in range(0,N+1):
for y in range(0,N+1-x):
if (1000*x+5000*y + (N-x-y)* 10000 == Y) and ((N-x-y)>=0):
print('%d %d %d' % (x,y,N-x-y))
sys.exit(0) |
p03471 | s673954328 | Wrong Answer | N, Y = map(int, input().split())
for x in range(N+1):
for y in range(N-x+1):
for z in range(N-x-y+1):
if x*10000 + y*5000 + z*1000 == Y:
break
else:
continue
break
else:
continue
break
if x*10000 + y*5000 + z*1000 == Y:
print(x, y, z)
else:
print("-1 -1 -1") |
p03471 | s932037768 | Wrong Answer | n, y = map(int, input().split())
f = False
for i in range(n + 1):
for j in range(n - i + 1):
if 10000 * i + 5000 * j + 1000 * (n - i - j) == y:
ans = "{} {} {}".format(i, j, n - i - j)
print(ans)
f = True
else:
pass
if f:
pass
else:
print("-1 -1 -1") |
p03471 | s735913921 | Wrong Answer | n, money = map(int, input().split())
ans = [0, 0, 0]
flag = False
for i_1000 in range(n+1):
for j_5000 in range(n - i_1000 + 1):
if (money - i_1000 * 1000 - j_5000 * 5000) % 10000 == 0:
flag = True
ans = [i_1000, j_5000, n - i_1000 - j_5000]
if flag:
break
print(ans[0], ans[1], ans[2]) |
p03471 | s610080919 | Wrong Answer | n, y = map(int, input().split())
ans1 = -1
ans2 = -1
ans3 = -1
for i in range(n):
for j in range(n-(i+1)):
if 10000*i + 5000*j + (n-(i+j))*1000 == y:
ans1 = i
ans2 = j
ans3 = n-(i+j)
break
print(ans1, ans2, ans3)
|
p03471 | s350669295 | Wrong Answer | import math
n,y = map(int,input().split())
c = 0
for a in range(n):
for b in range(n):
if 9000*a + 4000*b == y - 1000*n and n - a - b >= 0:
print(*[a,b,n-a-b])
c += 1
break
if c == 1:
break
if c == 0:
print(*[-1,-1,-1]) |
p03471 | s511942375 | Wrong Answer | N, Y = map(int, input().split())
for i in range(9):
a = Y - i*5000
b = N-i
c = (b*10000 - a) // 9000
d = b-c
if c < 0 or d < 0:
continue
if N == c+d and Y == d*10000+i*5000+c*1000:
print(d, i, c)
break
else:
print(-1,-1,-1) |
p03471 | s223450057 | Wrong Answer | n,y = map(int,input().split())
for a in range(n):
for b in range(n):
for c in range(n):
if 10000*a + 5000*b + 1000*c == y and a + b + c == n:
print(a,b,c)
exit()
print(-1,-1,-1)
|
p03471 | s501988827 | Wrong Answer | N,Y=map(int,input().split())
x = -1
y = -1
z = -1
for i in range(N+1):
for j in range(N):
k=N-j-i
sum = i*10000 + j*5000 + k*1000
if Y==sum:
x=i
y=j
z=k
break
else:
continue
break
print(str(x)+' '+str(y)+' '+str(z)) |
p03471 | s056030745 | Wrong Answer | import itertools
import sys
N, Y = map(int, input().strip().split(' '))
x = list(range(Y // 10000 + 1))
y = list(range(Y // 5000 + 1))
z = list(range(Y // 1000 + 1))
for i, j, k in itertools.product(x, y, z):
if 10000 * i + 5000 * j + 1000 * k == Y:
print(i, j, k)
else:
print('-1 -1 -1') |
p03471 | s326875210 | Wrong Answer | import sys
import numpy as np
# N お札の枚数 Y お年玉の金額
n, y = map(int, input().split())
ok = False
for i in range(n):
for j in range(n-i):
for k in range(n-i-j):
money = 10000 * i + 5000 * j + 1000 * k
if (money == y):
ok = True
break
if ok:
break
if ok:
break
if ok:
print(i, j, k)
else:
print("-1 -1 -1") |
p03471 | s270850734 | Wrong Answer | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
def solve():
N, Y = mapint()
for i in range(N+1):
for j in range(N-i+1):
now = i*10000 + j*5000
if now>Y:
continue
if i+j+(Y-now)//1000==N:
return (N-i-j, j, i)
else:
return (-1, -1, -1)
print(*solve()) |
p03471 | s713713671 | Wrong Answer | import sys
n,y = map(int, input().split())
count = 0
for i in range(0,n+1):
for j in range(0,n-i+1):
a = 10000*i + 5000*j + 1000*(n-i-j)
if (a == y):
ans = [i,j,n-i-j]
print(*ans)
sys.exit()
ans = [-1,-1,-1]
print(ans) |
p03471 | s504636148 | Wrong Answer | import sys
N,Y = map(int,input().split())
ans = '-1 -1 -1'
for i in range(2001):
for j in range(2001):
if 10000*i + 5000*j + 1000*(N-i-j) == Y :
print(str(i) + ' '+str(j) + ' '+ str(N-i-j))
sys.exit()
print(ans) |
p03471 | s115007611 | Wrong Answer | N, Y = map(int, input().split())
for x in range(N):
for y in range(N):
z = N - x - y
if 0 <= z <= N and 10000*x+5000*y+1000*z == Y :
print("{} {} {}".format(x,y,z))
exit()
print("-1 -1 -1") |
p03471 | s092825520 | Wrong Answer | N,Y = map(int,input().split())
x = 0
y = 0
z = 0
for i in range(N):
for j in range(N):
if int((Y-10000*i-5000*j)/1000) == N-i-j:
x = i
y = j
z = N-i-j
break
break
if x == y == z == 0:
print(-1,-1,-1)
else:
print(x,y,z) |
p03471 | s627766811 | Wrong Answer | import sys
N, Y = map(int, input().split())
for m in range(N):
for g in range(N-m):
s = N - m - g
if Y == 10000*m + 5000*g + 1000*s:
print(m, g, s)
sys.exit()
print(-1, -1, -1) |
p03471 | s322822129 | Wrong Answer | N, Y = list(map(int, input().split()))
results = [-1, -1, -1]
for x in range(N + 1):
for y in range(N - x + 1):
if Y == 10000 * x + 5000 * y + 1000 * (N - x - y):
results = [x, y, (N - x - y)]
print(results)
exit() |
p03471 | s456251913 | Wrong Answer | N, Y = map(int, input().split())
res10000 = -1
res5000 = -1
res1000 = -1
for a in range(N + 1):
for b in range(N + 1):
c = N - a - b
total = 10000*a + 5000*b + 1000*c
if total == Y:
res10000 = a
res5000 = b
res1000 = c
print('{} {} {}'.format(res10000, res5000, res1000)) |
p03471 | s458593760 | Wrong Answer | n,y = [int(i) for i in input().split()]
for i in range(2001):
for j in range(0,n-i):
if 10000*(i)+5000*(j)+1000*(n-i-j) == y:
print(i,j,n-i-j)
exit()
print(-1,-1,-1) |
p03471 | s793908769 | Wrong Answer | n, y = map(int, input().split())
ans = [-1, -1, -1]
for senen in range(n+1):
for gosenen in range(n-senen+1):
itimanen = n-senen-gosenen
if senen*1000 + gosenen*5000 + 10000*itimanen == y:
ans = [senen, gosenen, itimanen]
break
print(*ans) |
p03471 | s620294142 | Wrong Answer | N,Y = map(int, input().split())
x = -1
y = -1
z = -1
sum = 0
for a in range(N):
for b in range(N - a):
c = N - a - b
sum = 10000 * a + 5000 * b + 1000 * c
if (sum == Y):
x,y,z = a,b,c
print(x,y,z) |
p03471 | s336780438 | Wrong Answer | N, Y = map(int, input().split())
a = 0
b = 0
c = 0
for i in range(N):
for j in range(N):
if 10000*i + 5000*j + 1000*(N-i-j) == Y:
a = i
b = j
c = N-i-j
if a == 0 and b == 0 and c == 0:
print(-1,-1,-1)
else:
print(a,b,c) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.