Submission #3784891
Source Code Expand
#include<iostream> #include<algorithm> #include<map> #include<set> #include<vector> using namespace std; using ll = long long; using lli = long long int; ll MM = 1000000000; ll mod = MM + 7; #define INF (ll)1e18 int main(){ int n; cin >> n; ll y; cin >> y; for(int i = 0; i < 100; i++){ for(int j = 0; j < 100; j++){ if(10000*i + 5000*j + 1000*(n-i-j) == y){ cout << i << " " << j << " " << n-i-j << endl; break; } } } cout << -1 << " " << -1 << " " << -1 << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Otoshidama |
User | Kant |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 581 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 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 | WA | 1 ms | 256 KB |
a02 | WA | 1 ms | 256 KB |
a03 | WA | 1 ms | 256 KB |
a04 | WA | 1 ms | 256 KB |
b05 | WA | 1 ms | 256 KB |
b06 | WA | 1 ms | 256 KB |
b07 | WA | 1 ms | 256 KB |
b08 | WA | 1 ms | 256 KB |
b09 | WA | 1 ms | 256 KB |
b10 | AC | 1 ms | 256 KB |
b11 | AC | 1 ms | 256 KB |
b12 | WA | 1 ms | 256 KB |
b13 | WA | 1 ms | 256 KB |
b14 | WA | 1 ms | 256 KB |
b15 | WA | 1 ms | 256 KB |
b16 | WA | 1 ms | 256 KB |
b17 | WA | 1 ms | 256 KB |
b18 | WA | 1 ms | 256 KB |
b19 | WA | 1 ms | 256 KB |
b20 | WA | 1 ms | 256 KB |
b21 | AC | 1 ms | 256 KB |
b22 | AC | 1 ms | 256 KB |
b23 | AC | 1 ms | 256 KB |
b24 | AC | 1 ms | 256 KB |