problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03471 | s535947730 | Accepted | n,m = map(int, input().split())
for x in range(n, -1, -1):
if m - 10000*x < 0: continue
for y in range(n-x, -1, -1):
z = n-x-y
if 10000*x + 5000*y + 1000*z == m:
print(x,y,z)
exit()
print(-1,-1,-1) |
p03471 | s237858241 | Accepted | import sys
list = input().split(" ")
N = int(list[0])
Y = int(list[1])
for yukichi in range(0,N+1):
for ichiyo in range(0,N - yukichi + 1):
hideyo = N - yukichi - ichiyo
if 10000*yukichi + 5000*ichiyo + 1000*hideyo == Y:
print(yukichi,ichiyo,hideyo)
sys.exit()
print(-1,-1,-1) |
p03471 | s441879308 | Accepted | n, y = map(int, input().split())
ans = [-1, -1, -1]
c = 0
for i in range(n + 1):
if c == 1:
break
for j in range(n + 1 - i):
yu = i
hi = j
no = n - i - j
if no * 1000 + hi * 5000 + yu * 10000 == y:
ans = [yu, hi, no]
c = 1
print(" ".join(map(str, ans))) |
p03471 | s413448725 | Accepted | N, Y = map(int, input().split())
ans = 0
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(i, j, N - i - j)
exit()
print(-1, -1, -1) |
p03471 | s322135514 | Accepted | n, y = map(int, input().split())
ans = [-1]*3
for i in range(0, int(y/10000)+1):
ty = y-10000*i
tn = n-i
for j in range(0, min(int(ty/5000)+1,tn+1)):
tty = ty-5000*j
ttn = tn-j
if tty%1000 == 0 and ttn==tty//1000:
print(i, j, tty//1000)
exit()
print(-1, -1, -1) |
p03471 | s569143911 | Accepted | import sys
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)
sys.exit()
print(-1,-1,-1)
|
p03471 | s645879878 | 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 | s856517044 | Accepted | n,y = map(int, input().split())
n10, n5, n1 = -1, -1, -1
for i in range(n+1):
for j in range(i, n+1):
if i*10000 + (j-i)*5000 + (n - j)*1000 == y:
n10 = i
n5 = j-i
n1 = n-j
break
print(n10, n5, n1)
|
p03471 | s509261362 | Accepted | a,b = map(int,input().split())
for i in range(a+1):
for j in range(a-i+1):
z = a-i-j
if 10000*i+5000*j+1000*z==b :
print(i,j,z)
exit()
print(-1,-1,-1) |
p03471 | s779144326 | Accepted | #!/usr/bin python3
# -*- coding: utf-8 -*-
def main():
N, Y = map(int, input().split())
ret = [-1] * 3
for x in range(N+1):
tY = Y - 10000 * x
tN = N - x
for y in range(tN+1):
z = tN - y
if tY == y * 5000 + z * 1000:
ret = [x, y, z]
break
print(*ret)
if __name__ == '__main__':
main() |
p03471 | s446855500 | Accepted | n, y = list(map(int, input().split()))
for i in range(2000+1):
for j in range(2000+1):
if i*10000 + j*5000 + (n-i-j)*1000 == y and (n-i-j)>=0:
print(str(i) + ' ' + str(j) + ' ' + str(n-i-j) + ' ')
exit()
print('-1 -1 -1') |
p03471 | s147616281 | Accepted | n,Y=map(int,input().split())
x,y,z=-1,-1,-1
for i in range(n+1):
total=10000*i
for j in range(n-i+1):
total2=total+5000*j
if n-(i+j)==(Y-total2)//1000:
x,y,z=i,j,n-(i+j)
break
#print(total2)
print(str(x)+" "+str(y)+" "+str(z)) |
p03471 | s954929455 | Accepted | import sys
n, y = map(int, input().split())
max10k = y // 10000
for i in range(max10k+1):
max5k = (y - 10000 * i)//5000
for j in range(max5k+1):
if (y - 10000 * i - 5000 * j) // 1000 == n - i - j:
print(i, j, (n - i - j))
sys.exit()
print(-1,-1,-1)
|
p03471 | s579345094 | Accepted | 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
sm = 10000 * x + 5000 * y + 1000 * z
if sm == Y:
print(x, y, z)
exit(0)
print(-1, -1, -1) |
p03471 | s208584538 | Accepted | N,Y = map(int,input().split())
s=0
for x in range(2001):
for y in range(2001):
z = N - (x+y)
if 1000*x + 5000*y + 10000*z == Y and z >=0:
print(z,' ',y,' ',x)
s = s+1
break
else:
continue
break
if s == 0:
print(-1,' ',-1,' ',-1) |
p03471 | s811989808 | 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("%d %d %d"%(i,j,n-i-j))
exit()
print(-1,-1,-1)
|
p03471 | s831511689 | Accepted | N,Y = map(int, input().split())
"""
・10000x+5000y+1000z=Y
・x+y+z=N
・z=N-(x+y)>=0 x+y<=N
"""
for x in range(N + 1):
for y in range(N + 1 - x):
R = Y - 10000 * x - 5000 * y
z = N - (x + y)
if 1000 * z == R:
print(x, y, z)
exit()
print(-1, -1, -1) |
p03471 | s474453255 | Accepted | n, y = list(map(int,input().split()))
flag = 0
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)
flag = 1
break
if flag == 1:
break
if flag == 0:
print(-1,-1,-1) |
p03471 | s836548561 | Accepted | N,Y = list(map(int, input().split()))
for i in reversed(range(N+1)):
for j in reversed(range(N-i+1)):
k = N-i-j
if i*10000 + j*5000 + k*1000 == Y:
print(i, j, k)
exit()
print(-1, -1, -1) |
p03471 | s238786431 | 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) == 0:
print(i,j,n-i-j)
exit()
print(-1,-1,-1) |
p03471 | s782119935 | Accepted | n,y = map(int, input().split())
exist = False
for i in reversed(range(y//10000+1)):
for j in reversed(range(n-i+1)):
k = n - i - j
res = y - 10000*i - 5000*j
if res == 1000*k:
print("{} {} {}".format(i,j,n-i-j))
print("\n")
exist = True
if exist:
break
if exist:
break
if not exist:
print("-1 -1 -1")
print("\n")
|
p03471 | s682551226 | Accepted | N, Y = map(int, input().split())
ans = [-1, -1, -1]
findit = False
sen = 0
for man in range(N + 1):
for gosen in range(N + 1):
sen = N - man - gosen
if (man * 10000) + (gosen * 5000) + (sen * 1000) == Y and 0 <= sen:
ans = [man, gosen, sen]
str_ans = map(str, ans)
print(" ".join(str_ans)) |
p03471 | s005337463 | 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-i):
k = N-i-j
if 10000*i + 5000*j + 1000*k == Y:
x = i
y = j
z = k
print(x, y, z)
|
p03471 | s269754162 | Accepted | 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 = [itimanen, gosenen, senen]
break
else:
continue
break
print(*ans) |
p03471 | s442291131 | Accepted | l = list(map(int,input().split()))
N = l[0]
Y = l[1]
l = list()
for i in range(N+1):
a = i
if (Y - 1000*N -9000*a) % 4000 == 0:
b = (Y - 1000*N -9000*a) // 4000
c = N - a - b
if a >= 0 and b >= 0 and c >= 0:
l.append([a,b,c])
break
if len(l) ==0:
print("-1 -1 -1")
else:
ans = l[0]
print(ans[0],ans[1],ans[2]) |
p03471 | s807909997 | Accepted | from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline()).split())
n,y=nii()
for i in range(n+1):
for j in range(n-i+1):
num=n-i-j
if 10000*i+5000*j+1000*num==y:
print(i,j,num)
exit()
print(-1,-1,-1) |
p03471 | s083656679 | Accepted | n,y = map(int,input().split())
flag = True
for i in range(y//10000 + 1):
for j in range((y - i*10000)//5000 + 1):
k = (y - 10000*i - 5000*j)//1000
if i + j + k == n:
print(i,j,k)
flag = False
break
if flag:
continue
else:
break
else:
print("-1 -1 -1") |
p03471 | s939956489 | Accepted | import sys
N, Y = map(int, input().split())
Y //= 1000
for y in range(0, (10*N-Y)//5+1):
for z in range(0, (10*N-Y-5*y)//9+1):
if 10*N - Y == 5*y + 9*z:
if N-y-z < 0:
continue
print(N-y-z, y, z)
sys.exit()
print(-1, -1, -1) |
p03471 | s485157156 | Accepted | N, Y = map(int,input().split())
c = Y//1000
for x in range(N+1):
if (c-N-9*x) % 4 == 0:
y = (c-N-9*x)//4
if 0<=y<=N-x:
print(x,y,N-x-y)
exit(0)
print(-1,-1,-1) |
p03471 | s092876987 | 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 | s218751149 | Accepted | import sys
n,y=map(int,input().split())
if n*10000<y:
print("-1 -1 -1")
sys.exit()
if y//1000<n:
print("-1 -1 -1")
sys.exit()
m=y//10000
for i in range(m+1):
g=(y-i*10000)//5000
for j in range(g+1):
s=(y-10000*i-5000*j)//1000
if i+j+s==n and s>=0:
print(i,j,s)
sys.exit()
print("-1 -1 -1") |
p03471 | s655551040 | Accepted | from math import floor
N,Y = map(int,input().split(" "))
#x+y+z = N
#10000x+5000y+1000z = Y
#9000x+4000y=Y-1000N
ans = [-1,-1,-1]
for x in range(N+1):
y = (Y-1000*N-9000*x)/4000
if y >= 0 and y - floor(y) == 0:
y = int(y)
if N - (x + y) >= 0 and 10000*x + 5000*y + 1000*(N-x-y) == Y:
ans = [int(x),y,int(N-(x+y))]
break
print(*ans)
|
p03471 | s663657517 | Accepted | n, y = map(int, input().split())
for i in range(n+1):
for j in range(n-i+1):
if i*1000 + j*5000 + (n-i-j)*10000 == y:
print((n-i-j), j, i)
exit()
else:
print(-1, -1, -1) |
p03471 | s834367509 | Accepted | # C Otoshidama
n, y = map(int, input().split())
for a in range(n+1):
bc = n - a
for b in range(bc+1):
c = bc - b
sum = 10000*a + 5000*b + 1000*c
if sum == y:
print(a, b, c)
break
else:
continue
break
else:
print(-1, -1, -1) |
p03471 | s759303010 | Accepted | import math
n,y = map(int,input().split())
y = y//1000
k = math.ceil(2*(y-n)/9)
if k*4 <= (y-n) and 5*k <= y:
print(-4*k+y-n,9*k-2*(y-n),y-5*k)
else:
print(-1,-1,-1) |
p03471 | s206101425 | Accepted | din = list(map(int,input().split()))
NN = din[0]
YY = din[1]
found = 0
for n10000 in range(NN+1):
if found == 1: break
n_rem = NN - n10000
n5000 = 0
while ((n5000<=n_rem) and (found == 0)):
n1000 = NN-n10000-n5000
if YY - n10000*10000 - n5000*5000 - n1000*1000 == 0:
line = "{} {} {}".format(n10000,n5000,n1000)
print(line)
found = 1;
else:
n5000 += 1
if found == 0:
print("-1 -1 -1") |
p03471 | s034573644 | Accepted | def main():
n,y=map(int,input().split())
for i in range(n+1):
for j in range(n+1-i):
if 10**3*(i+5*j+10*(n-i-j))==y:
print(n-i-j,j,i)
exit()
print(-1,-1,-1)
if __name__=="__main__":
main() |
p03471 | s654816948 | Accepted | n,Y=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==Y and z>=0:
print('{} {} {}'.format(x,y,z))
exit()
print('{} {} {}'.format(-1,-1,-1)) |
p03471 | s662532383 | 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 | s675848351 | Accepted | N, Y = map(int, input().split())
res = -1, -1, -1
for x in range(N + 1):
for y in range(N - x + 1):
z = N - x - y
if 10000 * x + y * 5000 + z * 1000 == Y:
res = x, y, z
print(*res)
|
p03471 | s468042909 | 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('{} {} {}'.format(i,j,N-i-j))
exit()
else:
print('-1 -1 -1') |
p03471 | s002438257 | Accepted | n, Y = map(int, input().split())
x = -1
y = -1
z = -1
for i in range(min(n, Y // 10000), -1, -1):
for j in range(n - i, -1, -1):
if 10000 * i + 5000 * j + 1000 * (n - i - j) == Y:
x = i
y = j
z = n - i - j
break
print(x, y, z)
|
p03471 | s626909886 | Accepted | N, Y = map(int, input().split())
resx, resy, resz = (-1, -1, -1)
# xn = Y//10000
for x in range(Y//10000+1):
for y in range((Y-10000*x)//5000+1):
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 | s025911036 | 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 | s395534116 | Accepted | n, y=map(int, input().split())
a=y//10000
b=y//5000
c=y//1000
for i in range(c+1):
for j in range(n+1-i):
k=n-i-j
if 0<=k<=a and 1000*i + 5000*j + 10000*k == y:
print(k, j, i)
exit()
print(-1, -1, -1) |
p03471 | s207494684 | Accepted | n,kingaku = map(int,input().split())
all1000 = n*1000
if all1000>kingaku:
print(-1,-1,-1)
exit()
x = 0
y = 0
z = n
for i in range(n+1):
x=i
for j in range(n+1):
z=n-(i+j)
y=j
if z<0:
break
money = x*10000 + y*5000 + z*1000
if money == kingaku:
print(x,y,z)
exit()
print(-1,-1,-1) |
p03471 | s529293622 | Accepted | N, Y = map(int, input().split())
max_10000 = Y // 10000
for x in range(max_10000 + 1):
if x > N:
continue
rem = Y - 10000 * x
max_5000 = rem // 5000
for y in range(max_5000 + 1):
if x + y > N:
continue
rem_2 = rem - 5000 * y
if x + y + rem_2 // 1000 == N:
print('{} {} {}'.format(x, y, rem_2 // 1000))
exit()
print('{} {} {}'.format(-1, -1, -1))
|
p03471 | s641905045 | Accepted | n, y = map(int, input().split())
def find(n,y):
for p in range(n+1):
for q in range(n-p+1):
if 9000*p + 4000*q == y - 1000*n:
return [p,q,n-p-q]
return [-1,-1,-1]
for i in find(n,y):
print(i, end=" ")
print()
|
p03471 | s880737537 | Accepted | 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 | s431286398 | Accepted | (k, s), = [list(map(int, s.split())) for s in open(0)]
flag = 0
for i in range(k + 1):
for j in range(k - i + 1):
l = k - i - j
if 10000 * i + 5000 * j + 1000 * l == s:
print(i, j, l)
flag += 1
break
else:
continue
break
if not flag:
print("-1 -1 -1") |
p03471 | s265263239 | Accepted | N, Y = map(int, input().split())
Y /= 1000
total = 0
flag = 0
for A in range(N+1):
for B in range(N+1):
C = N - A - B
if C<0:
break
total = 10 * A + 5 * B + C
if total == Y:
print(A, B, C)
flag = 1
break
if flag == 1:
break
if flag == 0:
print('-1 -1 -1') |
p03471 | s329598859 | Accepted | nums = [int(e) for e in input().split()]
count=0
for i in range(nums[0]+1):
for j in range(0, nums[0]+1-i):
if 10000*i+5000*j+1000*(nums[0]-i-j)==nums[1]:
print('{} {} {}'.format(i, j, nums[0]-i-j))
count=1
break
if count==1:
break
if count==0:
print('-1 -1 -1')
|
p03471 | s875652389 | Accepted | n,y = map(int, input().split())
exist = False
for i in range(int(y/10000)+1):
range_j = int((y - 10000*i)/5000)
for j in range(range_j+1):
k = n - i - j
res = y - 10000*i - 5000*j
if res == 1000*k:
print("{} {} {}".format(i,j,n-i-j))
print("\n")
exist = True
if exist:
break
if exist:
break
if not exist:
print("-1 -1 -1")
print("\n")
|
p03471 | s880649699 | Accepted | n,y = list(map(int,input().split()))
y /= 1000
for b in range(n+1):
for f in range(n-b+1):
if (y - b*10 - 5*f) == n-b-f:
ans = [b, f, n-b-f]
print(*ans)
exit()
ans = [-1,-1,-1]
print(*ans) |
p03471 | s835982863 | Accepted | N,Y=map(int,input().split())
for x in range(Y//10000+3):
for y in range(Y//5000+3):
z = N-x-y
if z < 0:break
SUM = 10000*x + 5000*y + 1000*z
if SUM == Y:
print(x,y,z)
exit()
elif SUM > Y:break
print(-1,-1,-1) |
p03471 | s716379566 | Accepted | import sys
N,Y = map(int,input().split())
for i in range(N+1):
for j in range(N-i+1):
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 | s597038286 | Accepted | N,Y = map(int,input().split())
for i in range(N+1):
for j in range(N+1):
x = i
y = j
z = N-(x+y)
if z < 0:
break
if (10000*x + 5000*y + 1000*z) == Y:
print (x,y,z)
exit ()
print (-1,-1,-1)
|
p03471 | s387946689 | Accepted | N, Y = map(int, input().split());
# 10000x + 5000y + 1000z = Y
# z = N - x - y
# → 9000x + 4000y = Y - 1000N
# Y - 1000N
flag = False;
S = Y - N * 1000;
for i in range(N + 1):
y_div, y_mod = divmod((S - 9000 * i), 4000);
z = N - i - y_div;
if (y_mod == 0 and z >= 0 and y_div >= 0):
print(str(i) + " " + str(y_div) + " " + str(z));
flag = True;
break;
if (flag == False):
print("-1 -1 -1"); |
p03471 | s739804813 | Accepted | n, Y = map(int, input().split())
a = Y//1000
for x in range(n+1):
for y in range(n-x+1):
if 9*x + 4*y == a-n and n-x-y>=0:
print(x, y, n-x-y)
exit()
print(-1, -1, -1) |
p03471 | s085534398 | 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 | s862329003 | Accepted | import sys
N, Y = map(int,input().split())
for k in range(N+1):
for j in range(N+1 - k):
i = N - k -j
if k*10000 + j*5000 + i*1000 == Y:
print(k, j, i)
sys.exit()
print("-1 -1 -1") |
p03471 | s936538011 | Accepted | N,Y = map(int,input().split())
c = 0
for i in range(0,N+1):
for j in range(0,N+1):
c = ((Y-(10000*i+5000*j))/1000)
if c.is_integer and c >= 0 and i+j+c == N:
d = int(c)
print(i,j,d)
exit()
print(-1,-1,-1) |
p03471 | s329833503 | Accepted | 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)
break
else:
continue
break
else:
print('-1 -1 -1')
|
p03471 | s202214006 | Accepted | import math
import sys
from collections import deque
a,b=map(int,input().split())
b=b//1000
for i in range(a+1):
for j in range(a+1):
if 10*i+5*j+a-i-j==b and i+j<=a:
print(i,j,a-i-j,sep=" ")
sys.exit()
print(-1,-1,-1,sep=" ") |
p03471 | s027210108 | 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
if 10000*x + 5000*y + 1000*z == Y:
res10000 = x
res5000 = y
res1000 = z
print(res10000, res5000, res1000) |
p03471 | s377392145 | Accepted | n, y = map(int, input().split())
for i in range(y // 10000 + 1):
for j in range((y - 10000 * i) // 5000 + 1):
if (i*10000 + j*5000+(n-i-j)*1000) == y:
print(i, j, (n - i - j))
exit()
print(-1, - 1, - 1) |
p03471 | s447513855 | Accepted | n,Y = map(int,input().split())
ans_x = -1
ans_y = -1
ans_z = -1
for x in range(n+1):
for y in range(n+1-x):
z = int((Y -10000*x - 5000*y)/1000)
if z >= 0 and (z%1==0 or z==0) and x+y+z == n:
ans_x = x
ans_y = y
ans_z = z
break
print(ans_x, ans_y, ans_z) |
p03471 | s196742796 | Accepted | i,j= list(map(int, input().split()))
ans1=-1
ans2=-1
ans3=-1
for k in range(i+1):
for m in range(i-k+1):
n=i-k-m
if j==(k*10000)+(m*5000)+(n*1000):
ans1=k
ans2=m
ans3=n
print(ans1,ans2,ans3) |
p03471 | s244360714 | Accepted | # abc085
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 x*10000 + y*5000 + z*1000 == Y:
ans = (" ".join(list(map(str, [x, y, z]))))
break
print(ans) |
p03471 | s521422436 | Accepted | def main():
n, y = map(int, input().split())
for i in range(n + 1):
for j in range(n + 1 - i):
z = n - i - j
if i * 10000 + j * 5000 + z * 1000 == y:
print(i, j, z)
exit()
print('-1 -1 -1')
if __name__ == '__main__':
main() |
p03471 | s541167116 | Accepted | bill_count, total_money = map(int, input().split())
def calc(total_money, bill_count):
x_high_bound = int(total_money / 10000) if int(total_money / 10000) < bill_count else bill_count
for x in range(x_high_bound + 1):
hoge = bill_count - x
if 10000 * x + 5000 * hoge < total_money: continue
if 10000 * x + 1000 * hoge > total_money: continue
for y in range(hoge + 1):
for z in [bill_count - x - y]:
if 10000 * x + 5000 * y + 1000 * z == total_money:
return "{} {} {}".format(x, y, z)
return '-1 -1 -1'
print(calc(total_money, bill_count)) |
p03471 | s268089434 | Accepted | n,y = map(int, input().split())
for i in range(n, -1, -1):
if y - 10000*i < 0: continue
for j in range(n-i, -1, -1):
k = n-i-j
if y - 10000*i - 5000*j - 1000*k < 0: continue
elif y - 10000*i - 5000*j - 1000*k == 0:
print(i,j,k)
exit()
print(-1,-1,-1) |
p03471 | s311662461 | Accepted | n,y = map(int, input().split())
for i in range(n+1):
yukichi=10000*i
for j in range(n+1-i):
ichiyou=5000*j
if y-(yukichi+ichiyou)>=0:
if (y-(yukichi+ichiyou))//1000==(n-i-j):
print(i,j,n-i-j)
exit()
print(-1,-1,-1) |
p03471 | s097342548 | Accepted | import sys
N, Y = map(int,input().split())
sum_ = 0
for i in range(N+1):
for j in range(N-i+1):
sum_ = 10000*i + 5000*j + 1000*(N-i-j)
if sum_ == Y:
print(i,j,N-i-j)
sys.exit()
print(-1,-1,-1) |
p03471 | s363065108 | Accepted | from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline()).split())
n,y=nii()
for i in range(n+1):
for j in range(n-i+1):
num=n-i-j
money=10000*i+5000*j
zan=(y-money)//1000
if num==zan:
print(i,j,num)
exit()
print(-1,-1,-1) |
p03471 | s678641437 | Accepted | # C - Otoshidama
N,Y= map(int,input().split())
for i in range(N+1):
for j in range(N-i+1):
k = N-i-j
if i * 10000 + j *5000 + k *1000 ==Y:
print(str(i)+" "+str(j)+" "+str(k))
exit()
print("-1 -1 -1")
|
p03471 | s816154251 | Accepted | n ,y = map(int,input().split())
for i in range(n+1):
for j in range(n+1):
noguti = (y - (i * 10000 + j * 5000)) // 1000
if noguti + i + j == n and noguti >= 0:
print(i,j,noguti)
quit()
print(-1,-1,-1) |
p03471 | s959293370 | Accepted | import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]
N, Y = ri_()
for i in range(N + 1):
for j in range(N + 1):
if 1000 * (N - i - j) == Y - 10000 * i - 5000 * j and N - i - j >= 0:
print(i, j, N - i - j)
exit()
print(-1, -1, -1) |
p03471 | s786964771 | Accepted | n, y = map(int, input().split())
for i in range(n + 1):
for j in range(n + 1 - i):
if 10000 * (n - i - j) + 5000 * j + 1000 * i == y:
print(n - i - j, j, i)
exit()
print(-1, -1, -1) |
p03471 | s495009666 | Accepted | 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)
break
else:
continue
break
else:
print('-1 -1 -1')
|
p03471 | s656100403 | Accepted | import sys
n, y = map(int, input().split())
a = y//10000
b = (y-a*10000)//5000
c = (y-a*10000-b*5000)//1000
if not (a+b+c<=n<=y//1000):
print(-1, -1, -1)
sys.exit()
for i in range(a, -1, -1):
for j in range(b+2*(a-i), -1, -1):
k = (y-i*10000-j*5000)//1000
if n==i+j+k:
print(i, j, k)
break
else:
continue
break
else:
print(-1, -1, -1) |
p03471 | s955372392 | Accepted | n ,y = map(int,input().split())
for i in range(n+1):
for j in range(n+1):
noguti = (y - (i * 10000 + j * 5000)) // 1000
if noguti + i + j == n and noguti >= 0:
print(i,j,noguti)
quit()
print(-1,-1,-1) |
p03471 | s210637415 | Accepted | # C - Otoshidama(https://atcoder.jp/contests/abc085/tasks/abc085_c)
n, y = map(int, input().split())
end = 0
for i in range(n + 1):
if n < i:
break
for j in range(n + 1):
if n - i - j < 0:
break
if 10000 * i + 5000 * j + 1000 * (n - i - j) == y:
print(i, j, n - i - j)
end += 1
if end:
break
if end == 0:
print(-1, -1, -1) |
p03471 | s095038594 | Accepted | n,y=map(int,input().split())
for i in range(2001):
for j in range(2001):
if i*9+j*4+n==y/1000 and i+j<=n:
exit(print(i,j,n-i-j))
print(-1,-1,-1) |
p03471 | s883522071 | 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 z >= 0 and 10000*x + 5000*y + 1000*z == Y:
print(str(x)+" "+str(y)+" "+str(z))
exit()
print("-1 -1 -1") |
p03471 | s464877913 | Accepted | n, Y = map(int, input().split())
frag = 0
tmp = 0
a = 0
b = 0
c = 0
for x in range(n + 1):
for y in range(n - x + 1):
tmp = x * 10000 + y * 5000 + (n - x - y) * 1000
if tmp == Y:
frag = 1
a = x
b = y
c = n - x - y
break
if frag == 0:
print("-1 -1 -1")
else:
print(f"{a} {b} {c}")
|
p03471 | s896350069 | Accepted | import sys
n, y = map(int, input().split())
for i in range(n+1):
for j in range(min(n-i+1, 9)):
k = n - i - j
money = 10000 * i + 5000 * j + 1000 * k
if y == money:
print("{} {} {}".format(i, j, k))
sys.exit()
print(-1, -1, -1) |
p03471 | s130870572 | Accepted | n,k = map(int, input().split())
for x in range(n+1):
for y in range(n+1):
if x+y>n:
continue
z = n-(x+y)
if x*10000+y*5000+z*1000 == k:
print(x,y,z)
exit(0)
print(-1,-1,-1)
|
p03471 | s058091017 | Accepted | def calcPattern(N, Y):
for i in range(0, N+1):
for j in range(0, N+1-i):
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 | s203808735 | Accepted | N,Y = map(int, input().split())
res = [-1,-1,-1]
for x in range(N+1):
for y in range(N+1-x):
if 10000*x + 5000*y +1000*(N-x-y) == Y:
res =[x,y,N-x-y]
print(res[0],res[1],res[2])
|
p03471 | s760189646 | Accepted | N, Y = map(int, input().split())
q = -1
w = -1
r = -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:
q = a
w = b
r = c
print('{} {} {}'.format(q, w, r)) |
p03471 | s222661228 | Accepted | N , Y = (int(x) for x in input().split())
senen = Y//10000
result = False
gosenen = Y // 5000
for x in range(N, -1, -1):
#Y = Y - 10000 * x
#print("x:",x)
for y in range(N,-1,-1):
#Y = Y - y * 5000
z = N - x - y
if x * 10000 + y * 5000 + z * 1000 == Y and x + y + z <= N and z >= 0:
result = True
print(x,y,z)
break
else:
continue
break
if result == False:
print(-1,-1,-1) |
p03471 | s915887002 | Accepted | N, Y = map(int, input().split())
for m10 in range(N + 1):
for m5 in range(N + 1 - m10):
m1 = N - m10 - m5
if m10 * 10000 + m5 * 5000 + m1 * 1000 == Y:
print(m10, m5, m1)
exit(0)
print('-1 -1 -1') |
p03471 | s881402150 | Accepted | I = list(map(int, input().split()))
N, Y = I[0], I[1]
x, y, z = -1, -1, -1
for a in range(N+1):
for b in range(N-a+1):
c = N - a - b
X = 10000*a + 5000*b + 1000*c
if X == Y:
x, y, z = a, b, c
break
print(x, y, z) |
p03471 | s646310088 | Accepted | import sys
N, Y = map(int, input().split())
find_ans = False
for a in range(N+1):
for b in range(N+1-a):
c = N-a-b
num = a*10000 + b*5000 + c*1000
if num == Y:
print("{} {} {}".format(a, b, c))
find_ans = True
sys.exit()
if find_ans == False:
print('-1 -1 -1') |
p03471 | s868176086 | Accepted | 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 | s052693897 | Accepted | N, Y = map(int, input().split())
for a in range(N+1):
for b in range(N-a+1):
c = N - a -b
if 10000*a + 5000*b + 1000*c == Y:
print(a, b, c)
exit()
else:
print(-1, -1, -1) |
p03471 | s513474925 | Accepted | flag = 0
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 and k >= 0:
flag = 1
print(i,j,k)
break
if flag == 1:
break
if flag == 0:
print(-1,-1,-1) |
p03471 | s643732466 | Accepted | bill_count, total_money = map(int, input().split())
def search_pattern(bill_count, total_money):
for x in range(bill_count + 1):
for y in range(bill_count - x + 1):
z = bill_count - x - y
t = 10000 * x + 5000 * y + 1000 * z
if t != total_money:
continue
return (x, y, z)
return (-1, -1, -1)
answer = search_pattern(bill_count, total_money)
print(" ".join(map(str, answer))) |
p03471 | s340503955 | Accepted | # 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(z, j, i)
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.