Submission #7027375
Source Code Expand
num = input().split() n = int(num[0]) y = int(num[1]) flag = False for i in range(n+1): if flag: break for j in range(n+1): if flag: break k = n-i-j if i+j+k == n: me = i * 10000 ge = j * 5000 se = k * 1000 if me + ge + se == y: flag = True ma = i ga = j sa = k if flag: print(ma,ga,sa) else: print(-1,-1,-1)
Submission Info
Submission Time | |
---|---|
Task | C - Otoshidama |
User | macho |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 577 Byte |
Status | WA |
Exec Time | 2104 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 | AC | 17 ms | 3060 KB |
a02 | WA | 17 ms | 3064 KB |
a03 | AC | 18 ms | 3064 KB |
a04 | WA | 1195 ms | 3060 KB |
b05 | AC | 17 ms | 3064 KB |
b06 | AC | 17 ms | 3060 KB |
b07 | AC | 17 ms | 3064 KB |
b08 | AC | 17 ms | 3064 KB |
b09 | WA | 1182 ms | 3064 KB |
b10 | TLE | 2104 ms | 3064 KB |
b11 | WA | 1263 ms | 3064 KB |
b12 | AC | 17 ms | 3060 KB |
b13 | AC | 19 ms | 3064 KB |
b14 | AC | 20 ms | 3064 KB |
b15 | WA | 1342 ms | 3064 KB |
b16 | WA | 1172 ms | 3064 KB |
b17 | WA | 1170 ms | 3064 KB |
b18 | AC | 17 ms | 2940 KB |
b19 | WA | 22 ms | 3060 KB |
b20 | AC | 18 ms | 3064 KB |
b21 | TLE | 2104 ms | 3064 KB |
b22 | TLE | 2047 ms | 3060 KB |
b23 | WA | 1224 ms | 3064 KB |
b24 | WA | 1081 ms | 3064 KB |