problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03471 | s338423661 | Accepted | li=list(map(int,input().split()))
n=li[0]
y=li[1]
a,b,c=-1,-1,-1
for i in range(n+1):
for j in range(n-i+1):
if y==10000*i+5000*j+1000*(n-i-j):
a=i
b=j
c=n-i-j
break
print(a,b,c)
|
p03471 | s444597890 | Accepted | n,y = map(int, input().split())
ans = -1, -1, -1
for i in range(n+1):
for j in range(n-i+1):
if i*10000+j*5000+(n-i-j)*1000==y:
ans = i, j, (n-i-j)
print(*ans)
|
p03471 | s287821378 | Accepted | N, Y =map(int, input().split())
c = 0
for n in range(N+1):
if c == 1:
break
for m in range(N-n+1):
l = N -n - m
if Y ==( n*10000 + m *5000 + l *1000) and (n + m + l) == N:
print(n , m , l)
c = 1
break
if c != 1:
print(-1 , -1 , -1) |
p03471 | s151584378 | Accepted | def main():
N, Y = list(map(int, input().split()))
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)
return
print(-1, -1, -1)
if(__name__ == '__main__'):
main() |
p03471 | s701732409 | Accepted | # -*- coding: utf-8 -*-
import sys
a=10000
b=5000
c=1000
def check(y, i,j,k):
if(y == i * a + j * b + k * c):
print(i,j,k)
sys.exit(0)
n, y = map(int, input().split())
for i in range(n,-1,-1):
for j in range(n-i,-1,-1):
k = n-i-j
check(y,i,j,k)
print(-1,-1,-1)
|
p03471 | s987667509 | Accepted | n, y = map(int, input().split())
for m10 in range(n+1):
for m5 in range(n-m10 +1):
m1 = n - m10 - m5
if m10 *10000 + m5 * 5000 + m1 * 1000 == y:
print(m10, m5, m1)
exit(0)
print("-1 -1 -1")
|
p03471 | s925396513 | Accepted | import sys
N,Y = map(int,input().split())
for x in range(0,N+1):
for y in range(0,N+1-x):
if 10000*x+5000*y + (N-x-y)* 1000 == Y:
print('%d %d %d' % (x,y,N-x-y))
sys.exit(0)
print('-1 -1 -1')
|
p03471 | s024170677 | Accepted | n,m = 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 == m and x + y + z == n and 0 <= z <=n):
print(x,y,z)
exit()
print('-1 -1 -1') |
p03471 | s803886192 | Accepted | N,Y=map(int,input().split())
Y//=1000
for i in range(N+1):
for j in range(N-i+1):
if i*10+j*5+(N-i-j)==Y:
print(i,j,N-i-j)
exit()
print(-1,-1,-1) |
p03471 | s649280619 | Accepted | N, Y = map(int, input().split())
res10000 =res5000 = res1000 = -1
for x in range(N+1):
for y in range(N+1-x):
z = N-x-y # zは決まっているので、ループを減らして、計算量を減らす！
if 10000*x + 5000*y + 1000*z == Y:
res10000 = x
res5000 = y
res1000 = z
print(res10000, res5000, res1000) |
p03471 | s818261056 | Accepted | N, Y = map(int, input().split())
ans10000, ans5000, ans1000 = -1, -1, -1
for i in range(0, N+1):
for j in range(0, (N+1)-i):
k = N - (i + j)
if k >= 0:
o = 10000*i + 5000*j + 1000*k
if o == Y:
ans10000 = i
ans5000 = j
ans1000 = k
print(ans10000, ans5000, ans1000) |
p03471 | s755462631 | 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 | s324469714 | 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 | s714111017 | Accepted | N,Y = map(int,input().split())
for x in range(N+1):
for y in range(N - x + 1):
if 10000*x+5000*y+1000*(N - x - y) == Y:
print(x,y,N-x-y)
exit()
print("-1 -1 -1") |
p03471 | s748750322 | Accepted | import sys
n,y=map(int,input().split())
t=True
for i in range(n+1):
for j in range(n+1):
if ((10000*i+5000*j+1000*(n-i-j))==y) & (i+j<=n):
t=False
print(i, j, n-i-j)
sys.exit(0)
if t:
print("-1 -1 -1") |
p03471 | s924320129 | Accepted | n, y = map(int, input().split())
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)
exit()
print("-1 -1 -1")
|
p03471 | s765887978 | Accepted | n,y=[int(i) for i in input().split()]
#aの上限
a_num=y//10000
#bの上限
b_num=y//5000
com=[]
for a in range(a_num+1):
for b in range(b_num+1):
if 10000*a+5000*b+1000*(n-(a+b))==y and 0<=n-(a+b):
com.append([a,b,n-(a+b)])
break
if com==[]:
print("-1 -1 -1")
else:
print(com[0][0],com[0][1],com[0][2])
|
p03471 | s795032537 | Accepted | N,Y=map(int,input().split())
x=-1
y=-1
z=-1
for i in range(N+1):
for j in range(N-i+1):
if i*10000+j*5000+(N-i-j)*1000==Y:
x=i
y=j
z=N-i-j
print(x,y,z) |
p03471 | s616174381 | Accepted | N, Y = map(int, input().split())
Y //= 1000
for a in range(Y//10 + 1):
for b in range((Y - 10 * a) // 5 + 1):
c = (Y - 10 * a - 5 * b)
if a + b + c == N:
print(a, b, c)
exit()
print(-1, -1, -1) |
p03471 | s960441885 | Accepted | import sys
N, Y = list(map(int, input().split()))
x, y, z = -1, -1, -1
money = 0
for i in range(N + 1):
for j in range(N - i + 1):
if Y == i * 10000 + j * 5000 + (N - i - j) * 1000:
print(i, j, N - i - j)
sys.exit()
print(x, y, z)
|
p03471 | s060599053 | Accepted | N,Y = map(int,input().split())
Y //= 1000
for i in range(N+1):
for j in range(N+1-i):
if 10*i + 5*j + 1*(N-i-j) == Y:
print(i,j,N-i-j)
exit()
print(-1,-1,-1)
|
p03471 | s752590287 | Accepted | N, Y = list(map(int, input().split()))
ans = 0
for y in range(N +1):
for w in range(N +1):
if y*10000+w*5000+(N-y-w)*1000 == Y and N-y-w >= 0:
ans = str(y)+" "+str(w)+" "+str(N-y-w)
if ans == 0:
print(-1, -1, -1)
else:
print(ans) |
p03471 | s469682469 | Accepted | n, y = map(int, input().split())
for i in range(n, -1, -1):
for j in range(n-i, -1, -1):
if i *10000 + j * 5000 + (n-i-j) * 1000 == y:
print(str(i) + ' ' + str(j) + ' ' + str(n-i-j))
exit(0)
print("-1 -1 -1") |
p03471 | s798894988 | 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 | s651385056 | Accepted | n, y = map(int, input().split())
y /= 1000 #10円札,5円札,1円札
for i in range(n+1): # i = 10円札の枚数
for j in range(n-i+1): # j = 5円札の枚数
k = n - i - j
if 10*i + 5*j + k == y:
print(i, j, k)
exit()
print('-1 -1 -1') |
p03471 | s228573702 | Accepted | N, Y = map(int, input().split())
for n_10000 in range(min(N+1, Y//10000+1)):
for n_5000 in range(min(N-n_10000+1, (Y-n_10000*10000)//5000+1)):
n_1000 = N - n_10000 - n_5000
if n_10000 * 10000 + n_5000 * 5000 + n_1000 * 1000 == Y:
print(n_10000, n_5000, n_1000)
exit()
print('-1 -1 -1') |
p03471 | s298989974 | 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 | s572248156 | Accepted | N, Y = map(int, input().split())
for i in range(min(Y//10000, N)+1):
for j in range(min((Y-(10000*i))//5000, N-i)+1):
zankin = Y - (10000*i) - (5000*j)
if i + j + zankin //1000 == N:
print(i, j, zankin//1000)
exit()
print(-1, -1, -1) |
p03471 | s277527697 | 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 | s821332009 | Accepted | N, Y = map(int, input().split())
a, b, c = -1, -1, -1
for i in range(0, int(Y / 10000) + 1):
for j in range(0, N - i + 1):
if 10000*i + 5000*j + 1000*(N - i - j) == Y:
a, b, c = i, j, N - i - j
break
else:
continue
break
print(a, b, c) |
p03471 | s480987929 | Accepted | n,y=map(int,input().split())
for i in range(2001):
for j in range(2001):
if (y-(10000*i+5000*j))//1000==n-i-j and n-i-j>=0:
print(i,j,n-i-j)
exit()
print(-1,-1,-1) |
p03471 | s415135758 | Accepted | n,y=map(int,input().split())
y //=1000
for i in range(n+1):
for j in range(n-i+1):
if n -(i+j) < 0:
break
if 9*i+4*j+n == y:
print(i,j,n-(i+j))
exit()
print('-1','-1','-1') |
p03471 | s964124229 | Accepted | N = input().split()
N = [int(i) for i in N]
judge = False
for i in range(0, N[0]+1):
for j in range(0, N[0]+1-i):
k = N[0]-i-j
if(10000*i + 5000*j + 1000*k == N[1]):
judge = True
break
else:
continue
break
if(judge):
print(i, j, k)
else:
print(-1, -1, -1)
|
p03471 | s869003096 | Accepted | n,y=list(map(int,input().split()))
res10000=-1
res5000=-1
res1000=-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:
res10000,res5000,res1000=i,j,k
break
print('{} {} {}'.format(res10000,res5000,res1000)) |
p03471 | s393595109 | Accepted | # solution
import io
nim, mike = map(int, input().split())
for i in range(nim + 1):
for j in range(nim - i + 1):
if i * 10000 + j * 5000 + (nim - i - j) * 1000 == mike:
print(i, j, nim - i - j)
exit()
print("-1 -1 -1") |
p03471 | s929032822 | Accepted | #coding: utf-8
import math
import heapq
import bisect
import numpy as np
from collections import Counter
#from scipy.misc import comb
N,Y = map(int, input().split())
a = b = c = -1
for i in range((Y//10000)+1):
for j in range((Y-10000*i)//5000+1):
s = 10000*i + 5000*j + 1000*(N-i-j)
if s == Y:
a,b,c = i,j,N-i-j
print(a,b,c) |
p03471 | s110079074 | Accepted | n,y=map(int,input().split())
y//=1000
for ten in range(n+1):
for five in range(n-ten+1):
one=n-ten-five
if ten*10+five*5+one==y:
print(ten,five,one)
exit(0)
print(-1,-1,-1) |
p03471 | s036904952 | Accepted | n, y = map(int,input().split())
def otoshidama():
for i in range(0,n+1):
for j in range(0,n+1-i):
k = n-i-j
if 10000*i + 5000*j + 1000*k == y:
return i,j,k
return -1,-1,-1
a, b, c = otoshidama()
print(a,b,c) |
p03471 | s022270573 | Accepted | N, Y = map(int, input().split())
ans = [-1,-1,-1]
for x in range(0,N+1):
for y in range(0,N-x+1):
z = N - x - y
if x*10000 + y*5000 + z*1000 == Y:
ans[0] = x
ans[1] = y
ans[2] = z
print(ans[0],ans[1],ans[2]) |
p03471 | s790342482 | 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*k + 5000*j + 1000*i == y:
print(k, j, i)
exit()
print(-1,-1,-1)
|
p03471 | s952631527 | Accepted | N, Y = map(int, input().split())
for x in range(N+1):
for y in range(N+1):
z = N - x - y
if Y == x *10000 + y*5000 + z*1000 and z >= 0:
print(x, y, z)
exit()
print(-1, -1, -1) |
p03471 | s984747917 | Accepted | def main2():
t = (input().split(' '))
t = [int(v) for v in t]
if t[0] * 10000 < t[1]:
print('-1 -1 -1')
exit(0)
for i in range(t[0] + 1):
for j in range((t[0] + 1) - i):
if (10000 * i) + (5000 * j) + ((t[0] - i - j) * 1000) == t[1]:
print(i, j, (t[0] - i - j))
exit(0)
print('-1 -1 -1')
if __name__ == '__main__':
main2() |
p03471 | s248841918 | Accepted | n, y = map(int, input().split())
for i in range(n+1):
for j in range(n+1):
k = n - i - j
if 0<=k<=2000 and 10000*i + 5000*j + 1000*k == y :
print(i, j, k)
exit()
print(-1,-1,-1) |
p03471 | s504023920 | Accepted | import sys
N,Y=map(int,input().split())
Y=Y//1000
if N>Y or N*10<Y:
print(-1,-1,-1)
sys.exit()
for i in range(N+1):
for j in range(N-i+1):
k=N-i-j
if i+5*j+10*k==Y:
print(k,j,i)
sys.exit()
print(-1,-1,-1) |
p03471 | s370441221 | 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 10000*x+5000*y+1000*z == Y:
answer = x,y,z
break
else:
continue
break
print(*answer) |
p03471 | s067390987 | Accepted | n, y = map(int, input().split())
total = 0
ans = list()
for a in range(0, n+1, 1):
for b in range(0, n+1, 1):
if a + b <= n:
c = n - (a+b)
total = a*10000 + b*5000 + c*1000
if total == y:
lists = [a,b,c]
ans.append(lists)
else:
break
if ans == []:
answer = ['-1', '-1', '-1']
answer = ' '.join(answer)
else:
answer = [str(i) for i in ans[0]]
answer = ' '.join(answer)
print(answer) |
p03471 | s835921423 | Accepted | N, Y = [int(_) for _ in input().split()]
x = 0
y = 0
z = 0
isOK = False
def sumMoney(x, y, z):
return x*10000+y*5000+z*1000
for z in range(N+1):
for y in range(N-z+1):
x = N-z-y
if sumMoney(x, y, z) == Y:
print(x, y, z)
isOK = True
break
if isOK:
break
if not isOK:
print(-1, -1, -1) |
p03471 | s912102774 | 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 | s524960224 | Accepted | N,Y = map(int,input().split())
break_loop=False
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_loop=True
break
if break_loop:
break
else:
continue
else:
print(-1,-1,-1) |
p03471 | s660449737 | Accepted | n, y = map(int, input().split())
ans = [-1] * 3
i = 0
while i <= n:
j = 0
while j <= n-i:
if i*10000 + j*5000 + (n-i-j)*1000 == y:
ans[0] = i
ans[1] = j
ans[2] = n-i-j
j += 1
i += 1
print(ans[0], ans[1], ans[2]) |
p03471 | s496570465 | Accepted | def main():
N, Y = map(int, input().split())
m = 10000
ft = 5000
t = 1000
for i in range(N+1):
for j in range(N-i+1):
k = N - i - j
if m*i + ft*j + t*k == Y and i + j + k == N:
print(str(i) + ' ' + str(j) + ' ' + str(k))
return
print('-1 -1 -1')
main() |
p03471 | s412626908 | Accepted | N,Y = map(int,(input().split()))
r = Y - N*1000
if r < 0:
print(-1,-1,-1)
else:
for i in range(N+1): #5000
for j in range(N+1-i): #10000
if i*4000 + j*9000 == r:
print(j,i,N-i-j)
break
else:
continue
break
else:
print(-1,-1,-1) |
p03471 | s594512485 | Accepted | N, Y = map(int, input().split())
# 10000x + 5000y + 1000z = Y
# x + y + z = N
flg = False
loopCnt = 0
for x in range(N+1):
for y in range(N+1):
z = N - x - y
total = 10000*x + 5000*y + 1000*z
if total == Y and z >= 0:
print(x, y ,z)
loopCnt += 1
flg = True
break
if flg:
break
if loopCnt == 0:
print(-1, -1, -1) |
p03471 | s571822796 | Accepted | import sys
N, Y = map(int, input().split())
num = min(N, Y//10000)
if 10000*N < Y:
print('-1 -1 -1')
sys.exit()
for i in reversed(range(0, num+1)):
for j in reversed(range(0, N-i+1)):
if 10000*i + 5000*j > Y:
continue
if 10000*i + 5000*j + 1000*(N-i-j) == Y:
print('%d %d %d' % (i, j, N-i-j))
sys.exit()
print('-1 -1 -1')
|
p03471 | s890600225 | Accepted | n,y=map(int,input().split());print(*([(i,j,n-i-j)for i in range(n+1)for j in range(n-i+1)if 9*i+4*j+n==y/1e3]+[(-1,-1,-1)])[0]) |
p03471 | s586695184 | Accepted | import sys
n, Y = map(int, input().split())
for x in range(n + 1):
for y in range(n + 1):
z = (Y - 10000 * x - 5000 * y) / 1000
if x + y + z == n and z >= 0 and z.is_integer():
print(x, y, int(z))
sys.exit()
print("-1 -1 -1")
|
p03471 | s645917147 | Accepted | 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 | s386162781 | Accepted | N,Y=map(int,input().split())
# N=9
# Y=45000
l=0
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:
l=[i,j,k]
pass
if l==0:
l=[-1,-1,-1]
print(*l,sep=' ') |
p03471 | s444102414 | Accepted | 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
if (i*1000 + j*5000 + k*10000) == y:
ans = str(k) + ' ' + str(j) + ' ' + str(i)
break
print(ans) |
p03471 | s876634129 | Accepted | n, y = map(int, input().split())
flag = False
for i in range(n+1):
for j in range(n-i+1):
k = n-i-j
sum = i*10000 + j*5000 + k*1000
if sum == y and flag == False:
print(i, j, k)
flag = True
if flag == False:
print(-1, -1, -1) |
p03471 | s662995036 | Accepted | n,X =map(int,input().split())
count=0
for a in range(n+1):
for b in range(n+1):
if 10000*a + 5000*b + 1000*(n-a-b) == X and n-a-b >=0 and count == 0:
print(a,b,n-a-b)
count+=1
if count==0:
print("-1 -1 -1")
|
p03471 | s579640682 | 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 | s283219183 | 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()
else:
print(-1,-1,-1) |
p03471 | s986731873 | Accepted | n, Y = map(int, input().split())
a = 10000
b = 5000
c = 1000
for x in range(n+1):
for y in range(n+1):
z = n-x-y
if z < 0:
continue
if a*x+b*y+c*z == Y:
print(x, y, z)
exit()
else:
print(-1, -1, -1)
|
p03471 | s414035850 | 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 | s736555367 | 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 | s367556452 | Accepted | N, Y = map(int, input().split())
exists = False
for x in range(N+1):
for y in range(N+1):
z = (Y-10000*x-5000*y)//1000
if 0<=z<=N and x+y+z==N:
exists = True
break
else:
continue
break
if exists:
print(x, y, z)
else:
print(-1, -1, -1) |
p03471 | s285428811 | Accepted | def main():
N, Y = map(int, input().split())
for i in range(N+1):
for j in range(N+1-i):
tmp = 10000 * i + 5000 * j + 1000 * (N - i - j)
if tmp == Y:
print(i, j, N - i - j)
exit()
print(-1,-1,-1)
if __name__ == "__main__":
main() |
p03471 | s338324566 | 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 | s020101420 | Accepted | #!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
N, Y = map(int, input().split())
for i in range(0, N+1):
for j in range(0, N+1):
k = N - i - j
if k < 0:
continue
if Y == 10000 * i + 5000 * j + 1000 * k:
print(i, j, k)
return
print("-1 -1 -1")
if __name__ == "__main__":
main() |
p03471 | s670761296 | 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 | s736281802 | Accepted | n, m =map(int,input().split())
flg=0
for i in range(n+1):
for j in range(n-i+1):
if 10000*i+5000*j+1000*(n-i-j)==m:
flg = 1
print(i,j,n-i-j)
break
else:
continue
break
if flg==0:
print(-1,-1,-1) |
p03471 | s575059473 | Accepted | # -*- coding: utf-8 -*-
"""
Created on Tue Feb 4 00:34:00 2020
@author: yama
"""
n, y = map(int, input().split())
f = False
for i in range(n+1):
for j in range(n-i+1):
k = (y - (i*10000 + j*5000))//1000
if i + j + k == n and i*10000 + j*5000 + k*1000 == y:
f = True
break
if f == True:
break
if f == True:
print(i, j, k)
else:
print("-1 -1 -1")
|
p03471 | s994822098 | Accepted | n ,y = map(int, input().split())
for a in range(n+1):
for b in range((n-a)+1):
s = a*10000 + b*5000 + (n-a-b)*1000
if s == y :
print(a,b,(n-a-b))
exit()
print('-1 -1 -1') |
p03471 | s758667109 | Accepted | N,Y = map(int, input().split())
def f():
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:
return i,j,k
return -1,-1,-1
a,b,c = f()
print(a,b,c)
|
p03471 | s351075001 | Accepted | N, Y = map(int, input().split())
match = False
for i in range(N+1):
for j in range(N-i+1):
k = N - i - j
y = 10000*i + 5000*j + 1000*k
if y == Y:
match = True
print(i, j, k)
break
if match:
break
if not match:
print(-1, -1, -1) |
p03471 | s444384027 | 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 k >= 0:
if 10000*i+5000*j+1000*k == y:
print(i,j,k)
exit()
print(-1,-1,-1) |
p03471 | s732412101 | Accepted | N, Y = map(int, input().split())
def otoshidama():
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)
return
print(-1, -1, -1)
otoshidama() |
p03471 | s299656910 | Accepted | def calcPattern(N, Y):
for i in range(0, N+1):
for j in range(0, N+1):
if i == ((Y - 1000*N - 4000*j) / 9000):
if (N-i-j) >= 0: return (str(i) + " " + str(j) + " " +str(N-i-j))
return ("-1 -1 -1")
n,y = map(int, input().split())
print(calcPattern(n,y)) |
p03471 | s953946474 | Accepted | N, Y = map(int, input().split())
#print(N)
for x in range(N+1)[::-1]:
for y in range(N+1-x)[::-1]:
#print(x,y,N-x-y)
if x*10000+y*5000+(N-x-y)*1000 == Y:
print(x,y,N-x-y)
exit(0)
print(-1,-1,-1) |
p03471 | s847182212 | Accepted | N, Y = map(int, input().split())
# N = 9
# Y = 45000
def judge(n, target):
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 == target:
return '{} {} {}'.format(x, y, z)
return '-1 -1 -1'
print(judge(N, Y))
|
p03471 | s114058059 | Accepted | def solve():
N, Y = map(int, input().split())
for x in range(N+1):
for y in range(N+1-x):
d = Y - x * 10000 - y * 5000
if d % 1000 == 0:
z = d // 1000
if x + y + z == N:
print(x, y, z)
exit()
print(-1, -1, -1)
if __name__ == '__main__':
solve()
|
p03471 | s508017096 | Accepted | def main():
N,Y = map(int, input().split())
# N枚でY円はありえるかどうか
for x in range(min(Y//10000+1, N+1)):
for y in range(min((Y-x)//5000+1, N+1)):
z = (Y-10000*x-5000*y)//1000
if (Y-10000*x-5000*y)%1000==0 and z>=0 and (x+y+z)==N:
ans = [x,y,z]
print(*ans)
return
ans = [-1,-1,-1]
print(*ans)
main()
|
p03471 | s604628420 | 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 | s403364674 | Accepted | n, y = map(int, input().split())
y //= 1000
ans = [-1, -1, -1]
for i in range(y // 10 + 1):
for j in range((y - i * 10) // 5 + 1):
k = y - i * 10 - j * 5
if i + j + k == n:
ans = [i, j, k]
print(*ans)
|
p03471 | s456638020 | Accepted | n, Y = map(int, input().split())
Y //= 1000
for x in range(n+1):
y = (Y-n-9*x)//4
z = n-x-y
if z < 0 or y < 0 or x+y+z != n:
continue
if 10*x+5*y+z == Y:
print(x, y, z)
exit()
else:
print(-1, -1, -1) |
p03471 | s933552390 | Accepted | n, total = map(int, input().split(" "))
x = -1
y = -1
z = -1
for x_tmp in range(0, n + 1):
for y_tmp in range(0, (n - x_tmp) + 1):
z_tmp = n - (x_tmp + y_tmp) if n >= (x_tmp + y_tmp) else 0
if total == (x_tmp * 10000 + y_tmp * 5000 + z_tmp * 1000):
x, y, z = x_tmp, y_tmp, z_tmp
print(x, y, z, sep = " ")
|
p03471 | s406814642 | Accepted | N,Y = map(int,input().split())
result = [-1]*3
for i in range(N+1):
for j in range(N-i+1):
money = i * 10000 + j * 5000 + (N-i-j)*1000
if money == Y :
result = [i,j,(N-i-j)]
break
print(*result) |
p03471 | s864955591 | Accepted | import sys
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)
sys.exit()
print("-1 -1 -1")
|
p03471 | s337913551 | Accepted | N, Y = map(int, input().split())
x, y, z = [-1]*3
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:
x, y, z = i, j, k
break
else :
continue
break
print("{0} {1} {2}".format(x, y, z)) |
p03471 | s163068542 | Accepted | N,Y = map(int,input().split())
ten=-1
five=-1
one=-1
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):
ten = i
five = j
one = k
out = str(ten) + ' ' + str(five) + ' ' + str(one)
print(out) |
p03471 | s881539966 | Accepted | def main():
n,y = map(int,input().split())
flag = 0
for i in range(n + 1):
for j in range(n - i + 1):
if flag == 0 and i * 10000 + j * 5000 + 1000 * (n - i - j) == y and n - i - j >= 0:
flag = 1
print(i,j,n - i - j)
if flag == 0:
print('-1 -1 -1')
main() |
p03471 | s372742787 | Accepted | x, y = map(int,input().split())
for i in range(x+1):
for j in range(x+1):
z = 10000*i + 5000*j
if y-z == 1000*(x-i-j) and x-i-j >= 0:
print(i, j, x-i-j)
exit()
print(-1, -1, -1) |
p03471 | s181398777 | Accepted | n, y = list(map(int, input().split()))
for i in range(n + 1):
for j in range(n + 1):
if (n - (i + j) >= 0) and (i * 10000 + j * 5000 + (n - (i + j)) * 1000 == y):
print(str(i) + " " + str(j) + " " + str(n - (i + j)))
exit()
else:
print("-1 -1 -1") |
p03471 | s973846985 | Accepted | import sys
n, y = map(int, input().split())
for i in range(n + 1):
for j in range(n + 1 - i):
k = n - i - j
price = (i * 10**4) + (j * 5 * 10**3) + (k * 10**3)
if price == y:
print(i, j, k)
sys.exit()
elif y < price:
break
print(-1, -1, -1) |
p03471 | s896807140 | Accepted | N, Y = map(int, input().split())
Y //= 1000
tmp_a = Y//10 + 1
tmp_b = Y//5 + 1
for i in range(tmp_a):
for j in range(tmp_b):
k = N-(i+j)
if k>=0 and 10*i+5*j+k==Y:
print(i,j,k)
exit()
print('-1 -1 -1') |
p03471 | s872610509 | Accepted | import sys
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)
sys.exit()
print(-1,-1,-1) |
p03471 | s558647121 | Accepted | N, Y = map(int, input().split())
tf = False
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)
tf = True
break
else:
continue
break
if tf is False:
print(-1,-1,-1)
|
p03471 | s231526997 | 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 | s961675531 | 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()
print("-1 -1 -1") |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.