Submission #4082144
Source Code Expand
n, y = map(int, input().split()) s = min(n, y // 10000) t = min(n, y // 5000) u = min(n, y // 1000) ans =[-1, -1, -1] for i in range(s, -1, -1): for j in range(t, -1, -1): for u in range(u, -1, -1): if i * 10000 + j * 5000 + k * 1000 == y and i + j + k == n: ans = [i, j, k] break print(' '.join(map(str, ans)))
Submission Info
Submission Time | |
---|---|
Task | C - Otoshidama |
User | Asymmetry |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 380 Byte |
Status | RE |
Exec Time | 18 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | RE | 17 ms | 3064 KB |
a02 | RE | 18 ms | 3064 KB |
a03 | RE | 17 ms | 3064 KB |
a04 | RE | 17 ms | 3064 KB |
b05 | RE | 17 ms | 3064 KB |
b06 | RE | 17 ms | 3064 KB |
b07 | RE | 17 ms | 3064 KB |
b08 | RE | 17 ms | 3064 KB |
b09 | RE | 17 ms | 3064 KB |
b10 | RE | 17 ms | 3060 KB |
b11 | RE | 17 ms | 3064 KB |
b12 | RE | 17 ms | 3064 KB |
b13 | RE | 17 ms | 3064 KB |
b14 | RE | 17 ms | 3060 KB |
b15 | RE | 17 ms | 3064 KB |
b16 | RE | 17 ms | 3064 KB |
b17 | RE | 17 ms | 3064 KB |
b18 | RE | 17 ms | 3064 KB |
b19 | RE | 17 ms | 3064 KB |
b20 | RE | 17 ms | 3060 KB |
b21 | RE | 17 ms | 3064 KB |
b22 | RE | 17 ms | 3060 KB |
b23 | RE | 17 ms | 3064 KB |
b24 | RE | 17 ms | 3064 KB |