problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03471 | s157231486 | Accepted | n,y = map(int,input().split())
a,b,c = (-1,-1,-1)
for i in range(n+1):
for j in range(n+1-i):
if 10000*i + 5000*j + 1000*(n-i-j) == y:
a,b,c = (i,j,n-i-j)
break
print(a,b,c) |
p03471 | s215530844 | Accepted | N,Y = map(int,input().split())
flg = 0
x = -1
y = -1
z = -1
for i in range(Y//10000+1):
for j in range(min(N-i,Y//5000)+1):
k = N-i-j
if k>=0 and 10000*i+5000*j+k*1000==Y:
flg = 1
x = i
y = j
z = k
break
if flg==1:break
print(x,y,z)
|
p03471 | s426227117 | Accepted | def resolve():
N, Y = map(int, input().split())
resx, resy, resz = (-1, -1, -1)
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 | s468442859 | Accepted | N, Y = [int(i) for i in input().rstrip().split(' ')]
cnt = [int(-1)for i in range(3)]
for A in range(N+1):
for B in range(N+1 - A):
C = N - A - B
calc = A*10000 + B*5000 + C*1000
if calc == Y:
cnt = [A, B, C]
break
else:
continue
break
print(' '.join(map(str,cnt)))
|
p03471 | s481375379 | 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==y-1000*(n-i-j):
print(i,j,n-i-j)
exit()
print(-1,-1,-1)
|
p03471 | s033147453 | Accepted | import numpy as np
if __name__ == "__main__":
N, Y = map(int, input().split())
ans = [-1, -1, -1]
for i in range(N+1):
for j in range(N+1-i):
k = N - i - j
y = 10000 * i + 5000 * j + 1000 * k
if y == Y:
ans = [i, j, k]
print("{} {} {}".format(ans[0], ans[1], ans[2])) |
p03471 | s852412994 | 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(i,j,k)
exit()
print(-1,-1,-1) |
p03471 | s273968763 | 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
break
print(*answer) |
p03471 | s666468021 | Accepted | n,Y = map(int,(input().split()))
x = -1
y = -1
z = -1
for i in range(n+1):
for j in range(n+1):
k=Y-i*10000-j*5000
if k==(n-i-j)*1000 and k>=0:
x=i
y=j
z=int(k/1000)
print(x,y,z)
|
p03471 | s784624920 | Accepted | n,c=map(int,input().split())
x,y,z=-1,-1,-1
for i in range(n+1):
for j in range(n+1-i):
if 10000*i+5000*j+(n-i-j)*1000==c:
x,y,z=i,j,n-i-j
print(x,y,z)
exit()
print(x,y,z) |
p03471 | s069174862 | Accepted | n,y = [int(e) for e in input().split()]
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:
print(str(i)+" " +str(j) + " " + str(n-i-j))
break
else:
continue
break
else:
print("-1 -1 -1") |
p03471 | s168659076 | Accepted | N,Y=map(int,input().split())
answer=0
for n in range(0,N+1):
for n_ in range(0,N+1-n):
n__=N-n-n_
if 10000*n+5000*n_+1000*n__==Y:
answer=1
kotae=str(n)+' '+str(n_)+' '+str(n__)
break
if answer==0:
print(-1,-1,-1)
else:
print(kotae)
|
p03471 | s607627704 | Accepted | n, y = map(int, input().split())
for i in range(n + 1):
for ii in range(n - i + 1):
if 10000 * i + 5000 * ii + 1000 * (n - i - ii) == y:
print('{} {} {}'.format(i, ii, n - i - ii))
exit()
print('-1 -1 -1')
|
p03471 | s383963596 | Accepted | N, Y = map(int, input().split())
Y /= 1000
x = 10
y = 5
z = 1
for i in range(N+1):
for j in range(N+1):
if x*i+y*j+(N-i-j) == Y and i+j <= N:
print(i, j, N-i-j)
exit()
print(-1, -1, -1)
|
p03471 | s866408563 | Accepted | N, Y = map(int, input().split())
ans = 0
a = 0
b = 0
c = 0
for a in range(N+1):
for b in range(N-a+1):
c = N - a - b
if (a*10000 + b*5000 + c*1000) == Y:
ans = 1
x = a
y = b
z = c
break
if ans == 1:
print(x,y,z)
else:
print( '-1 -1 -1') |
p03471 | s800947319 | Accepted | n,y=map(int,input().split())
for a in range(n+1):
for b in range(n+1):
c=(y-(a*10000+b*5000))//1000
if a+b+c==n and c>=0:
print(a,b,c)
exit()
print(-1,-1,-1) |
p03471 | s650059933 | Accepted | from itertools import *
N,Y = map(int,input().split())
if 10000*N < Y:
print(-1,-1,-1)
exit()
for i in range(N):
for j in range(N-i):
k = N-i-j
for xyz in permutations([i,j,k],3):
x,y,z = xyz
if 10000*x + 5000*y + 1000*z == Y:
print(x,y,z)
exit()
print(-1,-1,-1) |
p03471 | s713188811 | Accepted | def main():
N,Y=map(int,input().split())
for i in range(Y//10000+1):
tY=Y-10000*i
for j in range(tY//5000+1):
k=(tY-5000*j)//1000
if i+j+k==N:
print(i,j,k)
return
print("-1 -1 -1")
main() |
p03471 | s245386953 | Accepted | N,Y = map(int,input().split())
for a in range(N+1):
for b in range(N+1):
val = Y-10000*a-5000*b
n = N-a-b
if n>=0 and val >=0 and n*1000==val:
print(a,b,N-a-b);exit()
print('-1 -1 -1') |
p03471 | s570286695 | 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 | s068478336 | Accepted | N, Y = [int(x) for x in input().split()]
for x in range(Y // 10000 + 1): # 1万円札の枚数
for y in range((Y - 10000 * x) // 5000 + 1): # 5千円札の枚数
if 10000 * x + 5000 * y + 1000 * (N - x - y) == Y:
print(x, y, N - x - y)
break
else:
continue
break
else:
print(-1, -1, -1) |
p03471 | s056447267 | Accepted | from sys import exit
n, y = map(int, input().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 | s332826519 | Accepted | N, Y = 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 10000*x + 5000*y + 1000*z == Y and (0<= z <= N):
ans = [x, y, z]
break
print(*ans) |
p03471 | s475780170 | Accepted | n, money = map(int, input().split())
ans = [-1, -1, -1]
flag = False
money = money // 1000
for i_1 in range(n+1):
for j_5 in range(n - i_1 + 1):
if (money - i_1 - j_5 * 5) == 10 * (n - i_1 - j_5):
flag = True
ans = [i_1, j_5, n - i_1 - j_5]
if flag:
break
print(ans[2], ans[1], ans[0])
|
p03471 | s165581306 | 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(i,j,k)
exit()
print(-1,-1,-1)
|
p03471 | s782521851 | Accepted | N, Y= map(int, input().split())
flag = False
for i in range(N+1):
zandaka = Y - (10000*i)
for j in range(N+1-i):
k = (zandaka - 5000*j)//1000
if(i + j + k == N):
flag = True
print(i, j, k)
break
if flag is True:
break
if flag is False:
print(-1,-1,-1) |
p03471 | s133921123 | Accepted | N, Y = map(int, input().split())
a = 0
for i in range(N+1):
for ii in range(N+1):
iii = N - i - ii
if iii < 0:
break
ans = 10000 * i + 5000 * ii + 1000 * iii
if ans == Y:
print(i,ii,iii)
a += 1
break
if a != 0:
break
if a == 0:
print(-1,-1,-1)
|
p03471 | s597709417 | Accepted | # -*- coding: utf-8 -*-
from sys import exit
n, y = map(int, input().split())
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)
exit()
print(-1, -1, -1) |
p03471 | s605667360 | Accepted | n,y = map(int, input().split())
for a in range(n+1):
for b in range(n+1):
c = n - a - b
if (10000*a + 5000*b + 1000*c) == y and a + b + c == n and c >= 0:
print(a,b,c)
exit(0)
print(-1,-1,-1) |
p03471 | s686102294 | 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 | s698028972 | 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 | s265662571 | Accepted | import sys
n,y=map(int,input().split())
for i in range(y//10000+1):
for j in range(y//5000+1):
k=n-(i+j)
if k<0:
continue
if 10000*i+5000*j+1000*k==y:
print(' '.join([str(i),str(j),str(k)]))
sys.exit()
print(' '.join(['-1','-1','-1'])) |
p03471 | s274315860 | Accepted | # abc085_c.py
N,Y = map(int,input().split())
for i in range(N+1):
for j in range(N+1):
k = N-i-j
if i*10000 + j*5000 + k*1000 == Y and k>=0:
print(i,j,k)
exit()
print(-1,-1,-1)
|
p03471 | s318752805 | 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 10000*x+5000*y+1000*z==Y:
print(x,y,z)
exit()
print(-1,-1,-1) |
p03471 | s597988493 | Accepted | N,Y = input().split()
N = int(N)
Y_k=int(Y)/1000
answer = [-1,-1,-1]
for i in range(N+1):
for j in range(N+1 - i):
k = N-i-j
if 10*i + 5*j + 1*k == Y_k:
answer = [i,j,k]
print(answer[0],answer[1],answer[2])
|
p03471 | s139238279 | Accepted | n, y = map(int, input().split())
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:
print("{0} {1} {2}".format(a,b,c))
exit()
print("-1 -1 -1") |
p03471 | s908542652 | Accepted | n,y=map(int,input().split())
flag=True
for i in range(n+1):
if flag:
for j in range(n-i+1):
k=n-i-j
if 10000*i+5000*j+1000*k==y:
print('{} {} {}'.format(i,j,k))
flag=False
break
else:
break
if flag:
print('-1 -1 -1') |
p03471 | s164603656 | Accepted | n, m = 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 x * 10000 + y * 5000 + z * 1000 == m:
answer = (x, y, z)
break
else:
continue
print(*answer)
|
p03471 | s298615390 | Accepted | N,Y = map(int,input().split())
for i in range(N+1):
for j in range(N+1):
m = Y - (10000*i+j*5000)
if m >= 0 and (i+j+m//1000) == N:
print(i,j,m//1000)
exit()
print(-1,-1,-1) |
p03471 | s707486885 | Accepted | n, y = map(int, input().split())
def search():
for i in range(n+1):
for j in range(n-i+1):
k = (n - i - j)
if i * 10000 + j * 5000 + 1000 * k == y:
return i, j, k
return -1, -1, -1
print(*search()) |
p03471 | s568245267 | 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 i *10000 + j * 5000 + k *1000 == y:
print(i,j,k)
exit()
print('-1 -1 -1') |
p03471 | s933305705 | Accepted | N, Y = map(int, input().split())
for x in range(min(Y // 10000 + 1, N + 1)):
for y in range(min(Y // 5000 + 1, N + 1)):
r = Y - x * 10000 - y * 5000
if r >= 0 and r // 1000 == N - x - y:
print(x, y, r // 1000)
exit()
print(-1, -1, -1) |
p03471 | s630086306 | Accepted | n,y = map(int,input().split())
ans = [-1,-1,-1]
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:
ans = [i,j,n-i-j]
print(*ans) |
p03471 | s947965357 | Accepted | n,Y = map(int,(input().split()))
x = 0
y = 0
z = 0
f = True
for i in range(n+1):
for j in range(n+1):
k=Y-i*10000-j*5000
if k==(n-i-j)*1000 and k>=0:
x=i
y=j
z=int(k/1000)
f=False
if f :
x = -1
y = -1
z = -1
print(x,y,z)
|
p03471 | s076685150 | 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 | s145372390 | Accepted | import sys
num = sys.stdin.readline().split(' ')
N = int(num[0])
Y = int(num[1])
for x in range(N+1):
for y in range(N+1):
if 10000 * x + 5000 * y + 1000*(N-x-y) == Y and N-x-y >= 0:
print(str(x)+' '+str(y)+' '+str(N-x-y))
sys.exit()
else:
continue
print('-1 -1 -1')
|
p03471 | s976188940 | Accepted | N,Y = map(int,input().split())
for x in range(N+1):
for y in range(N+1):
z = N-x-y
if 0<=z and 10000*x+5000*y+1000*z==Y:
print(x,y,z)
exit()
print(-1,-1,-1) |
p03471 | s278184828 | 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 x * 10000 + y * 5000 + z * 1000 == Y:
print(x, y, z)
exit()
print(-1, -1, -1)
|
p03471 | s243527559 | Accepted | n,y=map(int,input().split())
#1000円がn-a-b枚、5000円がa枚、10000万円がb枚とする
for i in range(0,n+1):
for j in range(0,n-i+1):
if 1000*(n-i-j)+5000*i+10000*j==y:
print(j,i,n-i-j)
exit()
print(-1,-1,-1) |
p03471 | s255919943 | Accepted | N, Y = map(int, input().split())
for a in range(Y // 10000 + 1):
for b in range((Y - 10000 * a) // 5000 + 1):
if a + b + (Y - 10000 * a - 5000 * b) // 1000 == N:
print(a, b, N - a - b)
exit()
print(-1, -1, -1)
|
p03471 | s585663210 | Accepted | #k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [input() for _ in range(n)]
n,y=map(int, input().split())
for a in range(n+1):
for b in range(n+1):
c = max(n - (a+b), 0)
if (a+b+c == n):
if (10000*a+5000*b+1000*c == y):
print(a,b,c)
exit()
print(-1,-1,-1)
|
p03471 | s882021814 | Accepted | n,Y=map(int,input().split())
ans=0
for x in range(0,n+1):
if ans>0:
break
for y in range(0,n+1-x):
z=n-x-y
if 10000*x+5000*y+1000*z==Y:
ans+=1
print(str(x)+' '+str(y)+' '+str(z))
if ans>0:
break
if ans==0:
print(str(-1)+' '+str(-1)+' '+str(-1)) |
p03471 | s996051314 | Accepted | n,y = map(int, input().split())
s = [-1,-1,-1]
for i in range(n+1):
for j in range(n+1-i):
if 10000*i + 5000*j +1000*(n-i-j) == y:
s = [i,j,n-i-j]
break
print(*[x for x in s]) |
p03471 | s962588441 | Accepted | N,Y=map(int,input().split())
ans=-1,-1,-1
for i in range(N+1):
for j in range(N+1-i):
if 1<=N<=2000 and 10000*i+5000*j+1000*(N-i-j)==Y:
ans=i,j,N-i-j
print(*ans) |
p03471 | s074071376 | Accepted | n,y=map(int,input().split())
count=0
for i in range(n+1):
for j in range(n+1):
k=n-i-j
if k>=0 and k<=n:
if i*10000+j*5000+k*1000==y:
print(i,j,k)
exit()
print(-1,-1,-1) |
p03471 | s717264293 | 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(i,j,k)
exit()
print(-1,-1,-1) |
p03471 | s405630279 | Accepted | #-*-coding:utf-8-*-
import sys
def main2():
n,y=map(int,input().split())
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)
sys.exit()
print(-1,-1,-1)
if __name__=="__main__":
main2() |
p03471 | s787711346 | Accepted | N, Y = map(int, input().split())
for i in range(Y // 10000 + 1):
for j in range((Y - 10000 * i) // 5000 + 1):
if 10000 * i + 5000 * j == Y - 1000 * (N - i - j) and N - i - j >= 0:
print(i, j, N - i - j)
exit()
print(-1, -1, -1) |
p03471 | s036062353 | 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
break
print(*answer) |
p03471 | s974993259 | Accepted | n, y = map(int, input().split())
for i in range(n + 1):
for j in range(n + 1 - i):
k = (y - i * 10000 - j * 5000) // 1000
if i + j + k == n:
print(i, j, k)
exit()
print(-1, -1, -1) |
p03471 | s143666938 | Accepted | """
tuple
"""
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+z*1000)==Y:
ans = x,y,z
break
else :
continue
break
print(*ans)
|
p03471 | s054316931 | Accepted | N, Y = map(int, input().split())
for x in range(N+1):
for y in range(N+1):
if 10000*x + 5000*y + 1000*(N-(x+y)) == Y and N-(x+y) >= 0:
print(x, y, N-(x+y))
exit()
print(-1,-1,-1) |
p03471 | s778841238 | Accepted | N, Y = map(int, input().split())
ans = [-1, -1, -1]
for i in range(Y//1000+1):
for j in range(Y//5000+1):
k = (Y - 10000*i - 5000*j)//1000
if k < 0:
break
if i + j + k == N:
ans = i, j, k
# print(10000*ans[0] + 5000*ans[1] + 1000*ans[2])
print(*ans)
|
p03471 | s491539957 | Accepted | N, Y = map(int, input().split())
flag = False
for x in range(N + 1):
for y in range(0, N - x + 1):
if 10000 * x + 5000 * y + 1000 * (N - x - y) == Y:
print(x, y, N - x - y)
flag = True
exit()
if (not flag): print("-1 -1 -1")
|
p03471 | s429471898 | Accepted | import math
n,y = map(int,input().split())
c = 0
for a in range(n+1):
for b in range(n+1):
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 | s327712445 | Accepted | n,y=map(int,input().split())
y //= 1000
for i in range(n+1):
p,q = divmod(y-n-i,4)
if q == 0 and i <= p-i <= n:
print(i,p-2*i, n-p+i)
exit()
print("-1 "*3) |
p03471 | s799828351 | Accepted | import sys
input = sys.stdin.readline
N, Y = map(int, input().split())
Y //= 1000
for i in range(N + 1):
x = Y - 10 * i
for j in range(N - i + 1):
y = x - 5 * j
if y < 0: continue
if i + j + y == N:
print(i, j, y)
exit(0)
if x + i == N:
print(i, 0, x)
exit(0)
print(-1, -1, -1) |
p03471 | s680191089 | Accepted | N,Y = map(int,input().split())
array = []
for i in range(N+1):
for j in range(N+1-i):
mon = 10000*i+5000*j+1000*(N-i-j)
if mon == Y:
print(i,j,N-i-j)
exit()
print('-1 -1 -1') |
p03471 | s766753283 | Accepted | N, Y = map(int, input().split())
result = []
for a in range(N+1):
for b in range(N+1):
c = max(N - a - b, 0)
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 | s300974919 | Accepted | n,y = map(int, input().split())
def Otoshidama(n):
for i in range(0, y//10000 + 1):
for j in range(0, (y - 10000*i)//5000 + 1):
h = y - 10000*i - 5000*j
if h%1000 == 0 and h >= 0 and i + j + h//1000 == n:
return str(i) + " " + str(j) + " " + str(h//1000)
return "-1 -1 -1"
print(Otoshidama(n)) |
p03471 | s697091686 | Accepted | n, y = map(int, input().split())
ans = ''
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:
ans = f'{i} {j} {k}'
break
if ans:
break
print(ans if ans else '-1 -1 -1') |
p03471 | s663193017 | Accepted | n,m = map(int,input().split())
total = 0
for a in range(n+1):
for b in range(n+1):
total=10000*a+5000*b+1000*(n-a-b)
if total == m and a+b <=n:
print(a,b,n-a-b)
exit()
print(-1,-1,-1) |
p03471 | s093035978 | Accepted | n,y = map(int, input().split())
a = -1
b = -1
c = -1
for i in range(n+1):
for j in range(n+1):
k = n-i-j
if k < 0:
pass
else:
yy = 10000*i + 5000*j + 1000*k
if yy == y:
a = i
b = j
c = k
break
print(a,b,c) |
p03471 | s107259367 | Accepted | N, Y = map(int, input().split())
match = False
for a in range(N+1):
for b in range(N+1):
c = N - (a + b)
y = 10000*a + 5000*b + 1000*c
if c >= 0 and y == Y:
match = True
break
if match:
break
if match:
print(a, b, c)
else:
print(-1, -1, -1) |
p03471 | s745947640 | 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 | s809105846 | Accepted | def main():
N, Y = map(int,input().split())
x, y, z = [0, 0, 0]
for i in range(N + 1):
for j in range(N + 1 - i):
if i * 10000 + j * 5000 + (N-i-j) * 1000 == Y and N-i-j >= 0:
print(i, j , N-i-j)
return
print(-1, -1, -1)
if __name__ == "__main__":
main()
|
p03471 | s529126690 | Accepted | a,b=map(int,input().split())
t=b/1000
List=[-1,-1,-1]
for l in range(a+1):
if (t-9*l-a)%4==0 and a-l-(t-9*l-a)/4>=0 and t-9*l-a>=0:
s=int((t-9*l-a)/4)
List=[l,s,a-l-s]
break
print(*List)
|
p03471 | s486512988 | Accepted | n , y = map(int, input().split())
i = y//10000
j = y//5000
k = y//1000
for p in range(i+1):
for q in range(j+1):
if (n-p-q)>=0 and (p*10000)+(q*5000)+((n-p-q)*1000)==y:
print(p, q, n-p-q)
exit()
print(-1, -1, -1) |
p03471 | s888292300 | Accepted | N, Y = map(int,input().split())
x, y, z = -1, -1, -1
k = 0
for i in range(N+1):
for j in range(0,N-i+1):
k = N - i - j
if 10000*i + 5000*j + 1000*k == Y :
x, y, z = i, j, k
break
print(x, y, z) |
p03471 | s114035452 | Accepted | import sys
n, ans = map(int, input().split())
for x in range(n + 1):
for y in range(n + 1 - x):
if n - x - y >= 0:
if (10000 * x + 5000 * y + 1000 * (n - x - y)) == ans:
print(x, y, n - x - y)
sys.exit()
print('-1 -1 -1') |
p03471 | s725792635 | Accepted | N,Y = [int(i) for i in input().split()]
for i in range(N+1):
for j in range(N-i, -1, -1):
money = i*10000 + j*5000 + (N - i - j)*1000
if money == Y:
print(i,j,N-i-j)
exit()
elif money < Y:
break
print(-1,-1,-1) |
p03471 | s763183702 | Accepted | n, t = map(int, input().split())
sen = -1
gos = -1
man = -1
for i in range(n+1):
for j in range(n-i+1):
if i * 1000 + j*5000 + (n-i-j)*10000 == t:
sen = i
gos = j
man = n-i-j
print(man, gos, sen)
|
p03471 | s328505750 | Accepted | n,y = list(map(int,input().split()))
y /= 1000
ans = [0,0,0]
# print(y)
for i in range(n+1):
for j in range(0,n+1-i):
a = i*10 + j*5
b = i+j
# print(a,b)
if a + (n-(i+j)) == y:
ans = [i,j,n-(i+j)]
if sum(ans) >0:
print(ans[0],ans[1],ans[2])
else:
print(-1,-1,-1) |
p03471 | s787821389 | Accepted | n, k = map(int, input().split())
for x in range(n+1):
for y in range(n+1):
if x + y <= n:
z = n - x - y
result = 10000*x + 5000*y + 1000*z
if result == k:
print("{} {} {}".format(x, y, z))
exit()
print("-1 -1 -1") |
p03471 | s598068418 | Accepted | def ans(N, Y):
for m in range(N + 1):
for g in range(N + 1 - m):
s = N - m - g
sum = m * 10000 + g * 5000 + s * 1000
if sum == Y:
return m, g, s
return -1, -1, -1
def read():
N, Y = [int(a) for a in input().split(' ')]
return N, Y
def write(a):
print(a[0], a[1], a[2])
if __name__ == '__main__':
N, Y = read()
write(ans(N, Y))
|
p03471 | s845271737 | Accepted | #!/usr/bin/env python3
import sys
n, y = map(int, input().split())
for i in range(n + 1):
for j in range(n + 1):
k = n - i - j
if (k < 0) or (i + j + k != n):
continue
if (i * 10000) + (j * 5000) + ((k) * 1000) == y:
print(i, j, k)
sys.exit()
print(-1, -1, -1) |
p03471 | s753583423 | Accepted | N, Y = map(int, input().split())
flag = False
for x in range(N, -1, -1):
for y in range(N - x, -1, -1):
z = N - x - y
if 10000 * x + 5000 * y + 1000 * z == Y:
print(x, y, z)
bool = True
exit()
if not flag:
print(-1, -1, -1)
|
p03471 | s648055993 | Accepted | n, y = map(int, input().split())
judge = "no value"
for i in range(n+1):
if judge == "Found it!":
break
for j in range(n+1):
z = n - i - j
value = z * 10000 + i * 5000 + j *1000
if value == y and z >= 0:
print(z, i , j)
judge = "Found it!"
break
if judge == "no value":
print(-1, -1, -1)
|
p03471 | s080685479 | Accepted | n, y = map(int, input().split())
for i in range(n+1):
for j in range(n+1):
num_sen = n - i - j
if num_sen < 0:
continue
if 10000 * i + 5000 * j + 1000 * num_sen == y:
print(i, j, num_sen)
exit()
print(-1, -1, -1)
|
p03471 | s980594559 | Accepted | n, y = map(int, input().split())
y //= 1000
for i in range(n + 1):
for j in range(n + 1 - i):
k = n - i - j
if y == 10 * i + 5 * j + k:
print(i, j, k)
exit()
print(-1, -1, -1)
|
p03471 | s683122136 | Accepted | N, Y = map(int, input().split())
ans = [-1, -1, -1]
ok = False
for x in range(N+1):
for y in range((N+1)-x):
if 10000 * x + 5000 * y > Y:break
z = N - x- y
if 10000 * x + 5000 * y + 1000 * z == Y:
print(x, y, z)
exit()
if not ok: print(-1, -1, -1) |
p03471 | s607149599 | Accepted | import sys
input = sys.stdin.readline
def main():
N, Y = map(int, input().split())
ans = "-1 -1 -1"
for i in range(N+1):
for j in range(N+1-i):
if 10000 * i + 5000 * j + 1000 * (N - i - j) == Y:
ans = "{} {} {}".format(i, j, N-i-j)
break
if ans != "-1 -1 -1":
break
print(ans)
if __name__ == '__main__':
main()
|
p03471 | s363505877 | Accepted | N, Y = map(int,input().split())
for i in range(N + 1):
for j in range(N - i + 1):
if Y == 1000*i + 5000*j + 10000*(N - j - i):
print(N - j - i, j, i)
exit(0)
print(-1,-1,-1) |
p03471 | s902180593 | Accepted |
def solve(N,Y):
for x in range(N+1):
for y in range(N-x+1):
z = N-(x+y)
if(10*x + 5*y + z == Y):
print("{} {} {}".format(x,y,z))
return 0
print("-1 -1 -1")
N,Y = map(int, input().split())
Y //= 1000
solve(N,Y) |
p03471 | s591022083 | Accepted | n, y = map(int, input().split())
stop = n + 1
for m in range(stop):
for g in range(stop - m):
s = n - m - g
if y == 10000 * m + 5000 * g + 1000 * s:
print(m, g, s, sep=" ")
break
else:
continue
break
else:
print("-1 -1 -1") |
p03471 | s540116868 | Accepted | #Nはお札の枚数、Yは合計金額
N,Y = map(int,input().split())
yukiti = 10000
higuti = 5000
noguti = 1000
re_yukiti = -1
re_higuti = -1
re_noguti = -1
for i in range(N+1):
for j in range(N+1-i):
k = N - i - j
amount = yukiti*i + higuti*j + noguti*k
if amount == Y:
re_yukiti = i
re_higuti = j
re_noguti = k
break
print(re_yukiti,re_higuti,re_noguti) |
p03471 | s406028850 | Accepted | n,y = map(int,input().split())
f = False
for a in range(n+1):
for b in range(n+1):
c = n-(a+b)
if 10000*a+5000*b+1000*c == y and a+b+c == n and c>= 0:
f = True
print(a,b,c)
if f == True:
break
if f == False:
print('-1 -1 -1') |
p03471 | s636500680 | Accepted | #085_C
n,y=map(int,input().split())
for a in range(0,n+1):
mon=y-10000*a
cnt=n-a
if (mon-1000*cnt)%4000==0 and (5000*cnt-mon)%4000==0:
b=(mon-1000*cnt)//4000
c=(5000*cnt-mon)//4000
if 0<=b<=n and 0<=c<=n:
print(a,b,c)
exit()
print(-1,-1,-1) |
p03471 | s888967837 | Accepted | def main():
N, Y = map(int, input().split())
for i in range(0, N+1):
for j in range(0, N+1):
if N-i-j < 0:
continue
if i * 10000 + j * 5000 + (N-i-j) * 1000 == Y:
print(i, j, (N-i-j))
return
print(-1, -1, -1)
main() |
p03471 | s862219206 | Accepted | N,Y = map(int,input().split())
for i in range(N+1):
for j in range(N+1):
a = i
b = j
c = N-i-j
if c < 0:
continue
else:
price = a*1000+b*5000+c*10000
if price == Y:
print(c,b,a)
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.