problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03471 | s451174709 | Wrong Answer | N, Y = map(int, input().split())
x_max = Y // 10000
y_max = Y // 5000
z_max = Y // 1000
flag = False
for x in range(x_max +1):
if flag == True:
break
if (N-x)*5000 > Y-10000*x:
for y in range(N-x+1):
for z in range(N-x-y+1):
if 10000*x + 5000*y + 1000*z == Y and x+y+z == N:
print(x,y,z)
flag = True
if flag == False:
print(-1, -1, -1) |
p03471 | s773526648 | Wrong Answer | # 085 C
N,Y = map(int, input().split())
x,y,z = -1,-1,-1
for i in range(N):
for j in range(N):
if ((10000*i + 5000*j + 1000*(N-i-j)) == Y)and(N-i-j>=0):
x,y = i,j
z = N - i - j
break
else:
continue
break
print(x,y,z)
|
p03471 | s562132324 | Wrong Answer | N,Y=map(int,input().split( ))
x=N
y=0
z=0
def judg(x,y,z):
if Y==x*10000+y*5000+z*1000:
print(x,y,z)
exit()
for i in range(N+1):
x1=x-i
y=i
if Y==x1*10000+y*5000+z*1000:
print(x1,y,z)
exit()
else :
for j in range(i+1):
y1=y-j
z1=z+j
judg(x1,y1,z1) |
p03471 | s249516201 | Wrong Answer | n, y = list(map(int, input().split()))
flag = True
for i in range(n):
for j in range(n-i):
if 10000*i+5000*j+1000*(n-i-j) == y:
print(i, j, n-i-j)
flag = False
break
if flag:
print(-1, -1, -1) |
p03471 | s219988893 | Wrong Answer | # coding: utf-8
# https://atcoder.jp/contests/abc085/tasks/abc085_c
# 19:24-19:34
def main():
N, Y = map(int, input().split())
y = Y // 1000
for b in range(N+1):
if (y-N-4*b) % 9 == 0:
c = (y-N-4*b) // 9
a = N - b - c
if a >= 0:
return "{} {} {}".format(c, b, a)
return "-1 -1 -1"
print(main())
|
p03471 | s419672671 | Wrong Answer | input_str = input().split()
N = int(input_str[0])
Y = int(input_str[1])
x_quo = Y//10000
for x in range(0,x_quo+1):
Y_x = Y - 10000*x
y_quo = Y_x // 5000
for y in range(0,y_quo+1):
Y_xy = Y_x - 5000*y
z_quo = Y_xy // 1000
for z in range(0,z_quo+1):
if 10000*x + 5000*y + 1000*z == Y and x+y+z == N:
break;
else:
continue
break
else:
continue
break
print(str(x) + " " + str(y) + " " + str(z))
|
p03471 | s047225787 | Wrong Answer | N, Y = [int(n) for n in input().split(' ')]
x = -1
y = -1
z = -1
for a in range(1, N+1):
for b in range(N+1-a):
c = N-a-b
if (10000*a + 5000*b + 1000*c) == Y:
x = a
y = b
z = c
print(x, y, z)
|
p03471 | s670559836 | Wrong Answer | N,Y=map(int,input().split())
x = -1
y = -1
z = -1
for i in range(N):
for j in range(N-i):
k=N-j-i
sum = i*10000 + j*5000 + k*1000
if Y==sum and k+i+j==N:
x=i
y=j
z=k
break
else:
continue
break
print(str(x)+' '+str(y)+' '+str(z)) |
p03471 | s781661641 | Wrong Answer | import math
import sys
input = sys.stdin.readline
N,Y = map(int, input().split())
flag=0
for i in range(0,N+1):
for j in range(0,N-i):
if(Y-10000*i-5000*j)/1000 == N-i-j :
a = i
b = j
c = N-i-j
flag =1
print(a,b,c)
break
if flag==1:
break
if flag!=1:
print("-1 -1 -1")
|
p03471 | s251217667 | Wrong Answer | n,y=map(int,input().split())
for i in range(n+1):
ai=10000*i
if ai > y: continue
else:
for j in range(n+1-i):
bj=5000*j
if ai + bj > y :break
else :
k=n-i-j
if ai + bj + 1000*k == y:
print(i,j,k)
print(-1,-1,-1) |
p03471 | s751441238 | Wrong Answer | n,y = map(int, input().split())
itiman = y // 10000
gosen = (y - (itiman * 10000)) // 5000
sen = (y - (itiman * 10000 + gosen * 5000)) // 1000
while itiman + gosen + sen < n:
if gosen == 0:
gosen += 2
itiman -= 1
else:
gosen -= 1
sen += 5
if itiman + gosen + sen > n:
print("-1 -1 -1")
else:
print(str(itiman) + " " + str(gosen) + " " + str(sen)) |
p03471 | s968130845 | Wrong Answer | n ,y = map(int, input().split())
res = [-1,-1,-1]
for i in range(n):
for j in range(n+1-i):
ans = 10000*i + 5000*j +1000*(n-i-j)
if ans == y :
res =[i , j, n-i-j]
break
print(*res) |
p03471 | s662752867 | Wrong Answer | N,Y=map(int,input().split())
x=y=z=0
while N and 5000*N<Y:
Y-=10000
N-=1
x+=1
while N and 1000*N<Y:
Y-=5000
N-=1
y+=1
z=N
if z*1000==Y:
print(x,y,z)
else:
print(-1,-1,-1) |
p03471 | s604541905 | Wrong Answer | n,s = map(int, input().split())
for x in range(n):
for y in range(n):
tmp = n-x-y
tmp2 = s-x*10000-y*5000
if tmp*1000 == tmp2 and tmp >= 0:
print('{} {} {}'.format(x,y,tmp))
exit(0)
print('-1 -1 -1') |
p03471 | s730059816 | Wrong Answer |
main_list = input().split()
n = int(main_list[0])
y = int(main_list[1][:-3])
for i in range(n+1):
for j in range(n-i+1):
if y == i*10 + j*5 + (n-i-j)*1:
print(" ".join(list(map(str,[i,j,n-i-j]))))
elif y > i*10 + j*5 + (n-i-j)*1 + 5:
break
print(n,y) |
p03471 | s212991370 | Wrong Answer | n,y = map(int,input().split())
for i in range(n+1):
for j in range(n+1):
if (y - 1000*i - 5000*j)/10000 == n-i-j:
print(i,j,n-i-j)
exit()
print(-1,-1,-1) |
p03471 | s565617665 | Wrong Answer | n,y=map(int, input().split())
for i in range(n):
for j in range(n):
if 10000*i+5000*j+1000*(n-i-j)==y and n-i-j>=0:
print(i,j,n-i-j)
exit()
print('-1 -1 -1') |
p03471 | s315116592 | Wrong Answer | N,Y = map(int,input().split())
A,B,C = -1,-1,-1
flag = False
for i in range(N):
if flag:
break
for j in range(N-i):
if i*10000 + j*5000 + (N-i-j)*1000 == Y and (N-i-j) >= 0:
A,B,C = i,j,(N-i-j)
flag = True
break
print(A,B,C) |
p03471 | s033729587 | Wrong Answer | N, Y = map(int, input().split())
if Y // 1000 == N:
print('0 0',N)
man_max = Y // 10000
gosen_max = Y // 5000
is_exist = False
for i_m in range(man_max+1):
for i_g in range(gosen_max+1):
if 99000*i_m + 4000*i_g == Y - 1000*N:
print(i_m, i_g, int(Y / 1000 - 10*i_m - 5*i_g))
is_exist = True
break
if is_exist:
break
if not is_exist:
print(-1, -1, -1)
|
p03471 | s129024843 | Wrong Answer | n,y = map(int,input().split())
ans = [[-1, -1, -1]]
for i in range(n):
for j in range(n):
for k in range(n):
if (10000 * i + 5000 * j + 1000 * k == y) & (i+j+k==9):
ans.append([i,j,k])
break
print(ans[-1]) |
p03471 | s621223078 | Wrong Answer | N, Y = map(int,input().split())
def answer():
for n_1000 in range(N+1):
for n_5000 in range(N+1):
n_10000 = N - n_1000 - n_5000
if n_10000 < 0:
continue
if n_1000 * 1000 + n_5000 * 5000 + n_10000 * 10000 == Y:
return (n_1000, n_5000, n_10000)
return (-1, -1, -1)
print(" ".join(list(map(str,answer())))) |
p03471 | s909453522 | Wrong Answer | N,Y = [int(x) for x in input().split()]
def func(N,Y):
a=Y//N
if 10000*a==Y:
return a,0,0
for m in range(N-1,-1,-1):
for i in range(0,m+1):
if 10000*m+5000*i+1000*(N-m-i)==Y:
return m,i,N-m-i
return -1,-1,-1
a,b,c=func(N,Y)
print(a,b,c) |
p03471 | s801214888 | Wrong Answer | import sys
num = sys.stdin.readline().split(' ')
N = int(num[0])
Y = int(num[1])
for x in range(N+1):
for y in range(N+1):
if 1000 * x + 5000 * y + 1000*(N-x-y) == Y:
print(str(x)+' '+str(y)+' '+str(N-x-y))
sys.exit()
else:
continue
print('-1 -1 -1')
|
p03471 | s518106545 | Wrong Answer | n,y = [int(i) for i in input().split()]
c3 = int(y%5000/1000)
#print(c3)
y -= c3*1000
n -= c3
for i in range(2001):
for j in range(2001):
if 10000*(i)+5000*(j)+1000*(n-i-j) == y:
print(i,j,n-i-j+c3)
exit()
print(-1,-1,-1) |
p03471 | s507765700 | Wrong Answer | N, Y = list(map(int, input().split()))
final_ans = None
for i in range(N + 1):
for j in range(N + 1):
ans = i * 10000 + j * 5000 + (N - i - j) * 1000
if ans == Y:
final_ans = " ".join([str(i), str(j), str(N - i - j)])
break
if final_ans is None:
print('-1 -1 -1 ')
else:
print(final_ans) |
p03471 | s580555259 | Wrong Answer | n,y = map(int, input().split())
a,b,c = -1,-1,-1
for i in range(n):
for j in range(n):
total = 10000*i + 5000*j + 1000*(n-i-j)
if(total == y and (n-i-j)>0):
a,b,c = i,j,(n-i-j)
print(a,b,c)
|
p03471 | s005535525 | Wrong Answer | n,y = map(int,input().split())
u = [10000,5000,1000]
x = []
for i in range(0,n+1):
for j in range(0,n-i+1):
w = n-i-j
if u[2]*i+u[1]*j+u[0]*w == y:
x = [w,i,j]
break
if len(x) == 0:
print("-1 -1 -1")
else:
print(" ".join(map(str,x)))
|
p03471 | s004268412 | Wrong Answer | N, Y = map(int, input().split())
baloon = True
for x in range(N+1):
for y in range(N+1):
z = N-x-y
if 10000*x + 5000*y + 1000*z == Y:
print(str(x) + ' ' + str(y) + ' ' + str(z))
baloon = False
break
if baloon:
print('-1 -1 -1') |
p03471 | s865999922 | Wrong Answer | n, y = map(int, input().split())
for i in range(n):
for j in range(n):
if 10000*n - 5000*i - 9000*j == y:
print(n-i-j, i, j)
quit()
print(-1,-1,-1)
|
p03471 | s272360688 | Wrong Answer | N, Y = map(int, input().split())
flag = False
for x in range(N):
for y in range(N):
z = N - x - y
if x + y + z == N and z >= 0:
if Y == 10000 * x + 5000 * y + 1000 * z:
print(x, y, z)
flag = True
break
if flag:
break
if not flag:
print(-1, -1, -1)
|
p03471 | s882264718 | Wrong Answer | nums = []
nums = input().split()
N = int(nums[0])
Y = int(nums[1])
for c in range(N+1) :
for b in range(N + 1):
for a in range(N + 1):
if( Y == 10000 * a + 5000 * b + 1000 *c ):
break
else:
continue
break
else:
continue
break
if( N < (a + b + c)):
print("-1 -1 -1")
else :
print(a,b,c) |
p03471 | s184449157 | Wrong Answer | n,y=map(int,input().split())
a=False
for i in range(n):
for j in range(n-i):
nogu=1000*i
higu=5000*j
huku=10000*(n-i-j)
if nogu+higu+huku==y:
print(n-i-j,j,i)
a=True
break
if a==True:
break
if a==False:
print('-1 -1 -1')
|
p03471 | s837057134 | Wrong Answer | n, y = map(int, input().split())
a = -1
b = -1
c = -1
k = 0
for i in range(n + 1):
for j in range(n - i):
k = n - i - j
s = 10000 * i + 5000 * j + 1000 * k
if s == y:
a = i
b = j
c = k
print(a, b, c) |
p03471 | s109337216 | Wrong Answer | n,y = map(int,input().split())
d = 0
for a in range(n):#10000
for b in range(n):#5000
c = n - a - b
x = 10000*a + 5000*b + 1000*c
if x == y and c >=0:
print("{} {} {}".format(a,b,c))
d =1
break
else:
continue
break
if d == 0:
print("-1 -1 -1") |
p03471 | s402878785 | Wrong Answer | n,y=list(map(int, input().strip().split()))
a=-1
b=-1
c=-1
for i in range(n+1):
for j in range(n-i+1):
s=(y-10000*i-5000*j)
if s%1000==0 and s>=0:
a=i
b=j
c=s//1000
break
print(a,b,c) |
p03471 | s630354938 | Wrong Answer | N,Y = map(int,input().split())
for i in range(N):
for j in range(N):
if N-i-j>=0:
if 10000*i+5000*j+1000*(N-i-j)==Y:
print(i,j,N-i-j)
exit()
print('-1','-1','-1')
|
p03471 | s567806625 | Wrong Answer | N, Y = map(int, input().split())
if Y // 1000 == N:
print(0, 0, N)
man_max = Y // 10000
gosen_max = Y // 5000
is_exist = False
for i_m in range(man_max+1):
for i_g in range(gosen_max+1):
if 99000*i_m + 4000*i_g == Y - 1000*N:
print(i_m, i_g, int(Y / 1000 - 10*i_m - 5*i_g))
is_exist = True
exit()
print(-1, -1, -1)
|
p03471 | s593777922 | Wrong Answer | n, y = list(map(int, input().split()))
result = [-1, -1, -1]
for m_10000 in range(n + 1):
for m_5000 in range(n + 1 - m_10000, n + 1):
m_1000 = n - m_10000 - m_5000
k = 10000 * m_10000 + 5000 * m_5000 + 1000 * m_1000
if k == y:
result = [m_10000, m_5000, m_1000]
break
else:
continue
break
print("{} {} {}".format(result[0], result[1], result[2])) |
p03471 | s606524497 | Wrong Answer | N, Y = map(int, input().split())
for i in range(9):
a = Y - i*5000
b = N-i
if (b*10000 - a) % 9000 != 0:
continue
c = (b*10000 - a) // 9000
d = b-c
if N == c+d and Y == d*10000+i*5000+c*1000:
print(d, i, c)
break
else:
print(-1,-1,-1) |
p03471 | s000264659 | Wrong Answer | n, result = map(int, input().split())
for x in range(n + 1):
for y in range(n + 1):
for z in range(n + 1):
if x + y + z == 9:
if (10000 * x) + (5000 * y) + (1000 * z) == result:
print(x, y, z)
exit()
print("-1,-1,-1") |
p03471 | s055034690 | Wrong Answer | n, y = map(int, input().split())
flg = True
for i in range(n+1):
for j in range(n+1-i):
for k in range(n+1-(j+i)):
if (10000*k + 5000*j + 1000*i) == y:
print('{} {} {}'.format(i, j, k))
flg = False
break
if not flg:
break
if not flg:
break
if flg:
print('-1 -1 -1')
|
p03471 | s285359464 | Wrong Answer | N,Y=map(int,input().split())
x=-1
y=-1
z=-1
for a in range(N+1):
for b in range(N+1):
c=N-a-b
if Y==(10000*a+5000*b+1000*c):
x=a
y=b
z=c
print(x,y,z) |
p03471 | s476876077 | Wrong Answer | n, y = map(int, input().split())
man = y//10000
ans = 0
for i in range(man+1):
mansatsu = i*10000
for j in range(n-i+1):
temp = mansatsu + j*5000
if y - temp == 1000*(n-(i+j)):
print(i,j,n-(i+j))
ans = 1
break
if ans == 0:
print("-1 -1 -1") |
p03471 | s175711617 | Wrong Answer | n,y=input().split()
if int(y)%1000:print('-1 -1 -1')
else:print('0 0 %d'%(int(y)/1000)) |
p03471 | s829516242 | Wrong Answer |
import sys
def myAnswer(N:int,Y:int) -> None:
for i in range(N+1):
for j in range(N+1-i):
if(10000*i + 5000*j + 1000*(N-i+j)==Y):
print(i,j,(N-i+j))
sys.exit()
print(-1,-1,-1)
def modelAnswer():
return
def main():
N,Y = map(int,input().split())
myAnswer(N,Y)
if __name__ == '__main__':
main() |
p03471 | s665818446 | Wrong Answer | n,y = map(int, input().split())
a = -1
b = -1
c = -1
n1 = y // 10000
n2 = y // 5000
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 | s010871894 | Wrong Answer | n,y=map(int,input().split());print(*([(i,j,n-i-j)for i in range(n+1)for j in range(9)if 9*i+4*j+n==y/1e3]+[(-1,-1,-1)])[0]) |
p03471 | s049390830 | Wrong Answer | n,m = map(int,input().split())
total = 0
for a in range(n+1):
for b in range(n+1):
total=10000*a+5000*b+1000*(n-a-b)
if total == m:
print(a,b,n-a-b)
exit()
print(-1,-1,-1) |
p03471 | s570124998 | Wrong Answer | n, y = map(int,input().split())
a=-1
b=-1
c=-1
for i in range(n):
for j in range(n-i):
total = i*10000+j*5000+(n-i-j)*1000
if total==y:
a=i
b=j
c=n-i-j
print(a,b,c)
|
p03471 | s748327276 | Wrong Answer | n, y = map(int, input().split())
for nx in range(n+1):
for ny in range(n-nx+1):
if (1000 * nx + 5000 * ny + 1000 * (n - nx - ny) == y):
print(nx, ny, n - nx - ny)
exit()
print(-1, -1, -1)
|
p03471 | s913755241 | Wrong Answer | # ans
N, Y = map(int, input().split())
for a in range(N):
for b in range(N):
c = N - a - b
if 10000 * a + 5000 * b + 1000 * c == Y and a + b + c == N:
print(a,b,c)
exit()
print(-1,-1,-1) |
p03471 | s215595332 | Wrong Answer | n, y = map(int, (input().split()))
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:
print(i, j, k)
break
else:
print(-1, -1, -1) |
p03471 | s043312814 | Wrong Answer | s = input().split()
N = int(s[0])
Y = int(s[1])
for a in range(N + 1):
for b in range(N + 1):
for c in range(N - a - b + 1):
if a * 10000 + b * 5000 + c * 1000 == Y:
print(str(a) + " " + str(b) + " " + str(c))
exit(0)
print("-1 -1 -1")
|
p03471 | s553955686 | Wrong Answer | n,y = map(int,input().split())
ans = '-1 -1 -1'
for i in range(n+1):
for j in range(n+1-i):
#for k in range(n+1-i-j):
d = y - (i * 10000 + j * 5000)
if d >= 0 and d % 1000 == 0 and d//1000 < n + 1 - i - j:
ans = '{} {} {}'.format(i,j,d//1000)
break
print(ans) |
p03471 | s185405934 | Wrong Answer | n,y = map(int,input().split())
count = 0
for a in range(2001):
for b in range(2001):
c = n - a - b
if 10000*a + 5000*b + 1000*c == y and 0 <= c <= 2000:
print(str(a) + " " + str(b) + " " + str(c))
count += 1
break
if count == 1:
break |
p03471 | s720388411 | Wrong Answer | import sys
#N枚のお金N，合計金額Y
N, Y = map(int, input().split())
"""
a = 0 #1000円札の枚数
b = 0 #5000円札の枚数
c = 0 #10000円札の枚数
X = 0 #合計金額
"""
for a in range(N+1):
for b in range(N-a+1):
X = 1000*a + 5000*b + 10000*(N-a-b)
if X == Y:
print(a, b, N-a-b)
sys.exit()
print("-1 -1 -1") |
p03471 | s492974988 | Wrong Answer | N,X = map(int,input().split())
l = []
bo = 0
for a in range(N+1):
for b in range(N-a+1):
if a*10000 + b*5000 + (N-a-b)*1000 == X:
print(a,b,N-a-b)
bo+=1
break
break
if bo==0:
print('-1 -1 -1') |
p03471 | s480686320 | Wrong Answer | [N,Y] = list(map(int,input().split(' ')))
t = int(Y/1000 - N)
x = -1
y = -1
z = -1
for i in range(N):
if (int((t - 9*i)/4) == (t - 9*i)/4):
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 | s833676093 | Wrong Answer | n, result = map(int, input().split())
for x in range(n + 1):
for y in range(n - x + 1):
if x + y + (n - x - y) == 9:
if 10000 * x + 5000 * y + 1000 * (n - x - y) == result:
print(x, y, (n - x - y))
exit()
print("-1,-1,-1") |
p03471 | s315122417 | Wrong Answer | N,Y = map(int, input().split())
for x in range(1,N+1):
for y in range(1,N+1):
if 0 <= Y - x - y < Y:
print(x,y,Y-x-y)
exit()
print("-1 -1 -1") |
p03471 | s150236080 | Wrong Answer | N,Y = map(int,input().split())
for x in range(0,N+1):
for y in range(0,N+1-x):
z = N-x-y
if 10000*x + 5000*y + 1000*z == Y:
break
if 10000*x + 5000*y + 1000*z == Y:
break
else:
x=-1
y=-1
z=-1 |
p03471 | s488887092 | Wrong Answer | 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 and 1<=z<=2000:
print(i,j,z)
exit()
print(-1,-1,-1) |
p03471 | s027787761 | Wrong Answer | N, Y = map(int, input().split())
Y //= 1000
for y in range(9):
Y -= 5 * y
N -= y
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 | s323739763 | Wrong Answer | import sys
n,y = map(int,input().split())
for i in range(n):
for j in range(n-i):
for k in range(n-i-j):
if (10000*i+5000*j+1000*k == y):
print(i,j,k)
sys.exit()
print('-1 -1 -1')
|
p03471 | s269472983 | Wrong Answer | N, Y = map(int, input().split())
for x in range(N+1):
for y in range(N):
if 10000*x + 5000*y + 1000*(N-(x+y)) == Y and N-(x+y) >= 0:
print(x, y, N-(x+y))
exit()
print(-1,-1,-1) |
p03471 | s768144173 | Wrong Answer | n,y = map(int,input().split())
lst = []
ans = 0
for i in range(y//10000+1):
for j in range(y//5000+1):
k = (y - 10000*i - 5000*j)//1000
if k >= 0 and 0< i+j+k <= n:
lst.append([i,j,k])
ans += 1
if ans > 0:
print(*lst[0])
else:
print('-1 -1 -1') |
p03471 | s036350292 | Wrong Answer | n,y = [int(i) for i in input().split()]
#c3 = int(y%5000/1000)
#print(c3)
#y -= c3*1000
#n -= c3
for i in range(2001):
for j in range(2001):
if 10000*(i)+5000*(j)+1000*(n-i-j) == y:
print(i,j,n-i-j)
exit()
print(-1,-1,-1) |
p03471 | s244529651 | Wrong Answer | def resolve():
N, Y = map(int, input().split())
resx, resy, resz = (-1, -1, -1)
xn = Y//10000
for x in range(xn+1):
yn = (Y-10000*x)//5000
for y in range(yn+1-x):
z = N - x - y
total = 10000*x + 5000*y + 1000*z
if total == Y:
resx, resy, resz = (x, y, z)
break
print(resx, resy, resz)
resolve() |
p03471 | s002138241 | Wrong Answer | def solve(args):
n, y = args
#.
y = y // 1000
#.
for i in range(n+1):
for j in range(n+1):
#.
money = y - i*10 - j*50
#.
if money == n - i - j:
return "{} {} {}".format(i, j, money)
return "-1 -1 -1"
print(solve(map(int, input().split())))
|
p03471 | s082570077 | 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+1, 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) and (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 | s445977373 | Wrong Answer | def main():
N,Y = map(int,input().split())
# ListN = [N-i for i in range(N+1)]
for a in range(N+1):
for b in reversed(range(N+1-a)):
c,mody = divmod(10000*a+5000*b,1000)
if c <= N-a-b and mody == 0:
print(a,b,c)
exit()
print(-1,-1,-1)
if __name__ == '__main__':
main() |
p03471 | s543751906 | Wrong Answer | N,Y = map(int, input().split())
Y2 = Y//1000 - N
a = Y2 % 4
b = (Y2 - 9 * a) // 4
c = N - a - b
if c < 0: a+=(c//5)*-5; b-=(c//5)*-10; c+=(c//5)*-5
if b < 0:
a+=b; b=0
if 10*a+5*b+c != Y and a >= 0:
sub = 10*a+c - Y // 1000
a -= sub//5; b += sub // 5
if a < 0 or b < 0: a=-1; b=-1; c=-1
print(a, b, c) |
p03471 | s249130657 | 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:
X=[N-i-y, y, i]
X=list(map(int, X))
break
print(*X)
|
p03471 | s684860957 | Wrong Answer | N, Y = map(int, input().split())
for i in range(Y // 10000 + 1):
for j in range(Y - 10000 * i // 5000 + 1):
if 10000 * i + 5000 * j == Y - 1000 * (N - i - j):
print(i, j, N - i - j)
exit()
print(-1, -1, -1) |
p03471 | s528918294 | Wrong Answer | N, Y = map(int, input().split())
for x in range(N+1):
for y in range(N+1-x):
if x*10000 + y*5000 + (N-x-y)*1000 == Y:
print(x, y, N+1-x-y)
exit()
print(-1,-1,-1) |
p03471 | s614660264 | Wrong Answer | from itertools import product
N,Y=map(int, input().split())
def total_check(n, y):
for b in range(N+1):
for a in range(N+1):
if a + b > N:
break
c = N - a - b
t = 10000 * a + 5000 * b + 1000 * c
print(t)
if t==y:
return a, b, c
return -1,-1,-1
a,b,c=total_check(N,Y)
print(a,b,c) |
p03471 | s734566059 | Wrong Answer | n,Y=map(int,input().split())
cnt=0
for x in range(n+1):
for y in range(n+1):
z=n-x-y
if 10000*x+5000*y+1000*z==Y:
print('{} {} {}'.format(x,y,z))
cnt+=1
break
break
if cnt==0:
print('{} {} {}'.format(-1,-1,-1)) |
p03471 | s386790516 | Wrong Answer | N,Y = list(map(int,input().split()))
for i in range(0,N+1):
for j in range(0,N+1):
if i*10000+j*5000+(N-i-j)*1000 == Y:
print('{0} {1} {2}'.format(i,j,N-i-j))
exit()
print('-1 -1 -1') |
p03471 | s107643050 | Wrong Answer | n, y = map(int, input().split())
a={}
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
if j == True:
print(-1, -1, -1) |
p03471 | s360280137 | Wrong Answer | 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)
else:
print(-1,-1,-1)
|
p03471 | s872042461 | Wrong Answer | N,Y=map(int,input().split())
flag=0
for x in range(N+1):
if flag==1:
break
for y in range(N+1-x):
if flag==1:
break
for z in range(N+1-x-y):
money=10000*x+5000*y+1000*z
if money == Y:
print(x," ",y," ",z)
flag=1
break
if flag==0:
print("-1 -1 -1") |
p03471 | s197677277 | Wrong Answer | n, y = map(int, input().split())
for i in range(n+1):
for j in range(i, n+1):
res = y - (10000*i + 5000*j)
if res == 1000*(n - i - j):
print(i, j, n-i-j)
exit()
print('-1 -1 -1') |
p03471 | s477307375 | Wrong Answer | N,Y = map(int,input().split())
a = Y // 10000; b = Y // 5000; c = 0
for i in range(a+1):
for j in range(b+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()
if c.is_integer==False:
print(-1,-1,-1) |
p03471 | s819113915 | 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 (k *10000 + j * 5000 + i* 1000) == y:
list = [i,j,k]
break
if (k *10000 + j * 5000 + i* 1000) == y:
break
if (k *10000 + j * 5000 + i* 1000) == y:
break
print(list[2],list[1],list[0]) |
p03471 | s038579526 | Wrong Answer | def main():
N,Y = map(int,input().split())
# ListN = [N-i for i in range(N+1)]
for a in range(N+1):
for b in range(N+1-a):
c,mody = divmod(Y-10000*a-5000*b,1000)
if c <= N-a-b and mody == 0:
print(a,b,c)
exit()
print(-1,-1,-1)
if __name__ == '__main__':
main() |
p03471 | s764900751 | Wrong Answer | a,b=map(int,input().split())
ans=[]
for i in range(a+1):
for j in range(a+1):
k=(b-(i*10000+j*5000))//1000
if 0<=i+j+k<=a and k>=0:
ans.append([i,j,k])
break
if ans==[]:
print(-1,-1,-1)
else:
print(ans[0][0],ans[0][1],ans[0][2]) |
p03471 | s152636415 | Wrong Answer | n, y = map(int, input().split())
ans = 0
for x in range(n+1):
for p in range(n+1):
z = n - x - p
if z >= 0:
if y-10000*x-5000*p == 1000*z and x+p+z == y:
print(x, p, z)
ans += 1
break
if ans == 0:
print(-1, -1, -1) |
p03471 | s438996739 | Wrong Answer | n, y = map(int, input().split())
for i in range(n):
for j in range(n-i):
if 1000*i + 5000*j + 10000*(n-i-j) == y:
print(n-i-j, j, i)
exit()
print(-1, -1, -1)
|
p03471 | s842758810 | Wrong Answer | 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 | s849605035 | Wrong Answer | 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 10000*i + 5000*j + 1000*k == Y:
break
print(i, j, k) |
p03471 | s755522348 | Wrong Answer | N, Y = map(int, input().split())
for i in range(N):
if 10000 * i > Y:
continue
for j in range(N - i):
k = N - i - j
if 10000 * i + 5000 * j + 1000 * k == Y:
print(i, j, k)
exit()
else:
print(-1, -1, -1)
|
p03471 | s727890173 | Wrong Answer | import sys
input = sys.stdin.readline
N, Y = map(int, input().strip("\n").split())
for x in range(N):
for y in range(N - x):
remainder = Y - 10000 * x - 5000 * y
if (N - x - y) * 1000 == remainder:
print(" ".join([str(x), str(y), str(N - x - y)]))
exit(0)
print("-1 -1 -1") |
p03471 | s521691987 | Wrong Answer | N, Y = map(int, input().split())
a = 0
for i in range(N):
for ii in range(N):
for iii in range(N):
ans = 10000 * i + 5000 * ii + 1000 * iii
J = i + ii + iii
if ans == Y and J == N:
print(i,ii,iii)
a += 1
break
if a != 0:
break
if a != 0:
break
if a == 0:
print(-1,-1,-1)
|
p03471 | s631492787 | Wrong Answer | n,y = map(int, input().split())
a = []
for i in range(0,n,1):
for j in range(0,n,1):
if 9000*i+4000*j == y-1000*n and n-i-j >= 0:
a = [i,j,n-i-j]
if a == []:
print(-1,-1,-1)
else:
print(a[0],a[1],a[2])
|
p03471 | s406673026 | Wrong Answer | N,Y = map(int, input().split())
for x in range(N+1):
y = ((Y-10000*x)-1000*(N-x))/5000
z = N-y-x
if 0<=y and 0<=z and 10000*x+5000*y+1000*z==Y:
print (int(x),int(y),int(z))
break
else:
print("-1 -1 -1") |
p03471 | s814756182 | Wrong Answer | n,y = map(int,input().split())
ans = (-1,-1,-1)
for i in range(n+1):
for j in range(n+1-i):
if y == 1000*(i + j * 5 + (n+1-i-j) * 10 ):
print(i, j, n+1-i-j)
exit()
print(-1,-1,-1) |
p03471 | s142606770 | Wrong Answer | n,y = map(int,input().split())
ans = (-1,-1,-1)
for i in range(n+1):
for j in range(n+1-i):
if y == 1000*(i + j * 5 + (n-i-j) * 10 ):
print( n+1-i-j, j, i ) # 逆だった。出力は10000から出す
exit(0)
print(-1,-1,-1) |
p03471 | s537884939 | Wrong Answer | N, Y = list(map(int, input().split()))
results = [-1, -1, -1]
for x in range(N + 1):
for y in range(N - x + 1):
if Y == 10000 * x + 5000 * y + 1000 * (N - x - y):
results = [x, y, (N - x - y)]
print(results) |
p03471 | s793128497 | Wrong Answer | a,b=input().split()
a=int(a)
b=int(b)
c=0
for i in range(int(b/10000)+1):
for k in range(int(b/5000)+1):
if i*10000+k*5000+(a-i-k)*1000==b and (a-i-k)>=0:
c=c+1
break
if c==0:
print(-1,-1,-1)
else:
print(i,k,a-i-k) |
p03471 | s556534631 | Wrong Answer | N,Y = map(int,input().split())
flag = 0
for i in range(N+1):
for j in range(N-i+1):
for k in range(N-i-j+1):
dama = 10000*i + 5000*j + 1000*k
if dama == Y:
print(str(i)+" "+str(j)+" "+str(k))
flag = 1
break
else:
continue
break
else:
continue
break
if flag == 0:
print("-1 -1 -1") |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.