Submission #3415907
Source Code Expand
#include <cstdio> #include <cmath> #include <iostream> #include <algorithm> #include <cstring> #include <cstdlib> #include <numeric> #include <memory> #include <map> #include <vector> #include <queue> using namespace std; typedef long long LL; #define REP(i, N) for (int i = 0; i < N; ++i) int n, s; // 9x+4y=s-n, x+y<=n int main() { cin >> n >> s; s /= 1000; bool succ = false; for (int i = 0; i * 9 <= s - n && !succ; ++i) { int j = s - n - 9 * i; if (j % 4) continue; j /= 4; if (i + j <= n) { succ = 1; cout << i << ' ' << j << ' ' << n - i - j << endl; } } if (!succ) cout << -1 << ' ' << -1 << ' ' << -1 << endl; }
Submission Info
Submission Time | |
---|---|
Task | ABC085C - Otoshidama |
User | htakatoshi |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 756 Byte |
Status | AC |
Exec Time | 1 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 | 1 ms | 256 KB |
b11 | AC | 1 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 | 1 ms | 256 KB |
b22 | AC | 1 ms | 256 KB |
b23 | AC | 1 ms | 256 KB |
b24 | AC | 1 ms | 256 KB |