Submission #1519037
Source Code Expand
#include<iostream> #include<algorithm> #include<functional> #include<vector> #include<queue> using namespace std; using ll = long long; int main() { ll K; cin >> K; for (int n = 50; n >= 2; n--) { vector<ll> ans(n); for (int i = 0; i < n; i++) { ans[i] = n - 1+ -K + (n + 1) * (K / n); } for (int i = 0; i < K%n; i++) { ans[i] += n + 1; } bool ok = true; for (int i = 0; i < n; i++)if (ans[i] < 0)ok = false; if (!ok)continue; cout << n << endl; for (int i = 0; i < n; i++) { cout << ans[i] << " "; } cout << endl; return 0; } }
Submission Info
Submission Time | |
---|---|
Task | D - Decrease (Contestant ver.) |
User | tomabou |
Language | C++14 (GCC 5.4.1) |
Score | 600 |
Code Size | 603 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 600 / 600 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0, example1, example2, example3, example4 |
All | corner0, corner1, corner2, corner3, corner4, corner5, corner6, corner7, corner8, corner9, example0, example1, example2, example3, example4, rand0, rand1, rand2, rand3, rand4, rand5, rand6, rand7, rand8, rand9 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
corner0 | AC | 1 ms | 256 KB |
corner1 | AC | 1 ms | 256 KB |
corner2 | AC | 1 ms | 256 KB |
corner3 | AC | 1 ms | 256 KB |
corner4 | AC | 1 ms | 256 KB |
corner5 | AC | 1 ms | 256 KB |
corner6 | AC | 1 ms | 256 KB |
corner7 | AC | 1 ms | 256 KB |
corner8 | AC | 1 ms | 256 KB |
corner9 | AC | 1 ms | 256 KB |
example0 | AC | 1 ms | 256 KB |
example1 | AC | 1 ms | 256 KB |
example2 | AC | 1 ms | 256 KB |
example3 | AC | 1 ms | 256 KB |
example4 | AC | 1 ms | 256 KB |
rand0 | AC | 1 ms | 256 KB |
rand1 | AC | 1 ms | 256 KB |
rand2 | AC | 1 ms | 256 KB |
rand3 | AC | 1 ms | 256 KB |
rand4 | AC | 1 ms | 256 KB |
rand5 | AC | 1 ms | 256 KB |
rand6 | AC | 1 ms | 256 KB |
rand7 | AC | 1 ms | 256 KB |
rand8 | AC | 1 ms | 256 KB |
rand9 | AC | 1 ms | 256 KB |