Submission #5719863
Source Code Expand
#pragma GCC optimize("Ofast") #include<bits/stdc++.h> using namespace std; int main(){ int n,y; cin>>n>>y; for(int i=0;i<(n+1)*(n+1);i++){ int a,b,c; a=i%(n+1); b=i/(n+1); c=n-a-b; if(c<0) continue; if(a*10000+b*5000+c*1000==y){ cout<<a<<' '<<b<<' '<<c<<endl; return 0; } } cout<<"-1 -1 -1"<<endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Otoshidama |
User | okkuu2 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 348 Byte |
Status | AC |
Exec Time | 17 ms |
Memory | 256 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 | 1 ms | 256 KB |
a02 | AC | 1 ms | 256 KB |
a03 | AC | 1 ms | 256 KB |
a04 | AC | 1 ms | 256 KB |
b05 | AC | 1 ms | 256 KB |
b06 | AC | 1 ms | 256 KB |
b07 | AC | 1 ms | 256 KB |
b08 | AC | 1 ms | 256 KB |
b09 | AC | 1 ms | 256 KB |
b10 | AC | 17 ms | 256 KB |
b11 | AC | 17 ms | 256 KB |
b12 | AC | 1 ms | 256 KB |
b13 | AC | 1 ms | 256 KB |
b14 | AC | 1 ms | 256 KB |
b15 | AC | 1 ms | 256 KB |
b16 | AC | 1 ms | 256 KB |
b17 | AC | 1 ms | 256 KB |
b18 | AC | 1 ms | 256 KB |
b19 | AC | 1 ms | 256 KB |
b20 | AC | 1 ms | 256 KB |
b21 | AC | 17 ms | 256 KB |
b22 | AC | 16 ms | 256 KB |
b23 | AC | 16 ms | 256 KB |
b24 | AC | 16 ms | 256 KB |