Submission #4404022


Source Code Expand

n, y = map(int, input().split())
A = [10000, 5000, 1000]

ans = [-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:
            ans = [i, j, n - i - j]
            break
            
print(' '.join(map(str, ans)))

Submission Info

Submission Time
Task C - Otoshidama
User Asymmetry
Language Python (3.4.3)
Score 300
Code Size 297 Byte
Status AC
Exec Time 785 ms
Memory 3064 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 2940 KB
a02 AC 17 ms 3064 KB
a03 AC 167 ms 3060 KB
a04 AC 631 ms 3060 KB
b05 AC 17 ms 3060 KB
b06 AC 17 ms 3060 KB
b07 AC 17 ms 3060 KB
b08 AC 700 ms 2940 KB
b09 AC 682 ms 3060 KB
b10 AC 628 ms 3060 KB
b11 AC 629 ms 3060 KB
b12 AC 785 ms 3060 KB
b13 AC 582 ms 3064 KB
b14 AC 667 ms 3060 KB
b15 AC 619 ms 2940 KB
b16 AC 623 ms 3060 KB
b17 AC 635 ms 3060 KB
b18 AC 17 ms 3060 KB
b19 AC 21 ms 2940 KB
b20 AC 621 ms 3060 KB
b21 AC 729 ms 3060 KB
b22 AC 600 ms 3060 KB
b23 AC 613 ms 3060 KB
b24 AC 595 ms 3060 KB