Submission #3805042
Source Code Expand
N,sum1 = map(int,input().split()) A = 10000 B = 5000 C = 1000 def memuA(): for i in range(N+1): for j in range(N+1 - i): if i*A + j*B + (N-i-j)*C == sum1: return [i,j,(N-i-j)] return [-1,-1,-1] print(*memuA())
Submission Info
Submission Time | |
---|---|
Task | C - Otoshidama |
User | aojeoifio |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 236 Byte |
Status | AC |
Exec Time | 610 ms |
Memory | 3316 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 | 21 ms | 3316 KB |
a02 | AC | 17 ms | 3060 KB |
a03 | AC | 18 ms | 3060 KB |
a04 | AC | 610 ms | 3060 KB |
b05 | AC | 17 ms | 3060 KB |
b06 | AC | 17 ms | 2940 KB |
b07 | AC | 17 ms | 3060 KB |
b08 | AC | 17 ms | 3060 KB |
b09 | AC | 595 ms | 3060 KB |
b10 | AC | 604 ms | 3060 KB |
b11 | AC | 597 ms | 3060 KB |
b12 | AC | 17 ms | 2940 KB |
b13 | AC | 18 ms | 2940 KB |
b14 | AC | 19 ms | 3060 KB |
b15 | AC | 548 ms | 2940 KB |
b16 | AC | 556 ms | 3060 KB |
b17 | AC | 566 ms | 3060 KB |
b18 | AC | 17 ms | 3060 KB |
b19 | AC | 23 ms | 2940 KB |
b20 | AC | 17 ms | 3060 KB |
b21 | AC | 601 ms | 3060 KB |
b22 | AC | 575 ms | 3060 KB |
b23 | AC | 580 ms | 2940 KB |
b24 | AC | 526 ms | 2940 KB |