Submission #7023850


Source Code Expand

N,Y = map(int,input().split())
x=-1
y=-1
z=-1
for i in range(N+1):
    for j in range(N-i+1):
        bet=Y-(10000*i+5000*j+1000*(N-i-j))
        if bet == 0:
            x=i
            y=j
            z=N-i-j
            break
        
d=[x,y,z]
print(d[0])
print(d[1])
print(d[2])

Submission Info

Submission Time
Task C - Otoshidama
User yujin0502
Language Python (3.4.3)
Score 300
Code Size 299 Byte
Status AC
Exec Time 843 ms
Memory 3188 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 24
Set Name Test Cases
Sample a01, a02, a03, a04
All a01, a02, a03, a04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20, b21, b22, b23, b24
Case Name Status Exec Time Memory
a01 AC 17 ms 3064 KB
a02 AC 17 ms 3060 KB
a03 AC 200 ms 3064 KB
a04 AC 826 ms 3060 KB
b05 AC 17 ms 3064 KB
b06 AC 18 ms 3060 KB
b07 AC 17 ms 3064 KB
b08 AC 742 ms 3064 KB
b09 AC 759 ms 3060 KB
b10 AC 764 ms 3064 KB
b11 AC 818 ms 3064 KB
b12 AC 843 ms 3064 KB
b13 AC 735 ms 3064 KB
b14 AC 714 ms 3064 KB
b15 AC 781 ms 3064 KB
b16 AC 691 ms 3060 KB
b17 AC 699 ms 3064 KB
b18 AC 17 ms 3064 KB
b19 AC 22 ms 3064 KB
b20 AC 688 ms 3064 KB
b21 AC 822 ms 3064 KB
b22 AC 691 ms 3064 KB
b23 AC 729 ms 3188 KB
b24 AC 698 ms 3064 KB