Submission #4082357

Source Code Expand

n, y = map(int, input().split())
 
ans =[-1, -1, -1]
for i in range(n + 1):
    for j in range(n + 1 - i):
            if i * 10000 + j * 5000 + (n - i - j) * 1000 == 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 270 Byte
Status AC
Exec Time 719 ms
Memory 3060 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 18 ms 3060 KB
a02 AC 18 ms 2940 KB
a03 AC 159 ms 3060 KB
a04 AC 714 ms 3060 KB
b05 AC 18 ms 3060 KB
b06 AC 18 ms 2940 KB
b07 AC 18 ms 2940 KB
b08 AC 638 ms 2940 KB
b09 AC 629 ms 2940 KB
b10 AC 596 ms 2940 KB
b11 AC 719 ms 3060 KB
b12 AC 714 ms 2940 KB
b13 AC 578 ms 3060 KB
b14 AC 604 ms 3060 KB
b15 AC 675 ms 2940 KB
b16 AC 579 ms 2940 KB
b17 AC 604 ms 3060 KB
b18 AC 18 ms 2940 KB
b19 AC 21 ms 3060 KB
b20 AC 639 ms 3060 KB
b21 AC 679 ms 2940 KB
b22 AC 596 ms 2940 KB
b23 AC 611 ms 2940 KB
b24 AC 665 ms 3060 KB