Submission #7021096
Source Code Expand
n,y=map(int,input().split()) ans=[-1]*3 for i in range(n+1): for j in range(n-i+1): k=(y-i*10000-j*5000)//1000 if i+j+k==n: ans=[i,j,k] break print(*ans)
Submission Info
Submission Time | |
---|---|
Task | C - Otoshidama |
User | luce |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 206 Byte |
Status | AC |
Exec Time | 778 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 | 181 ms | 3060 KB |
a04 | AC | 698 ms | 3060 KB |
b05 | AC | 17 ms | 3060 KB |
b06 | AC | 17 ms | 2940 KB |
b07 | AC | 17 ms | 2940 KB |
b08 | AC | 705 ms | 2940 KB |
b09 | AC | 645 ms | 2940 KB |
b10 | AC | 704 ms | 2940 KB |
b11 | AC | 650 ms | 2940 KB |
b12 | AC | 665 ms | 2940 KB |
b13 | AC | 629 ms | 2940 KB |
b14 | AC | 680 ms | 2940 KB |
b15 | AC | 682 ms | 3060 KB |
b16 | AC | 658 ms | 2940 KB |
b17 | AC | 662 ms | 2940 KB |
b18 | AC | 17 ms | 2940 KB |
b19 | AC | 21 ms | 3060 KB |
b20 | AC | 618 ms | 2940 KB |
b21 | AC | 742 ms | 2940 KB |
b22 | AC | 649 ms | 2940 KB |
b23 | AC | 778 ms | 2940 KB |
b24 | AC | 623 ms | 2940 KB |