problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03471 | s827307787 | Accepted | N, Y= map(int, input().split())
flag = False
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):
flag = True
print(i, j, k)
break
if flag is True:
break
if flag is False:
print(-1,-1,-1) |
p03471 | s899610588 | Accepted | N, Y = map(int, input().split())
a = 10000
b = 5000
c = 1000
# p = 1 q = 1
# cの枚数 = 5
def solve(n):
for i in range(N+1):
for j in range(N-i+1):
tmp = Y - a * i - b * j
k = N - i - j
if (tmp == 0 and k == 0) or tmp // c == k:
return i, j, k
return -1, -1, -1
i, j, k = solve(N)
print(i, j, k)
|
p03471 | s837188401 | Accepted | import sys
input = sys.stdin.readline
N, Y = list(map(int,input().split()))
Aohashi = False
for a in range(N+1):
for b in range(N+1-a):
c = N-a-b
otoshidama = 10000*a+5000*b+1000*c
if otoshidama==Y:
Aohashi = True
break
if Aohashi: break
if Aohashi:
print(a,b,c)
else:
print(-1,-1,-1) |
p03471 | s910457301 | Accepted | n,y = map(int,input().split())
a,b,c=-1,-1,-1
for i in range(n+1):
for j in range(n-i+1):
# print(10000*i+5000*j+1000*(n-i-j))
if 10000*i+5000*j+1000*(n-i-j) == y:
a,b,c=i,j,n-i-j
break
print(a,b,c) |
p03471 | s972870206 | Accepted | N, Y = map(int, input().split(' '))
for i in range(N+1):
for j in range(N+1):
if 10000*i + 5000*j + 1000*(N-i-j) == Y and N-i-j >=0:
print(i, j, N-i-j)
exit()
print(-1, -1, -1) |
p03471 | s473455479 | Accepted | n,Y=map(int,input().split())
for x in range(n+1):
for y in range(n+1):
if 10000*n-9000*x-5000*y==Y and x+y<=n:
print(n-x-y,y,x)
exit()
print(-1,-1,-1) |
p03471 | s983514598 | Accepted | n, y = map(int, input().split())
y //= 1000
a = 0; b = 0; c = 0
f = False
for i in range(n+1):
for j in range(n+1):
if 9*i + 4*j == y - n and i + j <= n:
a = i
b = j
f = True
break
if f: print(a, b, y-10*a-5*b)
else: print(-1, -1, -1) |
p03471 | s957267615 | Accepted | n,y = map(int,input().split())
for i in range(min(y//10000+1,n+1)):
for j in range(min((y-10000*i)//5000+1,n-i+1)):
k=n-i-j
if i*10000+j*5000+k*1000==y and i+j+k==n:
print(i,j,k);exit()
else:
print(-1,-1,-1) |
p03471 | s809487689 | Accepted | 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 + 1):
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 | s944565622 | Accepted | N,Y=map(int,input().split())
ans=[-1,-1,-1]
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:
ans=[i,j,k]
break
print(ans[0],ans[1],ans[2]) |
p03471 | s833516464 | Accepted | n,y=map(int,input().split())
n1=y//1000
n5=y//5000
n10=y//10000
for x1 in range(n1+1):
if x1>n:continue
for x5 in range(n5+1):
x10=n-x1-x5
if n10<x10:continue
if x10<0:break
if x1*1000+x5*5000+x10*10000==y and x1+x5+x10==n:
print(x10,x5,x1)
exit()
print(-1,-1,-1) |
p03471 | s174955420 | Accepted | N, Y = map(int, input().split())
y = 0
for i in range(Y // 10000 + 1):
y = i * 10000
for j in range((Y - y) // 5000 + 1):
y2 = y + 5000 * j
if y2 + (N - i - j) * 1000 == Y:
print(i, j, N - i - j)
exit()
print(-1, -1, -1) |
p03471 | s189335038 | Accepted | N, Y = map(int,input().split())
if Y % 1000 != 0:
print(-1,-1,-1)
n1 = Y // 10000
n2 = Y // 5000
for i in range(n1+1):
for j in range(n2+1):
if (N-i-j) < 0: continue
if i*10000 + j*5000 + (N-i-j)*1000 == Y:
print(i,j,(N-i-j))
exit()
if Y < i*10000 + j*5000 + (N-i-j)*1000: break
print(-1,-1,-1) |
p03471 | s102333562 | Accepted | n, y = map(int, input().split())
for x in range(n+1):
for y_2 in range(n+1):
z = n - x - y_2
if y == 10000*x + 5000*y_2 + 1000*z and z>=0:
print(x, y_2, z)
exit()
print(-1, -1, -1) |
p03471 | s812416110 | Accepted | N, Y = map(int, input().split())
a, b, c = -1, -1, -1
flag = False
for i in range(N+1):
if flag:
break
for j in range(N+1-i):
if i * 10000 + j * 5000 + (N-i-j) * 1000 == Y:
a = i
b = j
c = N-i-j
flag = True
break
print("{} {} {}".format(a,b,c)) |
p03471 | s145191990 | Accepted | N,Y=map(int,input().split())
for i in range(N+1):
if 10000*i>Y:
break
for j in range(N+1-i):
k=N-i-j
S = 10000*i + 5000*j + 1000*k
if k<0 or S>Y:
continue
elif S == Y:
print(i,j,k)
exit()
print(-1,-1,-1)
|
p03471 | s257008537 | Accepted | n,y=map(int,input().split())
judge=False
for i in range(n+1):
if judge==True:
break
for j in range(n-i+1):
if judge==True:
break
k=n-i-j
if 1000*i+5000*j+10000*k==y:
print(k,j,i)
judge=True
break
if judge==False:
print(-1,-1,-1) |
p03471 | s006234717 | Accepted | N, Y = map(int, input().split())
found = False
for k10 in range(N+1):
if 10000 * k10 > Y:
continue
for k5 in range(N+1 - k10):
k1 = N - k10 - k5
if Y == 1000 * k1 + 5000 * k5 + 10000 * k10:
found = True
break
if found:
print(k10, k5, k1)
break
else:
print(-1, -1 ,-1)
|
p03471 | s944371365 | Accepted | N, Y = map(int, input().split())
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:
print(x, y, z)
exit()
print(-1, -1, -1) |
p03471 | s374610870 | Accepted | def main():
n, sum = list(map(int,input().split()))
x_max = sum // 10000
for x in reversed(range(0, x_max + 1)):
y_max = (sum - x * 10000) // 5000
for y in reversed(range(0, min(n - x + 1, y_max + 1))):
z = n - x - y
if 10000 * x + 5000 * y + 1000 * z == sum:
print(x, y, z)
return 0
print('-1 -1 -1')
return 0
main() |
p03471 | s395800505 | Accepted | N,Y = map(int,input().split())
answer = -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 10000*x+5000*y+1000*z == Y:
answer = x,y,z
break
else:
continue
print(*answer)
|
p03471 | s183463819 | Accepted | n, y = map(int, input().split())
for i in range(n + 1):
for j in range(n - i + 1):
if i * 10000 + j * 5000 + (n - i - j) * 1000 == y:
print(i, j, n - i - j)
exit()
print(-1, -1, -1) |
p03471 | s357212430 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n,y=map(int, input().split())
yy=y//1000
if yy>n*10:
print(-1,-1,-1)
else:
ans=[-1,-1,-1]
for x in range(n+1):
for y in range(n-x+1):
if x*10+y*5+(n-x-y)==yy:
flag=True
ans=[x,y,n-x-y]
print(*ans)
resolve() |
p03471 | s362776350 | Accepted | n, y = map(int, input().split())
for i in range(n + 1):
for j in range(n - i + 1):
if i * 10000 + j * 5000 + (n - i - j) * 1000 == y:
print(i, j, n - i - j)
exit()
print("-1 -1 -1")
|
p03471 | s439046064 | Accepted | 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-i):
if flag == True: break
if Y == 10000*i + 5000*j +1000*(N-i-j):
Anser =[i, j, N-i-j]
flag = True
print(*Anser) |
p03471 | s613072434 | Accepted | n,y = [int(i) for i in input().split()]
for i in range(2001):
for j in range(2001):
if 10000*(i)+5000*(j)+1000*max(0,(n-i-j)) == y:
if n-i-j >= 0:
print(i,j,n-i-j)
exit()
print(-1,-1,-1) |
p03471 | s808895559 | Accepted | n, purpose = map(int, input().split(" "))
resultI = resultJ = resultK = -1
def combiValue(i, j, k):
return 10000 * i + 5000 * j + 1000 * k
for i in range(n+1):
for j in range(n+1-i):
k = n - i - j
if combiValue(i, j, k) == purpose:
resultI = i
resultJ = j
resultK = k
print("{0} {1} {2}".format(resultI, resultJ, resultK)) |
p03471 | s954631579 | Accepted | N, M = map(int, input().split())
l = [-1, -1, -1]
for i in range(N+1):
for j in range(N-i+1):
if 1000 * i + 5000 * j + 10000 * (N-i-j) == M:
l = [i, j, N-i-j]
print(l[2], l[1], l[0])
|
p03471 | s837208967 | Accepted | n, y = map(int, input().split())
rem = 0
for i in range(y//10000 +1):
rem = y-10000*i
for j in range(rem//5000 + 1):
k = (rem - 5000*j) // 1000
if (i + j+ k) == n:
print(i, j, k)
break
else:
continue
break
else:
print(-1, -1, -1) |
p03471 | s162148190 | Accepted | def solve(n, y):
a = 0
ans = "-1 -1 -1"
while a <= n :
c = (y - 5000*(a+n)) // (-4000) if (y - 5000*(a+n)) % (-4000) == 0 else -1
b = n - a - c
if b >= 0 and c >= 0:
ans = "{0} {1} {2}".format(a, b, c)
break
else:
a += 1
return ans
if __name__ == "__main__":
n,y = [int(i) for i in input().split()]
print(solve(n, y)) |
p03471 | s968846088 | Accepted | n,y = map(int, input().split())
for i in range(n + 1):
for j in range(n - i + 1):#
if i * 10000 + j * 5000 + (n - i - j) * 1000 == y:
print(i, j, n-i-j)
exit()
print("-1 -1 -1") |
p03471 | s686454267 | Accepted | import sys
n, price = map(int, input().split())
ans = [-1, -1, -1]
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 == price:
ans = [x, y, z]
print(*ans)
sys.exit()
print(*ans) |
p03471 | s136112512 | Accepted | a, b = map(int, input().split())
count = 0
for i in range(a+1):
for j in range(a+1-i):
s = (10000*i) + (5000*j) + (1000*(a-i-j))
if s == b:
print(i,j,(a-i-j))
count += 1
break
else:
continue
break
if count == 0:
print(-1,-1,-1) |
p03471 | s891061437 | Accepted | N,Y = [int(x) for x in input().split()]
Y = Y // 1000
for y in range(N+1):
if (Y - N - 4*y) % 9 != 0:
continue
x = int((Y - N - 4*y) / 9)
z = N - y - x
if 0 <= x and 0 <= z and x <= N and z <= N:
print(x,y,z)
exit()
print("-1 -1 -1") |
p03471 | s085315097 | Accepted | import numpy as np
N, Y = map(int, input().split())
res = Y - 1000*N
b = -1
for a in range(N+1):
cand = 9000*a + np.linspace(0, 4000*(N-a), N-a+1)
if (cand == res).sum() > 0:
b = np.where(cand==res)[0][0]
c = N-a-b
break
if b == -1:
print(-1, -1, -1)
else:
print(a, b, c)
|
p03471 | s800578301 | Accepted | 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 i+j <= N:
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 | s402942129 | Accepted | N,Y = (int(x) for x in input().split())
y = Y // 1000
for i in range(N+1):
for j in range(N+1-i):
if 10*i + 5*j + (N-i-j) == y:
print(i,j,N-i-j)
break
else:
continue
break
else:
n = -1
print(n,n,n) |
p03471 | s796385511 | Accepted | N,Y = map(int,input().split())
res = 0
for i in range(N+1):
for j in range(N+1-i):
if 10000*i+5000*j+1000*(N-i-j) == Y:
if res == 1:
break
print(i,j,N-i-j)
res = 1
if res == 0:
print(-1,-1,-1) |
p03471 | s018386734 | Accepted | n, y = map(int, input().split())
t = 0
for i in range(n+1):
if t == 1:
break
for j in range(n+1):
if (i+j) <= n:
if i * 1000 + j * 5000 + (n - i - j) * 10000 == y:
print((n - i - j), j, i)
t = 1
break
if t == 0:
print(-1, -1, -1) |
p03471 | s857711940 | Accepted | #! env python
# -*- coding: utf-8 -*-
import os
import sys
# ac_py.main
# Date: 2020/06/12
# Filename: main
# Author: acto_mini
def main():
N, Y = map(int, input().split())
print()
for i in range(N + 1):
for j in range(N + 1 - i):
k = N - i - j
if Y == (10000 * i + 5000 * j + 1000 * k):
print(i, j, k)
exit()
print("-1 -1 -1")
return
if __name__ == '__main__':
main()
|
p03471 | s590857992 | Accepted | N, Y = map(int, input().split())
ans1 = ["-1", "-1", "-1"]
for i in range(0, N+1):
for j in range(0, N+1):
if N-j>=0 and N-i-j >= 0:
if Y == 10000*i+5000*j+1000*(N-i-j):
ans1 = [str(i), str(j), str(N-i-j)]
print(" ".join(ans1)) |
p03471 | s683088840 | Accepted | n,y = map(int, input().split())
a = []
for i in range(0,n+1,1):
for j in range(0,n+1,1):
if 9000*i+4000*j == y-1000*n and n-i-j >= 0:
a = [i,j,n-i-j]
if a == []:
print(-1,-1,-1)
else:
print(a[0],a[1],a[2])
|
p03471 | s567664375 | Accepted | n,y=map(int,input().split())
for i in range(n+1):
for j in range(n-i+1):i*9+j*4+n==y/1e3<exit(print(i,j,n-i-j))
print(-1,-1,-1) |
p03471 | s841840373 | Accepted | N,Y=map(int,input().split())
n=Y//10000
if n>N:
print("-1 -1 -1")
exit()
for i in range(n+1):
fukuzawa=10000*i
x=i
for j in range(N-x+1):
higuchi=5000*j
y=j
if fukuzawa+higuchi+1000*(N-x-y)==Y:
z=N-x-y
print(x,y,z)
exit()
print("-1 -1 -1") |
p03471 | s545093495 | Accepted | N, Y = map(int, input().split())
flag = False
for x in range(N+1):
for y in range(N+1-x):
z = N-x-y
if x*10000 + y*5000 + z*1000 == Y:
print(x,y,z, sep=' ')
flag = True
break
if flag:
break
if not flag:
print("-1 -1 -1")
|
p03471 | s724166653 | Accepted | N,Y = map(int,input().split())
answer = (-1,-1,-1)
for x in range(N + 1):
for y in range(N + 1 - x):
z = N - x - y
if 0 <= z <= N and 10000 * x + 5000 * y + 1000 * z == Y:
answer = x, y, z
break
else:
continue
break
print(*answer) |
p03471 | s124431702 | Accepted | N,Y=map(int,input().split())
flag=False
for i in range(N+1):
for j in range(N+1):
if(9000*i+4000*j==Y-1000*N):
flag=True
x=i
y=j
z=N-i-j
if(flag==True and z>=0):
print(str(x)+" "+str(y)+" "+str(z))
else:
print("-1 -1 -1") |
p03471 | s073675647 | Accepted | n, y = map(int, input().split())
k = y - 1000*n
count = 0
for i in range(0, 2001):
for j in range(0, 4001):
if 9000*i + 4000*j == k and n-i-j >= 0:
a = i
b = j
c = n - i - j
count = 1
break
else:
pass
if count == 1:
print(a, b, c)
else:
print("-1 -1 -1") |
p03471 | s438804475 | Accepted | def main():
N, Y = map(int,input().split())
Cash = [10000, 5000, 1000]
for x in range(N+1):
for y in range(N+1):
Rem = Y - (10000*x + 5000*y)
Rem = Rem//1000
if Rem == (N - x - y) and Rem >=0:
print(x, y, Rem)
return
print(-1, -1, -1)
return
main() |
p03471 | s289538433 | Accepted | from sys import stdin
n,y = [int(x) for x in stdin.readline().rstrip().split()]
flag = False
for p in reversed(range(n+1)):
if p * 10000 > y:
continue
else:
for q in reversed(range(n-p+1)):
if 10000*p + 5000*q + 1000*(n-p-q) == y:
print(p,q,n-p-q)
flag = True
break
if flag == True:
break
if flag == True:
break
if flag == False:
print(-1,-1,-1) |
p03471 | s613165151 | Accepted | N, Y = map(int, input().split())
ansX = -1
ansY = -1
ansZ = -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:
ansX = x
ansY = y
ansZ = z
print(ansX, ansY, ansZ) |
p03471 | s031622877 | Accepted | n,y=map(int,input().split())
for i in range(n+1):
for j in range(n-i+1):
b=10000*i+5000*j+1000*(n-i-j)
if y==b:
print(i,j,n-i-j)
exit()
print(-1,-1,-1) |
p03471 | s302941732 | Accepted | N, Y = map(int, input().split())
for x in range(N + 1):
for y in range(N - x + 1):
z = N - x - y
if Y == 10000 * x + 5000 * y + 1000 * z:
print(x, y, z)
exit()
print(-1, -1, -1)
|
p03471 | s460677202 | Accepted | N, Y = map(int ,input().split())
for i in range(N+1):
for j in range(N+1):
c = N - i - j
if 0<= c <= 2000 and (10000*i + 5000*j + c*1000) == Y:
print(i,j,c)
exit()
print('-1 -1 -1') |
p03471 | s734565086 | Accepted | n,y=map(int,input().split())
for i in range(n+1):
for j in range(n+1-i):
x=n-i-j
if 1000*i+5000*j+10000*x==y:
print(x,j,i)
exit()
print(-1,-1,-1)
|
p03471 | s223021714 | Accepted | N, Y = map(int, input().split())
ans = -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 10000*x+5000*y+1000*z == Y:
ans = x,y,z
break
else:
continue
break
print(*ans) |
p03471 | s584012588 | Accepted | n,y=map(int,input().split())
amari=y-1000*n
if amari < 0:
print(-1,-1,-1)
exit()
for k in range(0,n+1):
if amari-4000*k >= 0 and (amari-4000*k)%5000 == 0:
x=(amari-4000*k)//5000
if k-x >= 0:
y=k-x
print(x,y,n-k)
break
else:
print(-1,-1,-1) |
p03471 | s337117934 | Accepted | N, Y = map(int, input().split())
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:
print(x, y, z)
exit()
print(-1, -1, -1) |
p03471 | s219760111 | Accepted | N,Y=map(int,input().split())
a=-1
b=-1
c=-1
for i in range(0,N+1):
for j in range(0,N-i+1):
if 10000*i+5000*j+1000*(N-i-j) == Y:
a=i
b=j
c=N-i-j
print(a,b,c) |
p03471 | s366657827 | Accepted | n,y=map(int,input().split())
for i in range(n+1):
y_=y-10000*i
for j in range(n-i+1):
y__=y_-5000*j
if y__//1000==n-i-j:
print(i,j,n-i-j)
exit()
print(-1,-1,-1) |
p03471 | s391397496 | Accepted | n, y = map(int, input().split())
x = 0
for i in range(n + 1):
# if 10000*i > y:break
for j in range(n - i + 1):
# if 10000 * i + 5000 * j > y:
# break
if 10000 * i + 5000 * j + 1000 * (n - i - j) == y:
print(i, j, n - i - j)
x = 1
break
if x == 1:
break
if x == 0:
print(-1,-1,-1) |
p03471 | s947545745 | Accepted | N, Y = map(int, input().split())
d = (Y // 1000) - N
flg = True
for i in range(N + 1):
if (d - 9 * i) % 4 == 0 and d >= 9 * i:
if (i + (d - 9 * i) // 4) <= N:
print(i, (d - 9 * i) // 4, N - i - (d - 9 * i) // 4)
flg = False
break
if flg:
print(-1, -1, -1)
|
p03471 | s399336765 | Accepted | n, y = map(int, input().split())
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)
exit()
else:
print(-1, -1, -1) |
p03471 | s100871815 | Accepted | N, Y = map(int, input().split())
for x in range(N+1):
for y in range(N-x+1):
z = N-x-y
if 10000*x+5000*y+1000*z == Y:
print(x, y, z)
exit()
print(-1, -1, -1) |
p03471 | s518259011 | Accepted | def resolve():
n, y = map(int, input().split())
for i in range(n + 1):
for j in range(n + 1 - i):
k = n - i - j
if i * 10000 + j * 5000 + k * 1000 == y:
print(i, j, k)
return
print(-1, -1, -1)
return
if __name__ == "__main__":
resolve()
|
p03471 | s866580457 | Accepted | #!/usr/bin/env python3
N, Y = map(int, input().split())
for i in range(0, N + 1):
x = 4/5*i + Y/5000 - N
y = -9/5*i - Y/5000 + 2*N
z = i
if (x.is_integer() & y.is_integer()):
# print(0 <= x <= N, 0 <= y <= N)
# print(int(x), int(y), z)
if ((0 <= x <= N) & (0 <= y <= N)):
print(int(x), int(y), z)
break
else:
print("-1 -1 -1") |
p03471 | s278706268 | Accepted | n,y=map(int,input().split())
y=y//1000
if y<n or 10*n<y:
print(-1,-1,-1)
else:
for i in range((y-n)//9+1):
if (y-n-9*i)%4==0:
a=i
b=(y-n-9*i)//4
if n-a-b>=0:
print(a,b,n-a-b)
break
else:
print(-1,-1,-1)
|
p03471 | s262174497 | Accepted | N, Y = map(int, input().split())
x, y, z = 0, 0, 0
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:
break
if 10000*x + 5000*y + 1000*z == Y:
break
x, y, z = -1, -1, -1
print(x, y, z)
|
p03471 | s791081208 | Accepted | n, y = map(int, input().split())
for i in range(n+1):
for j in range(n-i+1):
if 10000*i+5000*j+1000*(n-i-j) == y:
print(i, j, n-i-j)
exit()
print('-1 -1 -1') |
p03471 | s868856215 | Accepted | # -*- coding: utf-8 -*-
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
n, y = map(int,input().split())
for i in range(n + 1): #10000
for j in range(n + 1): #5000
k = n - i - j #1000
if k >= 0 and i * 10000 + j * 5000 + k * 1000 == y:
print(i, j, k)
exit()
print(-1, -1, -1)
|
p03471 | s382114648 | Accepted | n,y = map(int, input().strip().split())
a_x, a_y, a_z = -1, -1, -1
for xi in range(n + 1):
for yi in range(n - xi + 1):
zi = n - xi - yi
if 10000*xi + 5000*yi + 1000*zi == y:
a_x = xi
a_y = yi
a_z = zi
break
print(a_x, a_y, a_z) |
p03471 | s591380855 | Accepted | #input
N,Y = map(int,input().split())
#A = list(map(int, input().split()))
#print(N,Y)
ans = [-1,-1,-1]
#flag = True
# N = x + y + zを満たす組
for x in range(N+1):
for y in range(N+1):
z = N - x - y
if z >= 0:
list = [x,y,z]
if Y == 10000*list[0]+5000*list[1]+1000*list[2]:
ans = list
break
print(ans[0],ans[1],ans[2]) |
p03471 | s092965013 | Accepted | N, Y = map(int, input().split())
Y //= 1000
a = b = c = -1
for i in range(N+1):
for j in range(N+1):
if (N-i-j) >= 0 and 9*i+4*j+N == Y:
a = i
b = j
c = N-i-j
break
else:
continue
break
print(a, b, c)
|
p03471 | s760846153 | Accepted | n,y = (int(x) for x in input().split())
sol = False
for i in range(n+1):
bb = (y - 10000*i) - 1000*(n-i)
a = i
if bb % 4000 == 0 and bb >= 0:
b = bb // 4000
c = n - i - b
if c >= 0:
sol = True
break
if not sol:
print('-1 -1 -1')
else:
print(a,b,c) |
p03471 | s993297733 | Accepted | n,y=map(int,input().split())
b=0
for i in range(n+1):
for j in range(n-i+1):
if y- (10000*i + 5000*j)==1000*(n-i-j):
print(i,j,n-i-j)
b=1
break
if b==1:
break
if b==0:
print(-1,-1,-1) |
p03471 | s625933339 | Accepted | N, Y = map(int, input().split())
for i in range(N+1):
for j in range(N-i+1):
if 10000*i + 5000*j + 1000*(N-i-j) == Y:
print(i, j, N-i-j)
exit()
print('-1 -1 -1') |
p03471 | s515559536 | Accepted | import sys
n,y = map(int, sys.stdin.readline().split())
for a in range (n+1):
for b in range(n+1-a):
c = n-a-b
if 10000*a + 5000*b + 1000*c == y:
print(a,b,c)
break
else:
continue
break
if 10000*a + 5000*b + 1000*c != y:
print(-1,-1,-1) |
p03471 | s667024150 | Accepted | N,Y=map(int,input().split())
a=0
b=0
c=0
for i in range(2001):
for j in range(2001):
k=N-i-j
if 10000*i+5000*j+1000*k==Y and k>=0:
a=i
b=j
c=N-i-j
else:
pass
if a==0 and b==0 and c==0:
print(-1,-1,-1)
else:
print(a,b,c)
|
p03471 | s553821572 | Accepted | N,Y = map(int,input().split())
x = 0
y = 0
z = 0
flag = False
for i in range(N+1):
for j in range(N+1-i):
if 0 <= (Y-10000*i-5000*j)/1000 and (Y-10000*i-5000*j)/1000 == N-i-j:
x = i
y = j
z = N-i-j
flag = True
break
if flag == False:
print(-1,-1,-1)
else:
print(x,y,z) |
p03471 | s117320531 | Accepted | N,Y = list(map(int, input().split()))
for i in reversed(range(min(N+1, Y//10000+1))):
for j in reversed(range(min(N-i+1, (Y-10000*i)//5000+1))):
k = N-i-j
if i*10000 + j*5000 + k*1000 == Y:
print(i, j, k)
exit()
print(-1, -1, -1) |
p03471 | s888396148 | Accepted | N, Y = map(int, input().split())
Y2 = Y // 1000
mod5 = Y2 % 5
div5 = Y2 // 5
for c_div5 in range(div5 + 1):
c = c_div5 * 5 + mod5
a = (Y2 - c) // 5 - (N - c)
b = N - a - c
if a >= 0 and b >= 0: break
if c_div5 == div5: a=-1;b=-1;c=-1
print(a, b, c) |
p03471 | s374457053 | Accepted | N, Y = map(int, input().split())
for n in range(N+1):
for m in range(N+1-n):
if 1000*n + 5000*m + 10000*(N-n-m) == Y:
print(N-n-m, m, n)
exit()
print(-1, -1, -1)
|
p03471 | s596194535 | Accepted | n, money = (map(int, input().split()))
for i in range(n+1):
for j in range(n-i+1):
if 10000*i + 5000*j + 1000*(n-i-j) == money:
print(i, j, n-i-j)
break
else:
if i == n:
print(-1, -1, -1)
break
continue
break
|
p03471 | s904922051 | Accepted | N,Y = map(int,input().split())
X = Y // 1000
check = 0
for a in range(X // 10 + 1):
for b in range(X // 5 + 1):
c = N - a - b
Z = 10 * a + 5 * b + c
if c >= 0 and X == Z:
check = 1
break
if check == 1:
break
if check == 0:
print(-1,-1,-1)
else:
print(a,b,c) |
p03471 | s379902604 | Accepted | n,y = map(int,input().split())
ans = []
for i in range(n+1):#1000円
for j in range(n+1-i):#5000円
val = 1000 * i + 5000 * j + 10000 * (n-i-j)
if val == y:
ans.append(n-i-j)
ans.append(j)
ans.append(i)
break
if ans:
print(*ans[0:3])
else:
print(-1,-1,-1) |
p03471 | s641251842 | Accepted | n, y=map(int, input().split())
a=y//10000
b=y//5000
c=y//1000
y/=1000
for i in range(c+1):
for j in range(n+1-i):
k=n-i-j
if i + 5*j + 10*k == y:
print(k, j, i)
exit()
print(-1, -1, -1) |
p03471 | s254398813 | Accepted | n, y = map(int, input().split())
ans = [-1, -1, -1]
find = False
for i in range(n + 1):
if find:
break
for j in range(n + 1):
if i + j > n:
break
k = n - (i + j)
total = 10000 * i + 5000 * j + 1000 * k
if total == y:
ans[0] = i
ans[1] = j
ans[2] = k
find = True
break
print('{0} {1} {2}'.format(ans[0], ans[1], ans[2])) |
p03471 | s047431702 | Accepted | n,y=map(int,input().split())
y //= 1000
for i in range(n+1):
for j in range(n-i+1):
if 9*i + 4*j + n == y:
print(i,j,n-i-j)
exit()
print("-1 "*3) |
p03471 | s733844332 | Accepted | n, y = map(int, input().split(' '))
flag=0
for i in range(n+1):
for j in range(n+1-i):
if i*10000 + j*5000 + (n-i-j)*1000 == y:
print(str(i)+' '+str(j)+' '+str(n-i-j))
flag=1
break
if flag==1:
break
if flag==0:
print('-1 -1 -1') |
p03471 | s979697640 | Accepted | li = input().split()
count = int(li[0])
price = int(li[1]) / 1000
errorText = '-1 -1 -1'
ans = True
flag = False
for a in range(count+1):
for b in range(count+1 - a):
c = count - a-b
fee = a*10 + b*5 + c*1
if fee == price and a+b+c == count:
print(str(a) + " " + str(b) + " " + str(c))
ans = False
flag = True
break
if flag:
break
if ans is not False:
print(errorText) |
p03471 | s175101463 | Accepted | N, Y = [int(x) for x in input().split(" ")]
num = [-1,-1,-1]
for i in range(0,N+1):
for j in range(0,N+1-i):
if i*10000+j*5000+(N-i-j)*1000 == Y:
num = [i,j,N-i-j]
break
print(num[0],num[1],num[2])
|
p03471 | s539107155 | Accepted | import sys
N,Y=map(int,input().split())
count=0
n=N+1
for x in range(n):
i=10000*x
if i>Y:
break
for y in range(n):
j=5000*y
if j>Y:
break
z=N-x-y
if z<0:
continue
if i+j+1000*z==Y:
print(x,y,z)
sys.exit()
print(-1,-1,-1) |
p03471 | s203679539 | Accepted | n,y = map(int,input().split())
y = y//1000
flag = 0
for i in range(n+1):
for j in range(n+1-i):
if i*10 + j*5 + (n-i-j) == y:
print(i, j, n-i-j)
flag = 1
break
if flag == 1:
break
if flag == 0:
print('-1 -1 -1')
|
p03471 | s002939926 | Accepted | N, Y = map(int, input().split())
f = False
for i in range(N+1):
if f:
break
for j in range(N+1-i):
k = N-i-j
if 10000*i+5000*j+1000*k == Y:
print('{} {} {}'.format(i, j, k))
f = True
break
if not f:
print('-1 -1 -1') |
p03471 | s911359746 | Accepted | n, y = list(map(int, input().strip().split()))
f=0
a=-1
b=-1
c=-1
for i in range(0,n+1):
for j in range(0,n-i+1):
x=i*10000+j*5000+(n-i-j)*1000
if y==x:
a=i
b=j
c=n-i-j
print(a,b,c) |
p03471 | s816738443 | Accepted | n, y = map(int, input().split())
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)
j += 1
exit()
else:
print("-1 -1 -1") |
p03471 | s107861789 | Accepted | N, Y = [int(_) for _ in input().split()]
for x in range(0, Y//10000 + 1, 1):
for y in range(0, Y//5000 + 1, 1):
z = N - x - y
if z < 0:
continue
if 10000 * x + 5000 * y + 1000 * z == Y:
print(x, y, z)
exit()
print("-1 -1 -1") |
p03471 | s375465095 | Accepted | 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:
print("{} {} {}".format(i,j,k))
exit(0)
print("-1 -1 -1") |
p03471 | s537490298 | Accepted | N,Y = map(int,input().split())
for a in range(N+1):
for b in range (N+1-a):
if a*10000+b*5000+1000*(N-a-b) == Y:
print(a,b,N-a-b)
exit()
print(-1,-1,-1) |
p03471 | s600363774 | Accepted | n, y = map(int, input().split())
for i in range(n + 1):
for j in range(n - i + 1):
if i*10000 + j*5000 + (n - i - j)*1000 == y:
print(i, j, n - i - j)
exit()
print("-1 -1 -1")
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.