Submission #2857312
Source Code Expand
#include <iostream> #include <cstdio> #include <algorithm> #include <vector> #include <functional> #include <queue> #include <string> #include <cstring> #include <numeric> #include <cstdlib> #include <cmath> using namespace std; typedef long long ll; #define INF 10e10 #define rep(i,n) for(int i=0; i<n; i++) #define REP_R(i,n,m) for(int i=m; i<n; i++) #define MAX 100 int N; ll Y; int main() { cin >> N >> Y; int flag = false; int x,y,z; // i: 10000, j: 5000, k: 1000 for (int i = 0; i <= N; i++) { x = i; for (int j = 0; j <= N - i; j++) { int k = (N - i) - j; ll tt = i * 10000 + j * 5000 + k * 1000; if (tt == Y) { flag = true; y = j; z = k; break; } } if (flag) { printf("%d %d %d\n", x,y,z); return 0; } } cout << "-1 -1 -1" << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Otoshidama |
User | seriru |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 892 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 | 1 ms | 256 KB |
a04 | AC | 2 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 | 3 ms | 256 KB |
b10 | AC | 3 ms | 256 KB |
b11 | AC | 3 ms | 256 KB |
b12 | AC | 1 ms | 256 KB |
b13 | AC | 1 ms | 256 KB |
b14 | AC | 1 ms | 256 KB |
b15 | AC | 2 ms | 256 KB |
b16 | AC | 2 ms | 256 KB |
b17 | AC | 2 ms | 256 KB |
b18 | AC | 1 ms | 256 KB |
b19 | AC | 1 ms | 256 KB |
b20 | AC | 1 ms | 256 KB |
b21 | AC | 3 ms | 256 KB |
b22 | AC | 2 ms | 256 KB |
b23 | AC | 2 ms | 256 KB |
b24 | AC | 2 ms | 256 KB |