Submission #4087875
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 10000 * i + 5000 * j + 1000 * (n-i-j) == y: ans = [i, j, n -i-j] print(' '.join(map(str, ans)))
Submission Info
Submission Time | |
---|---|
Task | C - Otoshidama |
User | Asymmetry |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 240 Byte |
Status | AC |
Exec Time | 741 ms |
Memory | 3060 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 2940 KB |
a03 | AC | 185 ms | 2940 KB |
a04 | AC | 709 ms | 2940 KB |
b05 | AC | 17 ms | 2940 KB |
b06 | AC | 17 ms | 2940 KB |
b07 | AC | 17 ms | 2940 KB |
b08 | AC | 691 ms | 2936 KB |
b09 | AC | 635 ms | 2940 KB |
b10 | AC | 635 ms | 2940 KB |
b11 | AC | 631 ms | 2940 KB |
b12 | AC | 673 ms | 2940 KB |
b13 | AC | 574 ms | 2940 KB |
b14 | AC | 667 ms | 2940 KB |
b15 | AC | 741 ms | 2940 KB |
b16 | AC | 587 ms | 2940 KB |
b17 | AC | 594 ms | 2940 KB |
b18 | AC | 18 ms | 2940 KB |
b19 | AC | 21 ms | 2940 KB |
b20 | AC | 663 ms | 3060 KB |
b21 | AC | 680 ms | 2940 KB |
b22 | AC | 598 ms | 3060 KB |
b23 | AC | 622 ms | 2940 KB |
b24 | AC | 662 ms | 2940 KB |