Submission #3283023
Source Code Expand
#include <cstdio> #include <iostream> #include <string> #include <vector> #include <sstream> #include <map> #include <set> #include <queue> #include <algorithm> #include <cmath> #include <cstdlib> #include <cstring> #include <typeinfo> #include <numeric> #include <functional> #include <unordered_map> #include <bitset> #include <stack> using namespace std; using ll = long long; using ull = unsigned long long; const ll INF = 1e16; const ll MOD = 1e9 + 7; #define REP(i, n) for(ll i = 0; i < n; i++) int main() { ll n, Y; cin >> n >> Y; REP(x, n + 1){ REP(y, n + 1){ ll z = n - x - y; ll m = 10000 * x + 5000 * y + 1000 * z; if(z >= 0 && m == Y){ cout << x << ' ' << y << ' ' << z << endl; return 0; } } } cout << "-1 -1 -1" << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Otoshidama |
User | chocobo |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 908 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 |