problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03471 | s483449168 | Wrong Answer | N,Y = map(int,input().split())
flag = False
ans = ""
for x in range(N + 1):
if flag:
break
for y in range(N - x, N + 1):
if x + y > N or flag:
break
for z in range(N - x - y, N + 1):
if x + y + z > N or flag:
break
if x * 10000 + y * 5000 + z * 1000 == Y:
ans = str(x) + " " + str(y) + " " + str(z)
flag = True
if flag:
print(ans)
else:
print("-1 -1 -1") |
p03471 | s424114144 | Wrong Answer | n ,y = map(int,input().split())
list = {}
for i in range(n):
for j in range(n - i):
for k in range(n - i - j):
if (i*10000 + j * 5000 + k* 1000) == y:
list = [i,j,k]
if len(list) == 0:
list = [-1,-1,-1]
print(list[0],list[1],list[2]) |
p03471 | s231554659 | Wrong Answer | N, Y = map(int, input().split())
flag = 0
for x in range(N+1):
if flag == 0:
for y in range(N-x+1):
if (10000*x + 5000*y + 1000*(N-x-y) == Y) and (N-(x+y))>=0:
flag = 1
break
else:
break
if flag ==1:
print(x-1, y , N-(x-1+y))
else:
print('-1 -1 -1') |
p03471 | s342771760 | Wrong Answer |
N, Y = map(int, input().split())
answer = (-1,-1,-1)
for a in range(N):
for b in range(N):
c = N -a -b
total = a*10000 + b*5000 + c*1000
if (total == Y) and (a+b+c==N) and (c>=0):
answer = (a, b, c)
break
print(*answer) |
p03471 | s195659129 | Wrong Answer | 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):
if Y == i * 10000 + j * 5000 + (N - i - j) * 1000:
print(i, j, N - i - j)
sys.exit()
print(x, y, z)
|
p03471 | s843149292 | Wrong Answer | N, Y = map(int, input().split())
flag = False
for x in range(N):
for y in range(N - x):
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 | s121342083 | Wrong Answer | n,y=map(int,input().split())
t=0
flag=True
for x in range(n+1):
for y in range(n+1):
z=n-x-y
if x+x+z==y:
print(x,y,z)
flag=False
if flag:
print(-1,-1,-1)
|
p03471 | s916390288 | Wrong Answer | N,Y = map(int,input().split())
arr = []
for i in range(N+1):
for j in range(N+1):
k = N-i-j
if i*10000+j*5000+k*1000 == Y:
arr.append([i,j,k])
if len(arr) >0:
print(arr[0][0],arr[0][1],arr[0][2])
else:
print(-1,-1,-1) |
p03471 | s110677815 | Wrong Answer | N,Y = [int(x) for x in input().split()]
Y = Y // 1000
for y in range(N):
if (Y - N - 4*y) % 9 != 0:
continue
x = int((Y - N - 4*y) / 9)
z = N - y - x
if 0 <= x and 0 <= z and x <= N and z <= N:
print(x,y,z)
exit()
print("-1 -1 -1") |
p03471 | s976350232 | Wrong Answer | from sys import stdin
n,y = map(int,stdin.readline().rstrip().split())
for i in range(n+1):
for j in range(n-i,n+1):
k = n-(i+j)
if k < 0:
continue
elif 10000*i+5000*j+1000*k == y:
print(i,j,k)
exit()
print(-1,-1,-1) |
p03471 | s161753596 | Wrong Answer | n, y = map(int,input().split())
r1,r2,r3 = -1,-1,-1
for f in range(n):
for h in range(n):
if 10000 * f + 5000 * h + 1000 *( n-(f + h)) == y:
r1,r2,r3 = f, h, n-(f + h)
break
print(str(r1) + ' ' + str(r2) + ' ' + str(r3))
|
p03471 | s552891020 | Wrong Answer | 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):
for z in range(n+1-x-y):
curr = 10000 * x + 5000 * y + 1000 * z
if curr != 0 and curr == target:
return str(x) + ' ' + str(y) + ' ' + str(z)
return '-1 -1 -1'
print(judge(N, Y))
|
p03471 | s696379402 | Wrong Answer | n,y=map(int,input().split())
for i in range(0,n+1):
for j in range(0,n+1):
if 10000*i+5000*j+1000*(n-i-j)==y and n-i-j>=0 :
print(i,j,n-i-j)
break
exit()
else:
print('-1 -1 -1') |
p03471 | s037396277 | Wrong Answer | N,Y = map(int,input().split())
for i in range(N):
for j in range(N):
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) |
p03471 | s070338214 | Wrong Answer | N, Y = map(int, input().split())
for i in range(N+1):
for j in range(i, N+1):
if Y == 10000*i + 5000*j + 1000*(N-i-j):
print(i, j, (N-i-j))
exit()
print(-1, -1, -1)
|
p03471 | s578416297 | Wrong Answer | n, y = map(int, input().split())
d = y - 1000*n
a = d // 9000
ab = []
for i in range(a+1):
d2 = d - 9000*i
b = d2 // 4000
for j in range(b+1):
d3 = d2 - 4000*j
if d3 == 0:
ab.append(i)
ab.append(j)
if len(ab) == 0:
print(-1,-1,-1)
else:
c = n - ab[0] - ab[1]
if c >= 0:
print(ab[0], ab[1], c)
else:
print(-1,-1,-1) |
p03471 | s898325352 | Wrong Answer | import sys
sys.setrecursionlimit(10**6)
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):
for j in range(N):
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 | s653990373 | Wrong Answer | n, Y = map(int, input().split())
for x in range(n+1):
for y in range(n):
z = n - x - y
if 10000*x + 5000*y +1000*z == Y and 0<=z<=2000:
print('{} {} {}' .format(x, y, z))
exit()
print('-1 -1 -1') |
p03471 | s454492445 | Wrong Answer | 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 i+j>0:
continue
h=n-i-j
if 10000*i+5000*j+1000*h==y:
a,b,c=i,j,h
break
print("{} {} {}".format(a,b,c)) |
p03471 | s560016955 | Wrong Answer | 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("{0} {1} {2}".format(i, j, (n - i - j)))
exit(0)
print("-1 -1 -1") |
p03471 | s182629095 | Wrong Answer | n, Y = map(int,input().split())
ans = 0
flag = False
for y in range(n+1):
for x in range(n+1):
z = int((Y- 5000*y - 10000*x)/1000)
if 0 < z + y + x <= n and 0 <= z:
print(x, y, z)
flag = True
break
elif x == n:
print(-1, -1, -1)
flag = True
break
if flag:
break
|
p03471 | s832638886 | Wrong Answer |
n,y = list(map(int,input().split()))
if y/n > 10000:
print('-1 -1 -1')
elif y < n*1000:
print('-1 -1 -1')
else:
for a in range(y//10000 +1):
for b in range(y//5000 +1):
if n-a-b >= 0:
if 10*a + 5*b + (n-a-b) == (y/1000):
print(*[a,b,n-a-b])
exit()
print('-1 -1 -1')
|
p03471 | s998004801 | Wrong Answer | try:
N, Y = map(int, input().split())
cnt = 0
for x in range(N):
for y in range(N):
z = N-x-y
if z>=0 and 10000*x+5000*y+1000*z==Y:
cnt += 1
print(x,y,z)
break
if cnt==0:
print('-1 -1 -1')
except EOFError:
pass |
p03471 | s279182980 | Wrong Answer | N, Y = map(int, input().split())
for x in range(N, -1, -1):
for y in range(N-x, -1, -1):
for z in range(N-x-y, -1, -1):
if (10000*x)+(5000*y)+(1000*z) == Y:
print(x, y, z)
exit()
print(-1, -1, -1) |
p03471 | s541113224 | Wrong Answer | n,y=map(int,input().split())
y=y//1000
if y<n or 10*n<y:
print(-1,-1,-1)
else:
for i in range((y-n)//9+1):
if (y-n-9*i)%4==0:
a=i
b=y-n-9*i
if n-a-b>=0:
print(a,b,n-a-b)
break
else:
print(-1,-1,-1)
|
p03471 | s222654940 | Wrong Answer | import sys
n, y = map(int, input().split())
x = y//10000
for a in list(reversed(range(x+1))):
for b in range((y-10000*a)//5000):
c = n - a - b
if 10000*a + 5000*b + 1000*c == y:
print('{0} {1} {2}'.format(a,b,c))
sys.exit()
print('-1 -1 -1') |
p03471 | s955378428 | Wrong Answer | import sys
data = input().split(' ')
number = int(data[0])
price = int(data[1])
for i in range(0, number+1):
million = 10000 * i
numberthous = number - i
for j in range(0, numberthous+1):
thousand = 1000 * j
numberhund = numberthous - j
for k in range(0, numberhund+1):
hundred = 100 * k
if(million+thousand+hundred==price):
print(str(i) + ' ' + str(j) + ' ' + str(k))
sys.exit()
print('-1 -1 -1') |
p03471 | s172221197 | Wrong Answer | N,Y = map(int,input().split())
flg = False
a=0
b=0
c=0
for x in range(N+1):
for y in range(N+1):
for z in range(N+1):
if 10000*x + 5000*y + 1000*z == Y:
a = x
b = y
c = z
flg = True
break
if flg == True:
print(a,b,c)
else:
print(-1,-1,-1) |
p03471 | s573712923 | Wrong Answer | N, Y = map(int, input().split())
result = None
for i in range(N+1):
if result is not None:
break
for j in range(i+1):
total = 10000 * (N-i) + 5000 * (i-j) + 1000 * j
if (total < Y):
result = "%s %s %s" % (-1,-1,-1)
break
elif (total == Y):
result = "%s %s %s" % (N-i, i-j, j)
break
else:
continue
print(result) |
p03471 | s011856566 | Wrong Answer | n, Y = map(int, input().split())
fin = True
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)
fin = False
break
if fin:
print('-1 -1 -1') |
p03471 | s202781410 | Wrong Answer | N,Y = map(int,input().split())
target = Y - 1000*N
a,b,c =-1,-1,-1
for i in range(N+1):
target_x = target - 4000*i
# print(target_x)
if target_x < 4000:
break
if target_x % 9000 == 0:
a = int(target / 9000)
b = i
c = N - a - b
break
print(*[a,b,c]) |
p03471 | s333414075 | Wrong Answer | N, Y = map(int, input().split())
isFound = False
for x in range(N):
if isFound:
break
for y in range(N):
z = N-x-y
if (10000*x+5000*y+1000*z==Y)&(z>=0):
print('{} {} {}'.format(x,y,z))
isFound = True
break
if isFound == False:
print('-1 -1 -1') |
p03471 | s748309024 | Wrong Answer | N, Y = map(int,(input().split()))
a = Y // 10000
Y = Y - (a * 10000)
b = Y // 5000
Y = Y - (b * 5000)
c = Y // 1000
if a + b + c <= N:
print(str(a) + ' ' + str(b) + ' ' + str(c))
else:
print('-1 -1 -1') |
p03471 | s953365239 | Wrong Answer | n,y=map(int, input().split())
y=y//1000
for i in range(1+y//10):
if i>n:
pass
for j in range(1+(y-10*i)//5):
if i+j>n:
pass
if y==10*i+5*j+(n-i-j):
print(i,j,n-i-j)
exit()
print(y//10000) |
p03471 | s347107549 | Wrong Answer | print('-1 -1 -1') |
p03471 | s427227715 | Wrong Answer | n, y = map(int, input().split())
for a in range(n+1):
for b in range(n+1):
for c in range(n+1):
if(1000*a + 5000*b + 10000*c == 45000):
print(c, b, a)
quit() |
p03471 | s342043523 | Wrong Answer | N,Y = map(int,input().split())
f = 0
for x in range(2001):
for y in range(2001):
z = N - x - y
if 10000*x + 5000*y + 1000*z == Y and z >= 0:
print(x,y,z)
f = 1
break
if f == 0:
print('-1','-1','-1') |
p03471 | s202319942 | Wrong Answer | n,y=map(int,input().split())
flag=True
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)
flag=False
break
if flag==False:
print(-1,-1,-1)
|
p03471 | s094022567 | Wrong Answer | N, SUM = map(int,input().split())
X=10000
Y=5000
Z=1000
ans = [-1, -1, -1]
for x in range(SUM//X+1):
for y in range(SUM//Y+1):
rest = SUM-x*X-y*Y
if rest % 1000 == 0:
ans = [x, y, rest//Z]
if sum(ans)==N:
break
else:
ans = [-1,-1,-1]
print(*ans)
|
p03471 | s588762215 | Wrong Answer | n, y = map(int, input().split())
ans1 = -1
ans2 = -1
ans3 = -1
for i in range(n):
for j in range(n):
if 10000*i + 5000*j + (n-(i+j))*1000 == y:
ans1 = i
ans2 = j
ans3 = n-(i+j)
break
print(ans1, ans2, ans3) |
p03471 | s267286109 | Wrong Answer | N, Y = map(int, input().split())
x = -1
y = -1
z = -1
if Y%1000 == 0:
Y = Y//1000
n = (Y-N)//9
for i in range(1,n+1):
if ((Y-N)-9*i)%4==0 and (Y-N)>=9*i and N>=i+((Y-N)-9*i)//4:
x = i
y = ((Y-N)-9*i)//4
z = N-x-y
print(x,y,z,sep=' ')
|
p03471 | s804780868 | Wrong Answer | N, Y = map(int, input().split())
result = []
for a in range(N+1):
for b in range(N+1):
for c in range(N+1):
total = a * 10000 + b * 5000 + c * 1000
if total == Y:
result.append([a, b, c])
if len(result) == 0:
print("0 0 0")
else:
print(" ".join(map(str, result[0]))) |
p03471 | s739353764 | Wrong Answer | n, y = map(int, input().split())
for i in range(n + 1):
if 1000 * i > y:
break
for j in range(n + 1):
k = n - (i + j)
if 1000*i + 5000*j + 10000*k > y or k < 0 or k > 2000:
break
if 1000*i + 5000*j + 10000*k == y:
print(k, j, i)
exit()
print("-1 -1 -1") |
p03471 | s265525117 | Wrong Answer | N,Y=map(int,input().split())
num=0
for x in range(N):
for y in range(N):
for z in range(N):
if x+y+z==N and 10000*x+5000*y+1000*z==Y:
print(x,y,z)
break
else:
num+=1
if num==N**3:
print(-1,-1,-1,sep=" ")
|
p03471 | s532048269 | Wrong Answer | N,Y = map(int,input().split())
s=0
for x in range(2000):
for y in range(2000):
z = N - (x+y)
if 1000*x + 5000*y + 10000*z == Y:
print(x,' ',y,' ',z)
s = s+1
else:
continue
break
if s == 0:
print(-1,' ',-1,' ',-1) |
p03471 | s869359947 | Wrong Answer | 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:
result = True
print(x,y,z)
break
else:
continue
break
if result == False:
print(-1,-1,-1) |
p03471 | s195138500 | Wrong Answer | n, y = map(int, input().split())
count = 0
for i in range(n+1):
for j in range(n+1):
rest = y - 10000*i - 5000*j
if rest / 1000 == n-i-j:
print(i, j, n-i-j)
count += 1
break
if count == 0:
print(-1,-1,-1) |
p03471 | s316430161 | Wrong Answer | N,Y=map(int,input().split())
s=0
for x in range(0,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 | s844279044 | Wrong Answer | n, y = map(int, input().split())
x = 0
y = 0
z = n
s = [(0, 0, n)]
while len(s) > 0:
x, y, z = s.pop()
if 10000*x+5000*y+1000*z == y:
print(x, y, z)
exit()
else:
if z > 0:
s.append((x+1, y, z-1))
if x-y > 1:
s.append((x, y+1, z-1))
print("-1, -1, -1")
|
p03471 | s743916369 | Wrong Answer | N,Y=map(int,input().split())
xyz=[]
for x in range(N):
for y in range(N-x):
z=N-(x+y)
total=10000*x+5000*y+1000*z
if (total==Y)&(x+y+z==N):
xyz.append([x,y,z])
if xyz:
print(xyz[0])
else:
print([-1,-1,-1]) |
p03471 | s054608371 | Wrong Answer | n ,y = map(int,input().split())
list = [-1,-1,-1]
for i in range(n+1):
for j in range(n+1 - i):
for k in range(n + 1 - i - j):
if (i * 10000 + j * 5000 + k* 1000) == y:
list = [i,j,k]
if sum(list) > 0:
break
print(list) |
p03471 | s765316806 | Wrong Answer | from sys import stdin
import sys
def solves():
n, y = list(map(int,input().split()))
for i in range(n+1):
for j in range(1,n+1):
if 10000*i + 5000*j + 1000*(n-i-j) == y:
print(i, j, n-i-j)
return
print(-1,-1,-1)
if __name__ == "__main__":
solves() |
p03471 | s622659718 | Wrong Answer | N,Y=map(int,input().split())
for i in range(N+1):
for j in range(N+1-i):
for k in range(N+1-i-j):
if i*10000+j*5000+k*1000==Y:
print(i,j,k)
exit()
else:
print("{0} {1} {2}".format(-1,-1,-1)) |
p03471 | s551941437 | Wrong Answer | N, Y = map(int, input().split())
found = False
for i in range(N+1):
for j in range(N+1):
k = (Y - 10000*i + 5000*j) // 1000
if i + j + k == N and k >= 0:
print(i, j, k)
found = True
break
if found:
break
if not found:
print(-1, -1, -1) |
p03471 | s791639094 | Wrong Answer | n,Y = map(int,input().split())
Y = int(Y / 1000)
ans = [-1,-1,-1]
for x in range(n):
for y in range(n):
if 10*x + 5*y + (n-x-y) == Y and n-x-y >= 0:
ans = [x,y,n-x-y]
print(*ans) |
p03471 | s366403524 | Wrong Answer | n, y = map(int, input().split())
j=True
if y % 1000 != 0 or y // 10000 > n:
print(-1, -1, -1)
for th in range(0, n+1) :
for fh in range(0, n-th+1) :
if th * 10000 + fh * 5000 + (n-fh-th) * 1000 == y :
print (th, fh, n-fh-th)
j = False
break
else :
continue
break
if j == True:
print(-1, -1, -1) |
p03471 | s536855360 | Wrong Answer | n,y=map(int,input().split())
f=0
for i in range (n+1):
if f==1:
break
for j in range(n+1):
k=n-i-j
if 10000*i+5000*j+1000*k==y:
print("{} {} {}".format(i,j,k))
f=1 |
p03471 | s965094475 | Wrong Answer | n, y = map(int, input().split())
res10000 = -1
res5000 = -1
res1000 = -1
for i in range(n):
for j in range(n-i):
k = n - i - j
if 10000 * i + 5000 * j + 1000 * k == y:
res10000 = i
res5000 = j
res1000 = k
break
print(res10000, res5000, res1000) |
p03471 | s024489170 | Wrong Answer | n,y = map(int,input().split())
i5000 = 0
i10000 = 0
N = n + 1
for i1000 in range(N):
for i5000 in range(N - i10000):
i10000 = n - i1000 - i5000
sum = i10000*10000 + i5000*5000 + i1000*1000
if sum == y:
print(i10000,i5000,i1000)
exit()
print("-1 -1 -1") |
p03471 | s977301248 | Wrong Answer | N,Y = map(int,input().split())
f = 0
for x in range(2001):
for y in range(2001):
z = N - x - y
if 10000*x + 5000*y + 1000*z == Y and z > 0:
print(x,y,z)
f = 1
break
if f == 0:
print('-1','-1','-1') |
p03471 | s450879991 | Wrong Answer | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import math
N, Y = map(int, input().strip().split())
x = -1
y = -1
z = -1
for i in range(N+1):
if i * 10000 > Y:
break
for j in range(N+1-i):
z = int((Y - i * 10000 - j * 5000) / 1000)
if i + j + z == N and z >= 0:
x = i
y = j
break
if not x == -1:
break
print('{} {} {}'.format(x, y, z))
|
p03471 | s777201201 | Wrong Answer | n,y = map(int, input().split())
for i in range(n):
total = y - i * 10000
for j in range(n):
left = max((total - j * 5000) ,-1)
if (left // 1000) == (n - i - j) and left % 1000 == 0:
print("{} {} {}".format(i,j,n-i-j))
exit()
print("-1 -1 -1") |
p03471 | s732857770 | Wrong Answer | n, y = map(int, input().split())
ans=[]
for i in range(n):
for j in range(n):
if i+j<=n:
k=n-i-j
else:
k=0
if 10000*i+5000*j+1000*k==y and i+j+k==n:
ans+=i,j,k
break
else :
continue
break
if len(ans)==0:
ans+=-1,-1,-1
print(ans[0],ans[1],ans[2]) |
p03471 | s009844177 | Wrong Answer | 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:
print(a, b, c)
exit()
print('-1 -1 -1') |
p03471 | s764524139 | Wrong Answer | N, Y = list(map(int, input().split()))
flag = False
for x in range(N):
for y in range(N-x):
z = N - x - y
if Y == 10000 * x + 5000 * y + 1000 * z:
print(x, y, z)
flag = True
quit()
if flag:
print("-1 -1 -1") |
p03471 | s265721293 | Wrong Answer | [N,Y] = list(map(int,input().split(' ')))
t = int(Y/1000 - N)
x = -1
y = -1
z = -1
for i in range(min(N, int(t/9))):
if (int((t - 9*i)/4) == (t - 9*i)/4) and (N - i - int((t - 9*i)/4) >= 0):
x = i
y = int((t - 9*i)/4)
z = N - x - y
break
elif ((t - 9*i)/4 < 0):
break
else:
continue
print('{0} {1} {2}'.format(x,y,z)) |
p03471 | s264833681 | Wrong Answer | n, y = map(int, input().split())
a = -1 # 10000
b = -1 # 5000
c = -1 # 1000
for i in range(n + 1):
for j in range(n + 1):
k = n - i - j
if y == 10000 * i + 5000 * j + 1000 * k:
a = i
b = j
c = k
print("{} {} {}".format(a, b, c))
|
p03471 | s986014487 | Wrong Answer | n, y = map(int, (input().split()))
for i in range(21):
a = i
b = (y-10000*a-1000*n+1000*a) / 4000
c = n-a-b
if b == int(b) and c == int(c) and b >= 0 and c >= 0:
print(a, int(b), int(c))
exit()
print(-1, -1, -1)
|
p03471 | s356350026 | Wrong Answer | number,summ = list(map(int,input().split()))
for a in range(number+1):
for b in range(number+1):
c = number-a-b
tmp = 1000*a + 5000*b + 10000*c
if tmp == summ:
print(a,b,c)
exit() |
p03471 | s566458237 | Wrong Answer | N, Y = list(map(int, input().split()))
answer1 = -1
answer2 = -1
answer3 = -1
for i in range(N + 1):
for j in range(N + 1):
k = N - i - j
if 10000 * i + 5000 * j + 1000 * k == Y:
answer1 = i
answer2 = j
answer3 = k
print(str(answer1) + " " + str(answer2) + " " + str(answer3)) |
p03471 | s978732396 | Wrong Answer | N,Y=map(int,input().split())
n=Y//10000
if n>N:
print("-1 -1 -1")
exit()
for i in range(n+1):
fukuzawa=10000*i
x=i
for j in range(N-n+1):
higuchi=5000*j
y=j
if fukuzawa+higuchi+1000*(N-x-y)==Y:
z=N-x-y
print(x,y,z)
exit()
print("-1 -1 -1") |
p03471 | s931080688 | Wrong Answer | a,b = map(int,input().split())
flag = 0
for i in range(a):
for j in range(a):
nokori = b - ((i * 1000) + (j * 5000))
if nokori%10000 == 0 and nokori >= 0:
k = int(nokori/10000)
if (i+j+k)==a:
flag = 1
break
elif nokori == 0 and (i+j) == a:
k = 0
flag = 1
break
if flag == 1:
break
if flag == 1:
print(i,j,k)
else:
print("-1 -1 -1") |
p03471 | s832905803 | Wrong Answer | N, Y = list(map(int, input().split()))
result = '-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:
result = '{} {} {}'.format(x, y, z)
break
print(result)
|
p03471 | s242297478 | Wrong Answer | N, Y = map(int, input().split())
Y /= 1000
flag = False
for i in range(N+1):
if flag:
break
for j in range(N+1):
if N - i - j < 0:
break
if Y - 10 * i - 5 * j == N - i - j:
flag = True
print(i, j, N-i-j)
else:
break
if flag == False:
print(-1,-1,-1) |
p03471 | s115128378 | Wrong Answer | 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(i,j,n-i-j)
exit()
print(-1,-1,-1)
if __name__=="__main__":
main() |
p03471 | s134351891 | Wrong Answer | n, money = map(int, input().split())
ans = [0, 0, 0]
flag = False
for i_1000 in range(n+1):
for j_5000 in range(n - i_1000 + 1):
if (money - i_1000 * 1000 - j_5000 * 5000) == 10000 * (n - i_1000 - j_5000):
flag = True
ans = [i_1000, j_5000, n - i_1000 - j_5000]
if flag:
break
print(ans[0], ans[1], ans[2])
|
p03471 | s726411017 | Wrong Answer | n, yen = map(int, input().split())
x = y = z = -1
for a in range(n):
for b in range(n-a):
num = n - a - b
if (10000*a + 5000*b + 1000*num) == yen:
x = a
y = b
z = num
break
print(x, y, z)
|
p03471 | s674337416 | Wrong Answer | n, y = map(int, input().split())
flg = 0
for i in range(n+1):
for j in range(n+1):
m = (y-1000*i-5000*j)/10000
if m+i+j == n:
flg = 1
a=i
b=j
c=int(m)
if flg == 1:
print(c,b,a)
else:
print(-1,-1,-1)
|
p03471 | s148556776 | Wrong Answer | all = list(map(int, input().split()))
N = all[0]
Y = all[1]
yu = -1
hi = -1
no = -1
for i in range(N):
for j in range(N-i):
c = (N-(i+j))
total = 10000*i + 5000*j + 1000*c
if Y!=total:
continue
else:
yu = i
hi = j
no = c
break
else:
continue
break
print(yu)
print(" ")
print(hi)
print(" ")
print(no)
print(" ")
|
p03471 | s718016174 | Wrong Answer | N, Y = map(int, input().split())
x_out, y_out, z_out = -1, -1, -1
for x in range(N+1):
for y in range(N-x):
z = N - x - y
xyz_sum = x*10000 + y*5000 + z*1000
if xyz_sum == Y:
x_out, y_out, z_out = x, y, z
break
print(x_out, y_out, z_out) |
p03471 | s477788981 | Wrong Answer | N,Y=map(int, input().split())
ans=False
for man in range(N+1):
for gosen in range(N-man+1):
for sen in range(N-man-gosen):
if man*10000+gosen*5000+sen*1000==Y:
print(str(man)+" "+str(gosen)+" "+str(sen))
ans=True
exit()
if not ans:
print("-1 -1 -1") |
p03471 | s484106333 | Wrong Answer | N,y = [int(x) for x in input().split()]
y = y // 1000
for i in range(y//5+1):
nokori = i*5
kosuu = y - i*5
if kosuu > N:
continue
if kosuu == N and nokori == 0:
print("0 0 " + str(y-i*5))
exit()
for j in range(nokori//10+1):
kosuu = kosuu + j + (nokori-10*j)//5
if kosuu == N:
print(str(j)+" "+str((nokori-10*j)//5)+" "+str(y-i*5))
exit()
print("-1 -1 -1") |
p03471 | s730159252 | Wrong Answer | import sys
def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()
INF = float('inf')
n, y = LI()
ans = [-1, -1, -1]
for i in range(n + 1):
for j in range(n + 1):
k = n - i - j
money = 10000 * i + 5000 * j + 1000 * k
if money == y:
ans = [i, j, k]
break
print(*ans)
|
p03471 | s981281925 | Wrong Answer | N, Y = map(int, input().split())
for x in range(N+1):
if 10000*x > Y:
break
for y in range(N-x+1):
if 10000*x + 5000*y > Y:
break
z = N - x -y
if 10000*x + 5000*y + 1000*z == Y:
print(x, y, z)
exit()
print("-1, -1, -1")
|
p03471 | s953894555 | Wrong Answer | n,Y=map(int,input().split())
for i in range(n+1):
if (Y-1000*n-9000*i)%4000==0 and (Y-1000*n-9000*i)>=0 and (Y-1000*n-9000*i)//4000<=n and n-i-(Y-1000*n-9000*i)>=0 and n-i-(Y-1000*n-9000*i)//4000<=n:
print("{} {} {}".format(i,(Y-1000*n-9000*i)//4000,n-i-(Y-1000*n-9000*i)//4000))
exit()
print("{} {} {}".format(-1,-1,-1)) |
p03471 | s985024169 | Wrong Answer | N,Y = map(int,input().split())
arr = []
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:
arr.append([i,j,k])
if len(arr) >0:
print(arr[0][0],arr[0][1],arr[0][2])
else:
print(-1,-1,-1) |
p03471 | s686233782 | Wrong Answer | import sys
input=sys.stdin.readline
n,y=map(int,input().split())
y10,y5,y1=0,0,0
for i in range(n+1):
for j in range(n+1):
for k in range(n+1):
if 10000*i+5000*j+1000*k==y and i+j+k==n:
print(i,j,k)
exit(0) |
p03471 | s660044560 | Wrong Answer | 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 10000*a + 5000*b + 1000*c == y:
print(a, b, c)
exit()
print(-1, -1, -1) |
p03471 | s455523361 | Wrong Answer | n,y=map(int,input().split())
y //=1000
for i in range(n):
for j in range(n):
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 | s275795190 | Wrong Answer | import sys
N,Y=map(int,input().split())
ans=0
for x in range (N):
for y in range(N):
if 10000*x+5000*y+1000*(N-x-y)==Y:
print(str(x)+' '+str(y)+' '+str(N-x-y))
sys.exit()
print(-1,-1,-1) |
p03471 | s750390157 | Wrong Answer | N,Y = map(int,input().split())
for x in range(1,N+1):
for y in range(N-x+1):
z_m = Y-(10000*x+5000*y)
z_n = N-x-y
if z_m >=0 and z_m//1000 == z_n:
print(x,y,z_n)
exit()
print(-1,-1,-1) |
p03471 | s691853858 | Wrong Answer | N,Y = map(int,input().split())
flag = False
for i in range(N+1):
for j in range(N+1-i):
x = N - i - j
if x*1000 + j*5000 +i*10000 == Y:
print('{0} {1} {2}'.format(i ,j,x ))
flag = True
break
if flag == False:
print('-1 -1 -1') |
p03471 | s608023073 | Wrong Answer | N,Y=map(int,input().split())
xyz=[]
for x in range(N+1):
for y in range(N-x+1):
z=N-(x+y)
total=10000*x+5000*y+1000*z
if total==Y:
xyz.append([x,y,z])
if xyz:
print(xyz[0])
else:
print([-1,-1,-1]) |
p03471 | s830572494 | Wrong Answer | N, Y = map(int, input().split())
Y //= 1000
for y in range(9):
Y -= 5 * y
N -= y
if Y >= 0 and N >= 0:
x, p = divmod(Y - N, 9)
z, q = divmod(10*N - Y, 9)
if p == 0 and q == 0 and x >= 0 and z >= 0:
print(x, y, z)
exit()
print(-1, -1, -1) |
p03471 | s290034317 | Wrong Answer | n,y = map(int, input().strip().split())
a_x, a_y, a_z = -1, -1, -1
for xi in range(n + 1):
for yi in range(n - xi + 1):
zi = n - xi - yi
if 1000*xi + 5000*yi + 10000*zi == y:
a_x = xi
a_y = yi
a_z = zi
break
print(a_x, a_y, a_z)
|
p03471 | s844306561 | Wrong Answer | [N,Y] = list(map(int,input().split(' ')))
t = int(Y/1000 - N)
x = -1
y = -1
z = -1
for i in range(min(N, int(t/9))):
if ((t - 9*i)/4 < 0):
break
elif (int((t - 9*i)/4) == (t - 9*i)/4) and (N - i - int((t - 9*i)/4) >= 0):
x = i
y = int((t - 9*i)/4)
z = int(N - x - y)
break
else:
continue
print('{0} {1} {2}'.format(x,y,z)) |
p03471 | s906528559 | Wrong Answer | N, Y = map(int, input().split())
Y = Y // 1000
k10, k5, k1 = -1, -1, -1
success = False
price = 0
for i in range(N+1):
price = i * 10
if price == Y:
k10, k5, k1 = i, 0, 0
success = True
break
for j in range(N-i+1):
k = N - i - j
price = i * 10 + j * 5 + k * 1
if price == Y:
k10, k5, k1 = i, j, k
success = True
break
if success:
break
print(k10, k5, k1) |
p03471 | s169765383 | Wrong Answer | n,y = map(int,input().split())
y = y // 1000
man,gosen,sen = 0,0,0
sen = y % 5
y -= sen
n -= sen
for i in range(y//10+1)[::-1]:
amount = y - i*10
for j in range(0,n-i+1,5):
amount -= j + (n-i-j)*5
if amount == 0:
print(i,j,(n-i-j))
exit(0)
if amount < 0:
print('-1 -1 -1')
exit(0) |
p03471 | s680253081 | Wrong Answer | n,y = list(map(int, input().split()))
a = 0
b = 0
c = 0
if 10000*n < y:
print("-1 -1 -1")
elif 10000*n == y:
print("%d -1 -1" %n)
else:
for i in range(n+1):
for j in range(n+1):
for k in range(n+1):
if 10000*i+5000*j+1000*k == y:
a = i
b = j
c = k
break
print("%d %d %d" %(a, b, c)) |
p03471 | s142622322 | Wrong Answer | N, Y =map(int, input().split())
X = [-1,-1,-1]
for i in range(2000):
y = (Y-1000*N-9000*i)/4000
if not float.is_integer(y):
continue
if 0<= N-i-y <= 2000 and 0<= y <= 2000 and 0 <= i <= 2000:
X=[i, y, N-i-y]
X=list(map(int, X))
break
print(*X)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.