Submission #1947399
Source Code Expand
#include <string> #include <queue> #include <stack> #include <vector> #include <sstream> #include <algorithm> #include <deque> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <list> #include <cstdio> #include <iostream> #include <cmath> #include <climits> #include <bitset> #include <functional> #include <numeric> #include <ctime> #include <cassert> #include <cstring> #include <fstream> using namespace std; int main() { int n, y; cin >> n >> y; int ans1 = -1, ans2 = -1, ans3 = -1; for (int i = 0; i <= n; i++) { for (int j = 0; i + j <= n; j++) { int k = n - i - j; int hantei = 10000 * i + 5000 * j + 1000 * k; if (hantei == y) { ans1 = i, ans2 = j, ans3 = k; break; } } } printf("%d %d %d\n", ans1, ans2, ans3); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Otoshidama |
User | peradfn1126 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 950 Byte |
Status | AC |
Exec Time | 3 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 | 2 ms | 256 KB |
a04 | AC | 3 ms | 256 KB |
b05 | AC | 1 ms | 256 KB |
b06 | AC | 1 ms | 256 KB |
b07 | AC | 1 ms | 256 KB |
b08 | AC | 3 ms | 256 KB |
b09 | AC | 3 ms | 256 KB |
b10 | AC | 3 ms | 256 KB |
b11 | AC | 3 ms | 256 KB |
b12 | AC | 3 ms | 256 KB |
b13 | AC | 2 ms | 256 KB |
b14 | AC | 3 ms | 256 KB |
b15 | AC | 3 ms | 256 KB |
b16 | AC | 3 ms | 256 KB |
b17 | AC | 3 ms | 256 KB |
b18 | AC | 1 ms | 256 KB |
b19 | AC | 1 ms | 256 KB |
b20 | AC | 2 ms | 256 KB |
b21 | AC | 3 ms | 256 KB |
b22 | AC | 3 ms | 256 KB |
b23 | AC | 3 ms | 256 KB |
b24 | AC | 3 ms | 256 KB |