problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03471 | s398368521 | 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):
if 10000*i+5000*j+1000*(n-i-j)==y:
a=i
b=j
c=n-i-j
break
if c>=0:
print(a,b,c)
else:
print("-1 -1 -1") |
p03471 | s636303616 | Accepted | a, b , c = -1,-1,-1
n, y = map(int,input().split())
for i in range(n+1):
for j in range(n+1):
if i+ j > n:
break
elif ((y - (i*10000 + j*5000))%1000 == 0) and ((i+j+(y - (i*10000 + j*5000))/1000) == n):
if (y - (i*10000 + j*5000))/1000 >= 0:
a,b,c = i, j, int((y - i*10000 - j*5000)/1000)
break
print(a, b, c) |
p03471 | s011242977 | 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 | s020991503 | Accepted | def resolve():
N, Y = map(int, input().split())
for x in range(N+1):
for y in range(N+1-x):
_sum = 10000 * x + 5000 * y + 1000 * (N-x-y)
if _sum == Y:
print(x, y, N-x-y)
exit(0)
print(-1, -1, -1)
if __name__ == '__main__':
resolve()
|
p03471 | s023057913 | Accepted | #!/usr/bin/env python
def main():
N, Y = list(map(int, input().split()))
for i in range(N+1):
for j in range(N-i+1):
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 | s458260328 | Accepted | n, yen = map(int, input().split())
for x in range(n + 1):
for y in range(n - x + 1):
z = n - x - y
if yen == x * 10000 + y * 5000 + z * 1000:
print(x, y, z)
exit(0)
print("-1 -1 -1") |
p03471 | s603796323 | 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 | s972344502 | Accepted | n,y = map(int,input().split())
res = [-1,-1,-1]
for i in range(n+1):
for j in range(n-i+1):
if(10000*i + 5000*j + 1000*(n-i-j) == y):
res = [i,j,n-i-j]
break
print(*res) |
p03471 | s228189629 | Accepted | n,y = map(int,input().split())
ans = [0]*3
for i in range(n+1):
for j in range(n+1):
if i*10000 + j*5000 + (n-i-j)*1000 == y and (n-i-j) >= 0:
print(i,j,n-i-j)
exit()
else:
print(-1,-1,-1) |
p03471 | s620647170 | 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 i * 10 + j * 5 + k == y / 1000:
ans = [i, j, k]
print(i, j, k)
exit()
ans = [str(a) for a in ans]
print(' '.join(ans)) |
p03471 | s641005468 | Accepted | n,y = [int(e) for e in 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)
break
else:
continue
break
else:
print("-1 -1 -1") |
p03471 | s841610054 | Accepted | N, Y = map(int, input().split())
for i in range(0, N+1):
for j in range(0, N+1-i):
k = N-i-j
if 1000*i+5000*j+10000*k == Y:
print(k, j, i)
exit(0)
print(-1, -1, -1)
|
p03471 | s268403724 | Accepted | N, Y = map(int, input().split())
for i in range(N+1):
for j in range(N+1-i):
if Y == 10000*i + 5000*j + 1000*(N-i-j):
print(i, j, N-i-j)
break
else:
continue
break
else:
print(-1, -1, -1)
|
p03471 | s177294430 | Accepted | N,Y=map(int,input().split())
for i in range(N+1):
for j in range(N-i+1):
if(Y==i*10000+j*5000+(N-i-j)*1000):
print('{i} {j} {k}'.format(i=i,j=j,k=N-i-j))
exit()
print('-1 -1 -1')
|
p03471 | s704461278 | Accepted | N,Y=map(int,input().split())
for i in range(N+1):
for j in range(N-i+1):
ans=10000*(N-i-j)+5000*j+1000*i
if ans==Y:
print(N-i-j,j,i)
exit()
print(-1,-1,-1) |
p03471 | s761302411 | Accepted | N, Y = map(int, input().split())
ans = [-1, -1, -1]
findit = False
sen = 0
for man in range(N + 1):
if findit == True:
break
for gosen in range(N + 1):
if findit == True:
break
sen = N - man - gosen
if (man * 10000) + (gosen * 5000) + (sen * 1000) == Y and 0 <= sen:
ans = [man, gosen, sen]
findit = True
str_ans = map(str, ans)
print(" ".join(str_ans)) |
p03471 | s722994508 | Accepted | n,y=map(int,input().split())
c=0
for i in range(n+1):
for j in range(n-i+1):
if 9*i+4*j+n==y//1000:
print(i,j,n-i-j)
c=1
break
if c==1:
break
if c!=1:
print(-1,-1,-1) |
p03471 | s970483834 | Accepted |
N, Y = map(int, input().split())
total = 0
for a in range(N+1):
for b in range(N+1-a):
c = N -a -b
total = a*10000 + b*5000 + c*1000
if (total == Y) and (a+b+c==N) and (c>=0):
print(a, b, c)
exit()
print(-1,-1,-1) |
p03471 | s552177521 | Accepted | N,Y = map(int, input().split())
for x in range(2001):
for y in range(2001):
z = N-x-y
if z<0:
break
temp = x*10000+y*5000+z*1000
if temp==Y:
print(x,y,z)
exit()
print(-1,-1,-1) |
p03471 | s164984126 | Accepted | a,sums= list(map(int,input().split()))
yuki = sums//10000
taishi = (sums%10000) //5000
noguchi = (sums%5000) //1000
while a>yuki+taishi+noguchi:
if ((a-(yuki+taishi+noguchi))%4==0)&(taishi>0):
taishi-=1
noguchi+=5
elif yuki>0:
yuki-=1
taishi+=2
else:
break
if a==yuki+taishi+noguchi:
print(yuki,taishi,noguchi)
else:
print("-1 -1 -1") |
p03471 | s647640389 | Accepted | def main():
N,Y = map(int,input().split())
for i in range(Y//10000+1):
for j in range(N-i+1):
if Y == i *10000 + j * 5000 + (N-i-j) * 1000:
print(*[i,j,N-i-j])
return
print(*[-1,-1,-1])
main() |
p03471 | s549610892 | 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 | s186021951 | 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 <= n and 10000*x+5000*y+1000*z == Y:
print(x,y,z)
exit()
print(-1,-1,-1) |
p03471 | s193689688 | Accepted | n, y = map(int, input().split())
count = 5000*n
work = [0, n, 0]
for i in range(n):
if y > count:
count += 5000
work[0] += 1
work[1] -= 1
elif y < count:
work[2] += 1
work[1] -= 1
count -= 4000
else:
break
if y == count:
print(" ".join(map(str, work)))
else:
print("-1 -1 -1")
|
p03471 | s513825908 | Accepted | N,Y = map(int,input().split())
for i in range(min(N+1,Y//10000 + 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(0)
print(-1,-1,-1)
|
p03471 | s147634265 | Accepted | n, t = map(int, input().split())
for x in range(n+1):
for y in range(n+1 -x):
z = n - x - y
if z < 0:
z = 0
if x*10000 + y*5000 + z*1000 == t:
print(x, y , z)
exit()
print("-1 -1 -1") |
p03471 | s903087868 | Accepted | N , Y = map(int,input().split())
k = 0
for i in range(N+1):
x = i
for j in range(N - i + 1):
y = j
if (Y - x * 10000 - y*5000)/1000 == N - x - y >=0 :
print(str(x) +' '+str(y)+' '+str(N-x-y))
k = 1
break
if k == 1:
break
if k== 0:
print('-1 -1 -1') |
p03471 | s086459636 | 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 | s199719127 | 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 x*10000+y*5000+z*1000 == Y:
print(x, y, z)
exit()
print("-1 -1 -1") |
p03471 | s534018302 | Accepted | N, Y =map(int, input().split())
X = [-1,-1,-1]
for i in range(2001):
y = (Y-1000*N-9000*i)/4000
if not float.is_integer(y):
continue
if 0<= N-i-y <= 2000 and 0<= y <= 2000:
X=[i, y, N-i-y]
X=list(map(int, X))
break
print(*X)
|
p03471 | s816774265 | Accepted | N, Y = map(int, input().split())
a = 0
b = 0
c = 0
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:
a = i
b = j
c = N-i-j
if a == 0 and b == 0 and c == 0:
print(-1,-1,-1)
else:
print(a,b,c) |
p03471 | s382038665 | Accepted | n,y=map(int,input().split())
res=(-1,-1,-1)
for i in range(n+1):
for j in range(n-i+1):
k = 10000*i + 5000*j + 1000*(n-i-j)
if k==y:
res=(i,j,n-i-j)
break
print(*res) |
p03471 | s461708616 | Accepted | N,Y = map(int,input().split())
for i in range(N+1):
A = i
for j in range(N+1):
B = j
C = N - A - B
if C < 0:
break
s = 10000*A+5000*B+1000*C
if s == Y:
a = str(A)
b = str(B)
c = str(C)
print(a+" "+b+" "+c)
exit()
print("-1"+" "+"-1"+" "+"-1") |
p03471 | s202803287 | Accepted | N, Y = map(int, input().split())
a = min(Y // 10000, N) + 1
for i in range(a):
b = min((Y - (10000 * i)) // 5000, N - i) + 1
for j in range(b):
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 | s439363909 | 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 | s663346265 | 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 N-x-y >=0 and 10000*x + 5000*y + 1000*(N-x-y) == Y:
res = (x,y,N-x-y)
print(res[0],res[1],res[2])
|
p03471 | s788729265 | Accepted | N,Y=(int(x) for x in input().split())
# YY現在の金額
# n:使える枚数
F=0
Y=Y/1000
for i in range(N+1):
for j in range(N+1-i):
if (Y-10*i-5*j)==(N-i-j):
print(i,j,N-i-j)
F=1
else:
continue
if F==1:break
else:
print("-1 -1 -1") |
p03471 | s348082202 | Accepted | N, Y = map(int, input().split())
ans = [-1, -1, -1]
for i in range(N + 1):
for j in range(N - i, -1, -1):
if 10000 * i + 5000 * j + 1000 * (N - i - j) == Y:
ans[0] = i
ans[1] = j
ans[2] = (N - i - j)
print(*ans) |
p03471 | s034556109 | 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 | s194610919 | Accepted | N, Y = map(int, input().split(' '))
for man in range(N+1):
for go in range(N-man+1):
if (10000*man+5000*go+1000*(N-man-go)) == Y:
print('{} {} {}'.format(man, go, N-man-go))
exit()
print('{} {} {}'.format(-1, -1, -1))
|
p03471 | s169190592 | Accepted | n, y = (int(x) for x in input().split())
ans = 0
m = y // 10000 + 1
for i in reversed(range(m)):
for j in range(n-i+1):
if 10000*i + 5000*j + 1000*(n-i-j) == y:
ans = [i, j, n-i-j]
break
if ans != 0:
break
if ans == 0: print(*[-1, -1, -1])
else: print(*ans) |
p03471 | s373097771 | Accepted | import sys
N, Y = map(int, input().split())
for i in range(N + 1):
if 10000 * i > Y:
break
for j in range(N + 1 - i):
if 10000 * i + 5000 * j > Y:
break
k = N - i - j
if 10000 * i + 5000 * j + 1000 * k > Y:
break
if 10000 * i + 5000 * j + 1000 * k == Y:
print('{0} {1} {2}'.format(i, j, k))
sys.exit()
print('-1 -1 -1') |
p03471 | s163562157 | 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 | s314954122 | Accepted | def judge(n, s):
for x in range(n, -1, -1):
for y in range(n - x, -1, -1):
if 10000 * x + 5000 * y + 1000 * (n - x - y) == s:
return str(x) + " " + str(y) + " " + str(n - x - y)
return "-1 -1 -1"
n, s = map(int, input().split())
print(judge(n, s))
|
p03471 | s899007109 | Accepted | N, Y = map(int, input().split())
man = -1
gosen = -1
sen = -1
for i in range(N+1):
for j in range(N+1):
k = N-i-j
if Y == i*10000+j*5000+k*1000 and k >= 0:
print(i, j, k)
exit()
print(-1, -1, -1) |
p03471 | s852843599 | Accepted | import sys
N,Y = map(int,input().split())
for x in range(min(N,Y//10000)+1):
for y in range(min(N-x,(Y-10000*x)//5000)+1):
z = N-x-y
if 10000*x+5000*y+1000*z == Y:
print(x,y,z)
sys.exit()
print(-1,-1,-1) |
p03471 | s235270024 | Accepted | N, Y = [int(str) for str in input().strip().split()]
Y //= 1000
for i in range(N + 1):
for j in range(N - i + 1):
k = N - i - j
if 10 * i + 5 * j + k == Y:
print(i, j, k)
exit()
print(-1, -1, -1) |
p03471 | s510534455 | 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 | s629755240 | Accepted | n,y = map(int,input().split())
for i in range(n+1):
for j in range(n+1-i):
if y==i*10000+j*5000+(n-i-j)*1000:
print(i,j,(n-i-j))
exit()
print('-1 -1 -1') |
p03471 | s666486106 | 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 | s897863976 | 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 and 10000*x+5000*y+1000*z==Y:
print(x,y,z)
exit()
print(-1,-1,-1,sep=" ")
|
p03471 | s146960137 | Accepted | n, y = [int(i) for i in input().split()]
a, b, c, f = 0, 0, 0, 0
for i in range(n+1):
for j in range(n+1):
k = (y - 10000*i - 5000*j)/1000
if k == n-i-j and k>=0:
a, b, c = i, j, k
f += 1
break
if f == 0:
print(-1,-1,-1)
else:
print(int(a), int(b), int(c)) |
p03471 | s653921250 | Accepted | N,Y=map(int,input().split())
# x+y+z=N
# 10000x+5000y+1000z=Y
# となるような正整数(x,y,z)はあるか？
ans=[-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:
ans=[x,y,z]
print(ans[0],ans[1],ans[2]) |
p03471 | s492391129 | Accepted | n,y=map(int,input().split())
Y=y//1000
a,b,c=0,0,0
for i in range(Y//10+1):
rest=n-i
for j in range(rest+1):
k=rest-j
if 10*i+5*j+k==Y:
print(i,j,k)
exit()
print('-1 '*3)
|
p03471 | s255450888 | Accepted | n, y = list(map(int, input().split()))
for i in range(n+1):
for j in range(n+1):
k = n-i-j
if k>=0 and y == i*10000+j*5000+k*1000:
print(i, j, k)
exit()
print(-1, -1, -1) |
p03471 | s939871509 | Accepted | n, d = map(int, input().split())
ans = [-1]*3
for x in range(n+1):
for y in range(n-x+1):
zd = d - 10000*x - 5000*y
if zd//1000 == n-x-y:
ans[0] = x
ans[1] = y
ans[2] = zd//1000
break
print(*ans) |
p03471 | s191972452 | Accepted | def main():
n, sum = list(map(int,input().split()))
x_max = sum // 10000
for x in reversed(range(0, x_max + 1)):
for y in range(n - x + 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 | s125916031 | Accepted | n, sum = map(int, input().split())
for x in range(n + 1):
for y in range(n - x + 1):
if x * 10000 + y * 5000 + (n-x-y) * 1000 == sum:
print(x, y, n-x-y)
exit()
print(-1, -1, -1) |
p03471 | s139582777 | Accepted | def solve(N, Y):
for a in range(N + 1):
for b in range(N + 1 - a):
c = N - (a + b)
if a * 10000 + b * 5000 + c * 1000 == Y:
return a, b, c
return -1, -1, -1
N, Y = [int(n) for n in input().split()]
print(*solve(N, Y))
|
p03471 | s163774147 | Accepted | n , a = map(int, input().split())
num = 5000*n
ans = [0, n, 0]
def find(num):
for _ in range(n+1):
if num < a:
ans[0] += 1
ans[1] -= 1
num += 5000
elif num > a:
ans[1] -= 1
ans[2] += 1
num -= 4000
elif num == a:
return ' '.join(map(str, ans))
return '-1 -1 -1'
print(find(num)) |
p03471 | s909704258 | Accepted | N,Y=map(int,input().split())
for i in range(N+1):
for m in range(N+1-i):
y=N-i-m
if Y==i*10000+m*5000+y*1000:
print(i,m,y)
exit()
print(-1,-1,-1)
|
p03471 | s288456928 | 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:
flag = 1
print(i,j,n - i - j)
if flag == 0:
print('-1 -1 -1')
main() |
p03471 | s754124938 | 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('{} {} {}'.format(a,b,c))
exit()
print('-1 -1 -1') |
p03471 | s237936152 | Accepted | n,y=map(int,input().split())
for i in range(n+1):
for j in range(n+1-i):
c=n-i-j
if y==i*10000+j*5000+c*1000:
print(i,j,c)
exit()
print(-1,-1,-1) |
p03471 | s261844686 | Accepted | N, Y = [int(x) for x in input().split()]
c10000 = -1
c5000 = -1
c1000 = -1
for a in range(N + 1):
for b in range(N - a + 1):
c = N - a - b
total = 10000 * a + 5000 * b + 1000 * c
if total == Y:
c10000 = a
c5000 = b
c1000 = c
break
print(str(c10000) + ' ' + str(c5000) + ' ' + str(c1000)) |
p03471 | s847332499 | Accepted | N, Y = map(int, input().split())
Yen = Y/1000
for i in range(N+1):
for j in range(N+1-i):
if i*10 + j*5 + (N-i-j) == Yen:
print(i, j, N-i-j)
exit()
print('-1 -1 -1') |
p03471 | s171282998 | Accepted | n, y = map(int,input().split())
for i in range(0,n+1):
for j in range(0, n-i+1):
if y == 10000*i + 5000*j + 1000*(n-i-j):
print("{0} {1} {2}".format(i, j, n-i-j))
exit()
print("-1 -1 -1")
|
p03471 | s910841429 | 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 | s390742997 | Accepted | [N, Y] = list(map(int, input().split()))
flag = False
for i in range(0, N+1):
if 10000*i > Y:
break
for j in range(0, N+1-i):
k = N-i-j
total = 10000*i + 5000*j + 1000*k
if total == Y:
print("{} {} {}".format(i, j, k))
flag = True
break
if flag:
break
if flag == False:
print("-1 -1 -1") |
p03471 | s008162052 | Accepted | 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:
break
if 10000 * i + 5000 * j + 1000 * k == Y:
print(i, j, k)
exit()
print(-1, -1, -1)
|
p03471 | s565986507 | 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
if i * 10000 + j * 5000 + k * 1000 == Y:
print (i,j,k)
sys.exit()
print (-1,-1,-1)
|
p03471 | s070955528 | Accepted | N, Y = map(int, input().split())
for i in range(0, N+1, 1):
isFinish = False
for j in range(0, N+1-i, 1):
sen = 1000 * i
gosen = 5000 * j
man = 10000 * (N - i - j)
if sen + gosen + man == Y:
print(N - i - j, j, i)
isFinish = True
break
if isFinish:
break
else:
print(-1, -1, -1) |
p03471 | s210722641 | 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 | s595729566 | Accepted | n,yen=map(int,input().split())
yen//=1000
for x in range(n+1):
for y in range(n-x+1):
z=n-x-y
cur_yen=x*10+y*5+z*1
if cur_yen == yen:
print(x,y,z)
exit()
print(-1,-1,-1)
|
p03471 | s272247202 | Accepted | n,y=map(int,input().split())
for i in range(n+1):
for j in range(n+1-i):
k10=i*10000
k5=j*5000
k1=(n-i-j)*1000
if k10+k5+k1==y:
print(i,j,n-i-j)
break
else:
continue
break
else:
print(-1,-1,-1) |
p03471 | s718692512 | Accepted | N, Y = map(int, input().split())
result = [-1, -1, -1]
# a = 0, 1, ..., N
for a in range(0, N + 1):
# b = 0, 1, ..., N-a
for b in range(0, N - a + 1):
c = N - a - b
if 10000 * a + 5000 * b + 1000 * c == Y:
result = [a, b, c]
print(*result) |
p03471 | s533981862 | Accepted | n,Y=map(int,input().split())
Y//=1000
ans=False
for x in range(n+1):
for y in range(n+1):
if Y-10*x-5*y==n-x-y and (n-x-y)>=0:
ans=True
break
if ans==True:
break
if ans is True:
print(x,y,n-x-y)
else:
print(-1,-1,-1) |
p03471 | s873225869 | Accepted | N, Y = map(int, input().split())
resx, resy, resz = (-1, -1, -1)
xmax = min(N, Y//10000)
for x in range(xmax+1):
for y in range(N-x+1):
z = N - x - y
total = 10000*x + 5000*y + 1000*z
if total == Y:
resx, resy, resz = (x, y, z)
break
else:
continue
print(resx, resy, resz) |
p03471 | s346401340 | Accepted | N, Y = map(int, input().split())
x, y, z = -1, -1, -1
for a in range(N+1):
for b in range(N+1-a):
if 10000*a + 5000*b + 1000*(N-a-b) == Y:
x, y, z = a, b, N-a-b
print("{} {} {}".format(x,y,z)) |
p03471 | s550331364 | Accepted | def solve():
n, y = map(int, input().split())
r = range(n+1)
ans = "-1 -1 -1"
for i in r:
for j in r:
k = (y-(10000*i+5000*j))//1000
if k >= 0 and 10000*i+5000*j+1000*k == y and i+j+k == n:
ans = "{} {} {}".format(i, j, k)
print(ans)
return
print(ans)
if __name__ == "__main__":
solve()
|
p03471 | s303281984 | Accepted | N,Y = map(int,input().split())
for x in range(N+1):
for y in range(N+1-x):
p = x*10000 + y*5000
if p > Y: break
rem = Y - p
z = rem//1000
if x+y+z == N:
print(x,y,z)
exit()
print(-1,-1,-1) |
p03471 | s173043363 | Accepted | N,Y=map(int,input().split())
A=[]
for i in range(Y//10000+1):
for j in range((Y-i*10000)//5000+1):
c1=(Y-10000*i-5000*j)/1000
c2=N-i-j
if c1==c2:
A=[i,j,c1]
break
if c1!=c2:
continue
if len(A)==0:
print("-1 -1 -1")
else:
A[2]=int(A[2])
#intは整数、floatは少数
print(str(A[0])+" "+str(A[1])+" "+str(A[2]))
|
p03471 | s846609796 | Accepted | import sys
n, y = map(int, input().split())
for a in range(n+1):
for b in range(n+1-a):
if 10000 * a + 5000 * b + 1000 * (n - a - b) == y:
ans = [a, b, n - a - b]
print(*ans, sep=" ")
sys.exit()
print("-1 -1 -1") |
p03471 | s442991417 | Accepted | #nは札枚数
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 | s360137252 | Accepted | n, y = list(map(int, input().split()))
for a in range(0, n+1):
for b in range(0, n-a+1):
c = n-(a+b)
if (10000*a + 5000*b + 1000*c) == y:
print(a, b, c)
exit()
print(-1, -1, -1)
|
p03471 | s205680709 | Accepted | N, Y = map(int, input().split())
answer = '-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 z >= 0:
answer = str(x) + ' ' + str(y) + ' ' + str(z)
break
print(answer)
|
p03471 | s111128937 | Accepted | n, total = [int(i) for i in input().split()]
for a in range(n+1):
for b in range(n+1-a):
c = n-a-b
if c >= 0:
if 10000*a + 5000*b + 1000*c == total:
print('{} {} {}'.format(a, b, c))
exit()
print('-1 -1 -1') |
p03471 | s541142587 | Accepted | n, y = map(int, input().split())
for a in range(n+1):
for b in range(n+1):
c = n - (a+b)
if a*10000 + b*5000 + c*1000 == y and a+b+c == n and c >= 0:
print(a, b, c)
exit()
print('-1 -1 -1') |
p03471 | s854599288 | Accepted | x,y=map(int,input().split())
a1=-1
b1=-1
c1=-1
for a in range(0,x+1):
for b in range(0,x+1-a):
c=x-a-b
if 10000*a+5000*b+1000*c==y:
a1=a
b1=b
c1=c
print(a1,b1,c1) |
p03471 | s760923384 | Accepted | n, y = map(int, input().split())
x = 0
for i in range(n + 1):
for j in range(n + 1 - i):
if 10000 * i + 5000 * j + 1000 * (n - i - j) == y:
print(i, j, (n - i - j))
x = 1
break
if x == 1:
break
else:
print(-1, -1, -1) |
p03471 | s357144040 | Accepted | a,b=map(int,input().split())
c=-1
d=-1
e=-1
x=b//10000
for i in range(0,x+1,1):
y=(b-10000*i)//5000
for j in range(0,y+1,1):
k=(b-10000*i-5000*j)//1000
if i+j+k==a:
c=i
d=j
e=k
print(c,d,e) |
p03471 | s167429539 | Accepted | n, y = map(int, input().split())
for senyen in range(n + 1):
for gosenyen in range(n + 1 - senyen):
manyen = n - senyen - gosenyen
if senyen * 1000 + gosenyen * 5000 + manyen * 10000 == y:
print(manyen, gosenyen, senyen)
exit(0)
print("-1 -1 -1") |
p03471 | s503137546 | Accepted | N, Y = map(int, input().split())
x, y, z = -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:
x, y, z = i, j, k
break
print(x, y, z)
|
p03471 | s829022643 | Accepted | n,y = map(int, input().split())
a = -1
b = -1
c = -1
n1 = min(y // 10000, n)
n2 = min(y // 5000, n)
for i in range(n1+1):
for j in range(n2+1-i):
money = 10000 * i + 5000 * j + 1000 * (n - i - j)
if y == money:
a = i
b = j
c = n - i - j
break;
print(str(a)+" ",str(b)+" ",str(c)) |
p03471 | s534057807 | Accepted | n, y = map(int,input().split())
y = y//1000
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:
print(str(i) +' '+str(j)+' '+str(k))
exit()
print('-1 -1 -1') |
p03471 | s708603308 | Accepted | import sys
n,Y = map(int,input().split())
for x in range(n+1):
for y in range(n-x+1):
z = n-(x+y)
if z >= 0 and 10000*x+5000*y+1000*z == Y:
print(x,y,z)
sys.exit()
print(-1,-1,-1) |
p03471 | s940653868 | 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):
k = n - i - j
if 10000*i + 5000*j + 1000*k == y:
a, b, c = i, j, k
print(a, b, c) |
p03471 | s764505215 | 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 | s485964179 | 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 | s060986259 | 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")
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.