s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s205484690 | p03471 | u412255932 | 1565619542 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 253 | N, Y = map(int, input().aplit())
boolean = False
for i in range(N+1):
for j in range(N+1-i):
if (Y - 10000 * i + 5000 * j) // 1000 == (N - i - j):
boolean = True
if boolean:
print(i, j, N - i - j)
else:
print(-1, -1, -1) |
s408733936 | p03471 | u412255932 | 1565619441 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 242 | N, Y = map(int, input().aplit())
boolean = False
for i in range(N+1):
for j in range(N+1-i):
if (Y - 10000 * i + 5000 * j) % 1000 == N:
boolean = True
if boolean:
print(i, j, N - i - j)
else:
print(-1, -1, -1) |
s158930589 | p03471 | u652057333 | 1565570486 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38484 | 248 | n, y = map(int, input().split())
ans = "-1 -1 -1"
for i in range(n+1):
for j in range(n+1):
if i + j > n:
break
k = n - i - j
if 10000*i + 5000*j + 1000*k == y:
ans = f"{i} {j} {k}"
print(ans)
|
s447600406 | p03471 | u075628913 | 1565567026 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 346 | N, Y = map(int, input().split())
out_x = out_y = out_z = -1
for x in range(N+1):
for y in range(N+1):
price = x * 10000 + y * 5000
if price > Y:
break
price = price + (N-x-y) * 1000
if price == Y:
out_x = x
out_y = y
out_z = N-x-y
break
if out_x != -1:
break
print(f... |
s581165850 | p03471 | u953868469 | 1565559306 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 282 | n,y = map(int,input().split())
import sys
flag = False
for i in range(n):
for j in range(n-j):
k = n - i - j
if 10000 * i + 5000 * j + 1000 * k == y:
flag = True
print(i,j,k)
sys.exit()
if flag == False:
print(-1, -1, -1) |
s059570120 | p03471 | u716043626 | 1565539180 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 229 | n,y = map(int,input().split())
for i in range(n+1):
for j in range(n+1-i):
j = n - i - j
if (10000*i + 5000*j + 1000*c == y) and (i + j + c == n):
print(i,j,k)
exit()
print('-1 -1 -1') |
s794967226 | p03471 | u407016024 | 1565537214 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 313 | N, Y = map(int, input().split())
yukichi = -1
ichiyo = -1
hideyo = -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:
yukichi = a
ichiyo = b
hideyo = c
print(f'{yukichi} {ichiyo} {hideyo}') |
s713442361 | p03471 | u407016024 | 1565537025 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 324 | N, Y = map(int, input().split())
yukichi = -1
ichiyo = -1
hideyo = -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 and c >= 0:
yukichi = a
ichiyo = b
hideyo = c
print(f'{yukichi} {ichiyo} {hidey... |
s966899522 | p03471 | u407016024 | 1565536877 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 322 | N, Y = map(int, input().split())
yukichi = -1
ichiyo = -1
hideyo = -1
for a in range(N+1):
for b in range(N+1):
c = N - a - b
total = 10000*a + 5000*b + 1000*c
if total == Y and c >= 0:
yukichi = a
ichiyo = b
hideyo = c
print(f'{yukichi} {ichiyo} {hideyo}... |
s499347746 | p03471 | u407016024 | 1565536682 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 322 | N, Y = map(int, input().split())
yukichi = -1
ichiyo = -1
hideyo = -1
for a in range(N+1):
for b in range(N+1):
c = N - a - b
total = 10000*a + 5000*b + 1000*c
if total == Y and c >= 0:
yukichi = a
ichiyo = b
hideyo = c
print(f'{yukichi} {ichiyo} {hideyo}... |
s669289498 | p03471 | u759726213 | 1565459950 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 252 | n, y = map(int, input().split())
# n, y = 1000, 1234000
flg = False
for i in range(y//10000 + 1):
for j in range(n-i+1):
k = n - i - j
if i*10000+j*5000+k*1000 == y:
print(i, j, k)
return
print('-1 -1 -1')
|
s000092204 | p03471 | u759726213 | 1565459577 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 314 | n, y = map(int, input().split())
# n, y = 1000, 1234000
flg = False
for i in range(y//10000 + 1):
if flg:
break
for j in range(n-i):
k = n - i - j
if i*10000+j*5000+k*1000 == y:
flg = True
break
if flg:
print(f'{i} {j} {k}')
else:
print('-1 -1 -1') |
s377390031 | p03471 | u759726213 | 1565458391 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 417 | n, y = map(int, input().split())
# n, y = 1000, 1234000
flg = False
for i in range(y//10000 + 1):
diff_1 = y - i*10000
for j in range(diff//5000 + 1):
diff_2 = diff_1 - j*5000
for k in range(diff//1000 + 1):
diff_3 = diff_2 - k*1000
if diff_3 == 0 and i+j+k <= n:
... |
s013038863 | p03471 | u482019060 | 1565159986 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 600 | input_data = input()
N, Y = map(int, input_data.split())
result = False
count_10000 = 0
count_5000 = 0
count_1000 = 0
for count_10000 in range(0, N + 1):
for count_5000 in range(0, N + 1 - count_10000):
count_1000 = N - count_10000 - count_5000
total = count_10000 * 10000 + count_5000 * 5000 + coun... |
s229959413 | p03471 | u482019060 | 1565159409 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 643 | input_data = input()
N, Y = map(int, input_data.split())
result = False
count_10000 = 0
count_5000 = 0
count_1000 = 0
for count_10000 in range(0, N+1):
for count_5000 in range(0, N+1):
for count_1000 in range(0, N+1):
total = count_10000 * 10000 + count_5000 * 5000 + count_1000 * 1000
... |
s201287927 | p03471 | u482019060 | 1565159232 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 619 | N, Y = map(int, input().split())
result = False
count_10000 = 0
count_5000 = 0
count_1000 = 0
for count_10000 in range(0, N+1):
for count_5000 in range(0, N+1):
for count_1000 in range(0, N+1):
total = count_10000 * 10000 + count_5000 * 5000 + count_1000 * 1000
count = count_10000 +... |
s729842956 | p03471 | u482019060 | 1565159107 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 717 | N, Y = map(int, input().split())
result = False
count_10000 = 0
count_5000 = 0
count_1000 = 0
for count_10000 in range(0, N+1):
if count_10000 * 10000 > Y:
break
for count_5000 in range(0, N+1):
if count_5000 * 5000 > Y:
break
for count_1000 in range(0, N+1):
tot... |
s579635984 | p03471 | u850200768 | 1565076018 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 346 | %%time
N, Y = map(int,input().split())
ans = (-1, -1, -1)
for x in range(N+1):
y_max = N - x
if ans == (-1, -1, -1) and 0 <= Y - 10000*x <= 5000*y_max:
for y in range(N+1):
z = N - x - y
if 10000*x + 5000*y + 1000*z == Y:
ans = (x, y, z)
break
pri... |
s864269763 | p03471 | u027165539 | 1564756584 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 233 | N, Y = map(int, input().split())
flag = 0
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:
flag = 1
print(f'{x} {y} {z}')
if flag == 0:
print('-1 -1 -1') |
s383899477 | p03471 | u347750049 | 1564719342 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 192 | n, y = map(int, input().split(' '))
yy = y // 1000
d = yy - n
a = (4 * d - n - 3 * yy) / 5
b = (8 * yy - 9 * d + n) / 5
if a>= 0 and b >= 0 and c >= 0:
print(a, b, c)
else:
print('-1 -1 -1') |
s731712208 | p03471 | u347750049 | 1564719263 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 191 | n, y = map(int, input().split(' '))
yy = y / 1000
d = yy - n
a = (4 * d - n - 3 * yy) / 5
b = (8 * yy - 9 * d + n) / 5
if a>= 0 and b >= 0 and c >= 0:
print(a, b, c)
else:
print('-1 -1 -1') |
s100630511 | p03471 | u944460773 | 1564706651 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 358 | # coding:utf-8
n, y = [int(x) for x in input().split(' ')]
sen = y//1000
target = sen - n
if target < 0:
print('-1 -1 -1')
else:
if target % 9 % 4:
print('-1 -1 -1')
else:
iti_man = target // 9
go_sen = target % 9 // 4
sen = sen - iti_man*10 - go_sen*5
print('{} {} {}'.... |
s033892996 | p03471 | u944460773 | 1564706078 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 480 | # coding:utf-8
n, y = [int(x) for x in input().split(' ')]
# 1000円札なら何枚か
sen = y//1000
# 減らさなきゃいけない枚数
# 1万円札なら9枚，5千円札なら4枚減る
target = sen - n
if target < 0:
print('-1 -1 -1')
else:
iti_man = target // 9
go_sen = target % 9 // 4
if target % 9 % 4:
print('-1 -1 -1')
else:
sen = sen... |
s585859246 | p03471 | u944460773 | 1564705963 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 480 | # coding:utf-8
n, y = [int(x) for x in input().split(' ')]
# 1000円札なら何枚か
sen = y//1000
# 減らさなきゃいけない枚数
# 1万円札なら9枚，5千円札なら4枚減る
target = sen - n
if target < 0:
print('-1 -1 -1')
else:
iti_man = target // 9
go_sen = target % 9 // 4
if target % 9 % 4:
print('-1 -1 -1')
else:
sen = sen... |
s737492211 | p03471 | u676059589 | 1563980273 | Python | PyPy3 (2.4.0) | py | Runtime Error | 189 | 38384 | 494 | import copy
import sys
import math
def main():
n,y = map(int,input().split())
for i in range(n+1):
for j in range(n-i+1):
k = n-i-j
if(y == i*10000 + j*5000 + k*1000):
print(f'{i} {j} {k}')
sys.exit()
print('-1 -1 -1')
def listtodict(a):
b = {}
for i in a:
try:
b[i] += 1
except:
b[i] =... |
s700464513 | p03471 | u676059589 | 1563980164 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38256 | 487 | import copy
import sys
import math
def main():
n,y = map(int,input().split())
for i in range(n+1):
for j in range(n-i+1):
k = n-i-j
if(y == i*10000 + j*5000 + k*1000): print(f'{i} {j} {k}');sys.exit()
print('-1 -1 -1')
def listtodict(a):
b = {}
for i in a:
try:
b[i] += 1
except:
b[i] = 1
ret... |
s647880883 | p03471 | u138816476 | 1563926113 | Python | Python (3.4.3) | py | Runtime Error | 1410 | 3060 | 250 | 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 and (i + j + k == n) and (i*10000 + j*5000 + k*1000 == y):
print(i, j, k)
exit(1)
print(-1, -1, -1) |
s896326079 | p03471 | u668503853 | 1563146738 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 212 | N,Y=map(int,input().split())
answer=[-1, -1, -1]
for i in range(N+1):
for j in range(N-i+1):
k= N-i-j
a=10000*i+5000*j+1000*k
if Y==a:
answer=[i,j,k]
break
print(*answer) |
s485947163 | p03471 | u829393411 | 1563065752 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 374 | n,y=map(int,input().split())
y=y/1000
count=0
for i in range(y/10):
for j in range(int(y-10*i)):
for k in range(int(y-10*i-5*j)):
if i+5*j+10*k==y:
print(str(k)+" "+str(j)+" "+str(i))
count=1
break
if count==1:
break
if coun... |
s554551065 | p03471 | u170077602 | 1562111714 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 283 | ow = list(map(int, input().split()))
N = row[0]
Y = row[1]
order = []
order.append(int(Y/1e+4))
Y -= int(Y/1e+4) * 1e+4
order.append(int(Y/5e+3))
Y -= int(Y/5e+3) * 5e+3
order.append(int(Y/1e+3))
if sum(order) > N:
print("-1 -1 -1")
else:
print(order[0], order[1], order[2]) |
s752700481 | p03471 | u450904670 | 1561867128 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 196 | N, Y = map(int, input().split())
if(Y > 10000 * N):
print(-1, -1, -1)
exit()
for a in N:
for b in (N - a):
if(Y == (10000 * a + 5000 * b + 1000 * (N - a - b))):
print(a, b, N - a - b)
|
s966861182 | p03471 | u306060982 | 1561665272 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 8070 | Last login: Tue Jun 25 10:46:38 on ttys001
okazaki@shinji-2(15:41:18) ~
% pip install sklearn-pandas [~]
Collecting sklearn-pandas
Downloading https://files.pythonhosted.org/packages/1f/48/4e1461d828baf41d609efaa720d20090ac6ec346b5daad3c88e243e2207e/sklearn_pandas-1.8.0... |
s451458711 | p03471 | u329058683 | 1561119289 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38384 | 356 | import numpy as np
N,T=map(int,input().split())
D=[ [x,y,z,x+y+z,10000*x+5000*y+1000*z] for x in range(N+1) for y in range(N+1)for z in range(N+1)]
D=np.array(D)
index = np.where(D[:, -1] == T)
DD=D[index]
ans = np.where(DD[:, -2] == N)
if len(DD[ans])==0:
print("-1 -1 -1")
else:
print(str(DD[ans][0][0])+" "+str(DD... |
s604615051 | p03471 | u813569174 | 1560905316 | Python | Python (3.4.3) | py | Runtime Error | 785 | 3064 | 298 | m = input().split()
N = int(m[0])
Y = int(m[1])
if Y > 10000*N:
print(-1,-1,-1)
else:
frag = 1
for i in range(N+1):
for j in range(N-i+1):
if frag == 1 and 10000*i + 5000*j + 1000*(N-i-j) == Y:
frag == 0
print(i,j,k)
break
if frag == 1:
print(-1,-1,-1) |
s620156720 | p03471 | u813569174 | 1560902786 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 299 | m = input().split()
N = int(m[0])
Y = int(m[1])
if Y > 10000*N:
print(-1,-1,-1)
else:
frag == 1
for i in range(N+1):
for j in range(N-i+1):
if frag == 1 and 10000*i + 5000*j + 1000*(N-i-j) == Y:
frag == 0
print(i,j,k)
break
if frag == 1:
print(-1,-1,-1) |
s338280379 | p03471 | u813102292 | 1560880035 | Python | PyPy3 (2.4.0) | py | Runtime Error | 182 | 38512 | 349 | N, Y = map(int, input().split())
Payable = False
try:
for i in range(N+1):
for j in range(N+1-i):
k = N-i-j
if i*10000+j*5000+k*1000 == Y:
print(i,j,k)
Payable = True
raise Exception
except Exception:
break
if not Payable:
prin... |
s630871553 | p03471 | u765815947 | 1559919458 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 233 | n, Y = map(int, input().split())
for i in range(0,n+1):
x = i
for j in range(0, n-i+1):
y = j
z = n - i - j
w = 10000*x + 5000*y + 1000*z
if w == Y:
print(x y z)
break
print('-1 -1 -1')
|
s085318735 | p03471 | u617225232 | 1559700371 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 287 | a,b =map(int,input().split())
for i in range(b//(10000*a))[::-1]:
for j in range((b-10000*i)//(5000*(a-i))[::-1]:
for k in range((b-10000*i-5000*j)//(1000*(a-i-j)))[::-1]:
if b == i*10000+j*5000+k*1000:
break
if i==j==k==0:
print(-1,-1,-1)
else:
print(i,j,k)
|
s152009381 | p03471 | u016128476 | 1559624556 | Python | Python (3.4.3) | py | Runtime Error | 891 | 3060 | 360 | N, Y = map(int, input().split())
v = 0
def solve():
for x in range(N+1):
if Y // 10000 < x:
return [-1,-1,-1]
r = Y - 10000 * x
for y in range(0, r // 5000 + 1):
rr = r - 5000 * y
z = rr // 1000
if x + y + z == N:
return [x, y,... |
s162613530 | p03471 | u499702575 | 1559617386 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 1193 | N,Y=map(int,input().split())
ichiman=0
gosen=0
sen=0
se_ichi=0
go_ichi=0
sen_go_ichi=0
mismatch=0
max_ichiman=int(2*(10**7)/(10**4))
for i in range(max_ichiman+1):
if i*10**4==Y:
ichiman=i
break
if i*10**4>Y:
ichiman=i-1
break
Y=Y-ichiman*10**4
for j in range(2):
if j*5*10**3... |
s456633817 | p03471 | u087731474 | 1559416519 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 676 | def otoshi(n, y):
x=0
for i in range(n+1):
x = i*1000
if x >= y :
break
for i2 in range(n+1 - i):
x = i*1000 + i2 * 5000
if x >= y :
break
for i3 in range(n+1 - (i+i2)):
x = i*1000 + i2 * 5000 + i3 *10000
... |
s557414505 | p03471 | u595948034 | 1559169613 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 218 | N = int(input())
Y = int(input())
for i in range(N+1):
for j in range(N+1):
if ((N-i-j) >= 0 and i*10000 + j*5000 + (N-(i+j))*1000 == Y):
print(i, j, N-i-j)
exit()
print(-1, -1, -1)
|
s097920375 | p03471 | u467826805 | 1559009123 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 241 | n,y = map(int,input().split())
fl = 0
for i in range(n+1):
for j in range(n+1):
if n-i-j>=0 && 10000*(n-i-j)+5000*j+1000*i == y:
print("{0}{1}{2}".format(n-i-j,j,i))
fl = 1
break
break
if(fl==0):
print("-1 -1 -1") |
s364376773 | p03471 | u912625807 | 1558572186 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 386 | N, Y = [int(i) for input().split()]
ans = None
for i in range(N+1):
for j in range(i+1):
y = (N-i)*10000 + (i-j)*5000 + j*1000
if y == Y:
ans=(i, j)
break
if y == Y:
break
if ans:
answer = ' '.join(
[str(N-ans[0]), str(ans[0]-ans[1]),
... |
s980542060 | p03471 | u250664216 | 1558462957 | Python | Python (3.4.3) | py | Runtime Error | 2103 | 3984 | 607 | n, y = map(int, input().split())
def check(n,y):
if n == 0 and y == 0:
return {"truth":True, "a":0, "b":0, "c":0}
elif n == 0 or y == 0:
return {"truth":False, "a":-1, "b":-1, "c":-1}
checkA = check(n-1, y-10000)
checkB = check(n-1, y-5000)
checkC = check(n-1, y-1000)
if checkA... |
s939223713 | p03471 | u473633103 | 1558395684 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 378 | a,b = map(int,input().split())
t = b//1000
f = False
for i in range(t//10+1):
for j in range((t-i*10)//5+1):
if a == t - i*9 - j*4 and t == i*10+j*5+(a-i-j) and a-i-j>=0:
f = True
break
if f:
break
if f:
... |
s252282158 | p03471 | u473633103 | 1558395645 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 379 | a,b = map(int,input().split())
t = b//1000
f = False
for i in range(t//10+1):
for j in range((t-i*10)//5+1):
if a == t - i*9 - j*4 and t == i*10+j*5+(a-i-j)A and a-i-j>=0:
f = True
break
if f:
break
if f:... |
s438069115 | p03471 | u473633103 | 1558395467 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 372 | a,b = map(int,input().split())
t = b
f = False
for i in range(t//10+1):
for j in range((t-i*10)//5+1):
if a == t - i*9 - j*4 and b == i*10+j*5+(a-i-j) and a-i-j>=0:
f = True
break
if f:
break
if f:
... |
s880677348 | p03471 | u597374218 | 1558305381 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3056 | 135 | a,b,c,x=[int(input()) for i in range(4)]
print([500*x+100*y+50*z for z in range(c+1) for y in range(b+1) for x in range(a+1)].count(x)) |
s896948303 | p03471 | u450904670 | 1558241225 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 2940 | 328 | in_n, in_cond = map(int, input().split())
def hoge(n, cond):
for i in range(n+1):
for j in range(n+1):
for k in range(n+1):
if((i + j + k == n) & (10000 * i + 5000 * j + 1000 * k == cond)):
return [i, j, k]
return [-1 -1 -1]
print(" ".join(hoge(in_n, in_co... |
s055553663 | p03471 | u143492911 | 1558149413 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 452 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,y;
cin>>n>>y;
for(int i=0;i<=n;i++){
for(int j=0;j<=n;j++){
int z=y-(10000*i+5000*j);
if(z%1000==0){
z/=1000;
if(0<=z && i+j+z==n){
cout<<i<<" "<<j<<" "<<z<<endl... |
s313814893 | p03471 | u054559808 | 1558146221 | Python | PyPy3 (2.4.0) | py | Runtime Error | 191 | 39152 | 229 | n, y = map(int, input().split())
ans = [-1, -1, -1]
for i in range(n+1):
for j in range(n+1-x):
k = n-i-j
if i*10000+j*5000+k*1000 == y and k>=0:
ans[0] = i
ans[1] = j
ans[2] = k
break
print(ans) |
s509363474 | p03471 | u360258922 | 1557950822 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 392 | s_n = [0, 0, 0]
s_l = [10000, 5000, 1000]
error = '-1 -1 -1'
for i, s in enumerate(s_l):
if n > -1:
s_n[i] = int(y/s)
n = n - s_n[i]
y = y - s * s_n[i]
else:
ans = error
if n > -1:
if y == 0:
ans = ' '.join(map(str, s_n))
elif list(set(s_n)) == [0]:
ans... |
s717866338 | p03471 | u298297089 | 1557950313 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 236 | N, X = map(int, input().split()))
for i in range(min(N, X // 10*4) + 1):
for j in range(min(N-i, (X-10*4*i) // 5000) + 1):
if (X - 10*4*i - 5000*j) // 1000 == N - i - j:
print(i,j,N-i-j)
break
else:
print(-1,-1,-1)
|
s860201895 | p03471 | u796789068 | 1557890048 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 201 | N,Y=map(int,input().split())
for i in range(N):
for j in range(N):
if 10000i+5000j+1000(N-(i+j))==Y:
print(j+" "+k+" "+N-(i+j))
else:
print(-1+" "+-1+" "+-1) |
s086371565 | p03471 | u643912307 | 1557859429 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 292 | #お札が合計N枚ある時に合計金額がY円になる枚数の組み合わせ 存在しない場合は（-1,-1,-1）
n=int(input())
y=int(input())
a,b,c=-1,-1,-1
for i in range(n):
for j in range(n-i):
if 10000*i + 5000*j + 1000*(n-i-j) ==y:
a,b,c=i,j,(n-i-j)
print(a,b,c) |
s880873731 | p03471 | u500944229 | 1557529349 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 340 | n,y = map(int,input().split())
okane10000 = [i for i in range(n+1)]
okane5000 = [i for i in range(n+1)]
okane1000 = [i for i in range(n+1)]
for a in okane10000:
for b in okane5000:
for c in okane1000:
if a+b+c==n:
if a*10000+b*5000+c*1000 == y:
print(a, ,b, ,c)
else:
... |
s663350072 | p03471 | u500944229 | 1557529101 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 331 | ,y = map(int,input().split())
okane10000 = [i for i in range(n+1)]
okane5000 = [i for i in range(n+1)]
okane1000 = [i for i in range(n+1)]
for a in okane10000:
for b in okane5000:
for c in okane1000:
if a+b+c==n:
if a*10000+b*5000+c*1000 == y:
print(a,b,c)
else:
prin... |
s455554455 | p03471 | u233437481 | 1557525986 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 363 | h = [int(s) for s in input().split()]
N = h[0]
Y = h[1]
def otoshidama(a,b):
ok_flag = 0
money = 0
for i in range(N+1):
for j in range(N+1-i):
money = 10000*i + 5000*j + 1000*(N-i-j)
if money == Y:
print(i,j,N-i-j)
ok_flag = 1
return
money = 0
if ok_flag =... |
s864440832 | p03471 | u047393579 | 1557524306 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 260 | N, Y = map(int, input().split())
count = 0
for b in range(N+1):
for a in range(0, b):
total = 1000a + 5000(b-a) + 10000(N-b)
if total == Y:
print(a,b-a,N-b)
break
count += 1
if count == N+1:
print('-1 -1 -1') |
s367576196 | p03471 | u310549140 | 1557515748 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 224 | N,Y = int(input().split())
for x in range(1,N+1):
for y in range(1,N-x+1):
for z in range(1,N-x-y+1):
if 10000*x+5000*y+1000*z==Y:
print(x,y,z)
exit()
print("-1 -1 -1") |
s505191240 | p03471 | u802963389 | 1557497271 | Python | Python (3.4.3) | py | Runtime Error | 1140 | 3060 | 301 | N, Y = map(int, input().split())
flg = -1
for i in range(N+1):
for j in range(N+1):
goke = 9000*i + 4000*j
if (goke == Y - 1000*N) and (A + B <= N):
A = i
B = j
flg = 1
break
if flg == 1:
C = N - A -B
print('{} {} {}'.format(A, B, C))
else:
print('-1 -1 -1')
|
s311844180 | p03471 | u235905557 | 1557491762 | Python | Python (3.4.3) | py | Runtime Error | 1116 | 3188 | 285 | import sys
N, Y = map(int, input().split())
for a in range(N+1):
for b in range(N+1):
c = N - a - b
if c < 0:
continue
if (10000*a + 5000*b + 1000*c) == Y:
print(str(a)+" "+str(b)+" "+sstr(c))
sys.exit()
print("-1 -1 -1") |
s967043695 | p03471 | u235905557 | 1557491696 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 283 | import sys
N, Y = map(int, input().split())
for a in range(N+1):
for b in range(N+1):
c = N - a - c
if c < 0:
continue
if 10000*a + 5000*b + 1000*c == Y:
print(str(a)+" "+str(b)+" "+sstr(c))
sys.exit()
print("-1 -1 -1") |
s447561406 | p03471 | u386819480 | 1557450633 | Python | Python (3.4.3) | py | Runtime Error | 498 | 3064 | 752 | #!/usr/bin/env python3
import sys
def solve(N: int, Y: int):
for i in range(2000+1):
for j in range((2000+1)-i):
k = Y-10000*i-5000*j
if(k//1000 == N-i-j):
print(i,j,k//1000)
sys.exit()
prnt(-1,-1,-1)
return
# Generated by 1.1.4 https://gi... |
s392459757 | p03471 | u386819480 | 1557450530 | Python | Python (3.4.3) | py | Runtime Error | 492 | 3064 | 746 | #!/usr/bin/env python3
import sys
def solve(N: int, Y: int):
for i in range(2000+1):
for j in range((2000+1)-i):
k = Y-10000*i-5000*j
if(k//1000 == N-i-j):
print(i,j,k)
sys.exit()
prnt(-1,-1,-1)
return
# Generated by 1.1.4 https://github.c... |
s989486774 | p03471 | u166621202 | 1556993254 | Python | Python (3.4.3) | py | Runtime Error | 1589 | 2940 | 231 | N,Y = map(int,input().split())
ans = "-1 -1 -1"
for i in range(1,N+1):
for j in range(1,N+1):
k = N-i-j
if i*10000 + j*5000 + k*1000 == Y:
ans=(i + " " + j + " " + k)
break
else:
continue
print(ans)
|
s499116677 | p03471 | u166621202 | 1556993087 | Python | Python (3.4.3) | py | Runtime Error | 1595 | 2940 | 198 | N,Y = map(int,input().split())
ans = "-1 -1 -1"
for i in range(N):
for j in range(N):
k = N-i-j
if i*10000 + j*5000 + k*1000 == Y:
ans=(i + " " + j + " " + k)
break
print(ans)
|
s168610579 | p03471 | u166621202 | 1556992717 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3060 | 211 | N,Y = map(int,input().split())
for i in range(N):
for j in range(N):
for k in range(N):
if i*10000 + j*5000 + k*1000 == Y:
print(i + " " + j + " " + k)
break
else:
print("-1 -1 -1") |
s382110997 | p03471 | u531674264 | 1556930377 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 2940 | 238 | n, y = list(map(int, input().split()))
for a in range(n):
for b in range(n):
for c in range(n):
q = a*10000 + b*5000 + c*1000
if q == y:
answer = [a, b, c]
print(answer) |
s064109856 | p03471 | u062306892 | 1556738693 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 210 | n, y = list(map(int, input().split()))
for i in y:
for j in y:
for k in y:
if i / 10000 + j / 5000 + k / 1000 == 0 and i + j + k == n:
print(i, j , k)
else:
print(-1, -1, -1) |
s131258808 | p03471 | u172035535 | 1556734252 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 338 | flag = 0
for a in range(0,N+1):
if flag == 1:break
for b in range(0,N+1):
if flag == 1:break
for c in range(0,N+1):
if flag == 1:break
if a+b+c == N and a*10000+b*5000+c*1000 == Y:
print(a,b,c)
flag = 1
break
if flag == 0:
... |
s873569832 | p03471 | u320098990 | 1556555507 | Python | Python (3.4.3) | py | Runtime Error | 899 | 3064 | 543 | in_list = input().split()
N = int(in_list[0])
Y = int(in_list[1])
count = 0
ans_list = []
sum = 0
for i in range(N+1):
for j in range(N+1-i):
k = N-i-j
sum = i*10000 + j*5000 + k*1000
if sum==Y:
count += 1
ans_list.append(i)
... |
s070739222 | p03471 | u383551754 | 1556261287 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 348 | n, y = map(int, input().split())
ichi = y // 10000
for i in reversed(range(ichi + 1)):
gos = (y - 10000 * ichi) // 5000
for j in reversed(range(gos+1)):
rest = y - 10000 * i - 5000 * j
k = n - i - j
if rest % 1000 == 0 and rest // 1000 = k:
print(i, j, k)
exit()
... |
s007082679 | p03471 | u218724761 | 1555883407 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 217 | n, y = map(int, input().split())
for i in range(n + 1):
for j in range(n - i - j):
if i * 10000 + j * 5000 + (n - i - j) * 1000 == y:
print(i, j, n - i - j)
exit()
print("-1 -1 -1") |
s509000265 | p03471 | u218724761 | 1555874416 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 216 | 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") |
s646351666 | p03471 | u979362546 | 1555861607 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 191 | n, y = map(int, input().split())
for i in range(0, n+1):
for j in range(0, n+1-i):
if 10000*i+5000*j+1000*(n-i-j) == y:
print(i, j, n-i-j)
else:
print(-1, -1, -1) |
s167879053 | p03471 | u449473917 | 1555661819 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 246 | a,b=map(int, input().split())
ans=0
f=b//10000
for i in range(f+1):
for j in range(a-i+1):
if 10000*i+5000*j+1000*(a-i-j)==b and ans==0:
z=a-i-j
print(i,j,z)
ans+=1
if ans==0:
print(f'-1 -1 -1') |
s260726323 | p03471 | u449473917 | 1555661642 | Python | Python (3.4.3) | py | Runtime Error | 20 | 2940 | 230 | a,b=map(int, input().split())
ans=0
for i in range(a+1):
for j in range(a-i+1):
if 10000*i+5000*j+1000*(a-i-j)==b and ans==0:
print(f'{i} {j} {(a-i-j)}')
ans+=1
if ans==0:
print(f'-1 -1 -1') |
s682299656 | p03471 | u449473917 | 1555661459 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 230 | a,b=map(int, input().split())
ans=0
for i in range(a+1):
for j in range(a-i+1):
if 10000*i+5000*j+1000*(a-i-j)==b and ans==0:
print(f'{i} {j} {(a-i-j)}')
ans+=1
if ans==0:
print(f'-1 -1 -1') |
s057199242 | p03471 | u956866689 | 1555649081 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 288 | # -*- coding:utf-8 -*-
N, Y = map(int, input().split())
count = 0
for i in range((Y//10000)+1):
for j in range((Y//5000)+1):
k = (Y -i*10000 + j*5000) // 1000
if i + j + k == N:
print("{0} {1} {2}".format(i, j, k))
exit()
print("-1 -1 -1")
|
s141077919 | p03471 | u145889196 | 1555378678 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 430 | import math
N,Y=map(int,input().split())
YY=min(N,math.floor(Y/10000))
flag=False
for i in reversed(range(YY+1)):
Y2=Y-i*10000
N2=N-i
YYY=min(N2,math.floor(YY2/5000))
for j in reversed(range(YYY+1)):
YY3=int((Y2-j*5000)/1000)
if YY3==N2-j:
print(i, j, YY3)
flag=Tr... |
s659195525 | p03471 | u145889196 | 1555378643 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 428 | import math
N,Y=map(int,input().split())
YY=min(N,math.floor(Y/10000))
flag=False
for i in reversed(range(YY+1)):
Y2=Y-i*10000
N2=N-i
YYY=min(N2,math.floor(YY2/5000))
for j in reversed(range(YYY+1)):
YY3=int((Y2-j*5000)/1000)
if YY3==N2-j:
print(i, j, YY3)
flag=Tr... |
s633827195 | p03471 | u145889196 | 1555378487 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 468 | import math
N,Y=map(int,input().split())
YY=min(N,math.floor(Y/10000))
flag=False
for i in reversed(range(YY+1)):
Y2=Y-i*10000
N2=N-i
YYY=min(N2,math.floor(YY2/5000))
for j in reversed(range(YYY+1)):
YY3=int((Y2-j*5000)/1000)
if YY3==N2-j:
print(str(i),"",str(j),"",str(YY3))
... |
s411730394 | p03471 | u145889196 | 1555378230 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 455 | import math
N,Y=map(int,input().split())
YY=min(N,math.floor(Y/10000))
flag=False
for i in reversed(range(YY+1)):
Y2=Y-i*10000
N2=N-i
YYY=min(N2,math.floor(YY2/5000))
for j in reversed(range(YYY+1)):
YY3=int((Y2-j*5000)/1000)
if YY3==N2-j:
print(str(i),str(j),str(YY3))
... |
s225023166 | p03471 | u881378225 | 1555298785 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 444 | def ceil(x,y):
if x%y==0:
return x//y
return x//y+1
n,h=map(int,input().split())
ab=[list(map(int,input().split())) for i in range(n)]
ab.sort(reverse=True)
max_a=ab[0][0]
ab.sort(key=lambda x:x[1],reverse=True)
c=0
for i in range(n):
if ab[i][1]>max_a and ab[i][0]!=max_a:
c+=1
h-=ab... |
s214870418 | p03471 | u914330401 | 1555298664 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 256 | def find(n, y):
for i in range(n+1):
for j in range(n+1-i):
if 10000 * i + 5000 * j + 1000 * (n - i - j) == y:
return i, j, n-i-j
return -1, -1, -1
N, Y = map(int, input().split())
i, j, k = find(N, Y)
print("{} {} {}".format(i, j, k) |
s807315273 | p03471 | u914330401 | 1555298187 | Python | Python (3.4.3) | py | Runtime Error | 1616 | 3064 | 348 | N, Y = map(int, input().split())
goukei = 0
is_exist = False
for i in range(N+1):
for j in range(N+1):
k = N - i - j
goukei = i * 10000 + j * 5000 + k * 1000
if goukei == Y and i + j + k == N:
printf("{} {} {}".format(i, j, k))
is_exist = True
break
if is_exist:
break
if is_exist =... |
s406940656 | p03471 | u914330401 | 1555297893 | Python | Python (3.4.3) | py | Runtime Error | 1590 | 3060 | 339 | N, Y = map(int, input().split())
sum = 0
is_exist = False
for i in range(N+1):
for j in range(N+1):
k = N - i - j
sum = i * 10000 + j * 5000 + k * 1000
if sum == Y and i + j + k == N:
printf("{} {} {}".format(i, j, k))
is_exist = True
break
if is_exist:
break
if is_exist == False:
... |
s707245448 | p03471 | u914330401 | 1555297755 | Python | Python (3.4.3) | py | Runtime Error | 1687 | 3064 | 314 | N, Y = map(int, input().split())
sum = 0
is_exist = False
for i in range(N+1):
for j in range(N+1):
k = N - i - j
sum = i * 10000 + j * 5000 + k * 1000
if sum == Y and i + j + k == N:
printf("{} {} {}".format(i, j, k))
is_exist = True
break
if is_exist == False:
print("-1 -1 -1") |
s818179528 | p03471 | u914330401 | 1555297545 | Python | Python (3.4.3) | py | Runtime Error | 1642 | 3064 | 324 | N, Y = map(int, input().split())
sum = 0
is_exist = False
for i in range(N+1):
for j in range(N+1):
k = N - i - j
sum = i * 10000 + j * 5000 + k * 1000
if sum == Y and i + j + k == N:
printf(str(i) + " " + str(j) + " " + str(k))
is_exist = True
break
if is_exist == False:
print("-1 -1 ... |
s413013240 | p03471 | u914330401 | 1555297213 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 360 | N, Y = map(int, input().split())
sum = 0
is_exist = False
for i in range(N+1):
for j in range(N+1):
for k in range(N+1):
if i + j + k > N:
break
sum = i * 10000 + j * 5000 + k * 1000
if sum == Y:
printf(str(i) + " " + str(j) + " " + str(k))
is_exist = True
break
i... |
s769735025 | p03471 | u914330401 | 1555297124 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 360 | N, Y = map(int, input().split())
sum = 0
is_exist = False
for i in range(N+1):
for j in range(N+1):
for k in range(N+1):
if i + j + k > N:
break
sum = i * 10000 + j * 5000 + k * 1000
if sum == Y:
printf(str(i) + " " + str(j) + " " + str(k))
is_exist = True
break
i... |
s276459564 | p03471 | u167681750 | 1554839459 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3060 | 346 | n, y = map(int, input().split())
y = y/1000
answer= []
for rep1 in range(n + 1):
for rep2 in range(n + 1):
for rep3 in range(n + 1):
if rep1 + rep2 + rep3 == n and rep1 * 10 + rep2 * 5 + rep3 == y:
answer = ([rep1, rep2, rep3])
break
print(counter) if counter !=... |
s590387986 | p03471 | u411544692 | 1554790712 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 262 | import sys
N, Y = map(int, input().split())
for x in range(N+1)[::-1]:
if x <= N:
for y in range(N-i+1)[::-1]:
if x+y <= N:
z = N-(x+y)
if 10000*x + 5000*y + 1000*z == Y:
print(x,y,z)
sys.exit()
print(-1,-1,-1) |
s240419996 | p03471 | u411544692 | 1554785527 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 230 | import sys
N, Y = map(int, input().split())
for x in range(N+1)[::-1]:
for y in range(N+1)[::-1]:
if x+y <= N:
z = N-(x+y)
if 10000*x + 5000*y + 1000*z == Y:
print(x,y,z)
sys.exit()
print(-1,-1,-1) |
s190610873 | p03471 | u411544692 | 1554785039 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 195 | import sys
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:
print(x,y,z)
sys.exit()
print(-1,-1,-1) |
s638741190 | p03471 | u106184985 | 1554760116 | Python | Python (3.4.3) | py | Runtime Error | 20 | 2940 | 376 | N, Y = list(map(int, input().split()))
flag=0
try:
for x in range(N+1):
#if flag != 0:break
for y in range(N+1-x):
#if flag != 0:break
for z in range(N+1-x-y):
if x+y+z == N:
if x*10000 + y*5000 + z*1000 == Y:
print(x, y, z)
flag = 1
raise Exception
exc... |
s163362052 | p03471 | u473633103 | 1554755156 | Python | Python (3.4.3) | py | Runtime Error | 1632 | 3064 | 339 | a,b = map(int,input().split())
t = b//1000
f = False
for i in range(t//10+1):
for j in range(t//5):
if a == t - i*9 - j*4 and b == i*10000+j*5000+(a-i-j)*1000 and a-i-j>=0:
f = True
break
if f:
break
if f:
print(i,j,a-i-j)
else:
print(-1,-1,-1)
print(i*10000+j... |
s246457677 | p03471 | u633355062 | 1554396360 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 404 | #include <cstdio>
using namespace std;
int main(void)
{
int n, y;
scanf("%d %d", &n, &y);
for(int i=0; i<=n; i++)
{
for(int j=0; j<=n-i; j++)
{
for(int k=0; k<=n-i-j; k++)
{
if(i*10000 + j*5000 + k*1000 == y && i+j+k == n)
{
printf("%d %d %d\n", i, j, k);
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.