Submission #2541765
Source Code Expand
#include <iostream> using namespace std; int main() { int n, y; cin >> n >> y; for (int i = 0; i <= n; i++) { for ( int j = 0; j + i <= n; j++) { int k = n - i - j; if ( i * 10000 + j * 5000 + k * 1000 == y ) { printf("%d %d %d\n", i, j, k); return (0); } } } printf("-1 -1 -1\n"); return 0; } // 自分でも驚くほど汚いコードを描いたと思う
Submission Info
Submission Time | |
---|---|
Task | C - Otoshidama |
User | toyama |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 497 Byte |
Status | AC |
Exec Time | 2 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 | 2 ms | 256 KB |
b10 | AC | 2 ms | 256 KB |
b11 | AC | 2 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 | 2 ms | 256 KB |
b22 | AC | 2 ms | 256 KB |
b23 | AC | 2 ms | 256 KB |
b24 | AC | 2 ms | 256 KB |