Submission #4672545
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> using namespace std; typedef long long ll; int n; ll total; bool findPattern() { vector<ll> xy; for (int i=0;i<=n;i++) { for (int j=0;j+i<=n;j++) { ll diff = total - 10000 * i - 5000 * j; if (diff / 1000 == (n - i - j)) { cout << i << " " << j << " " << (n - i - j) << endl; return true; } } } return false; } void solve() { if (!findPattern()) { cout << "-1 -1 -1" << endl; } } int main() { cin >> n >> total; solve(); }
Submission Info
Submission Time | |
---|---|
Task | C - Otoshidama |
User | hashmup |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 580 Byte |
Status | AC |
Exec Time | 4 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 | 4 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 | 4 ms | 256 KB |
b10 | AC | 4 ms | 256 KB |
b11 | AC | 4 ms | 256 KB |
b12 | AC | 1 ms | 256 KB |
b13 | AC | 1 ms | 256 KB |
b14 | AC | 1 ms | 256 KB |
b15 | AC | 4 ms | 256 KB |
b16 | AC | 4 ms | 256 KB |
b17 | AC | 4 ms | 256 KB |
b18 | AC | 1 ms | 256 KB |
b19 | AC | 1 ms | 256 KB |
b20 | AC | 1 ms | 256 KB |
b21 | AC | 4 ms | 256 KB |
b22 | AC | 4 ms | 256 KB |
b23 | AC | 4 ms | 256 KB |
b24 | AC | 4 ms | 256 KB |