Submission #3424560
Source Code Expand
#include <algorithm> #include <bitset> #include <cassert> #include <cfloat> #include <climits> #include <cmath> #include <complex> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <fstream> #include <functional> #include <iomanip> #include <iostream> #include <list> #include <map> #include <memory> #include <numeric> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <utility> #include <vector> // c++11 #include <array> #include <tuple> #include <unordered_map> #include <unordered_set> #define mp make_pair #define mt make_tuple #define rep(i, n) for (int i = 0; i < (n); i++) using namespace std; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; template <class T> using max_priority_queue = priority_queue<T>; template <class T> using min_priority_queue = priority_queue<T, std::vector<T>, std::greater<T>>; const int INF = 1 << 29; const ll LL_INF = 1LL << 60; const double EPS = 1e-9; const ll MOD = 1000000007; const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1}; ll K; int main() { cin >> K; int N = 50; vector<ll> result(50); for (int i = 0; i < result.size(); i++) { result[i] = i; result[i] += K / N; } K %= N; for (int i = 0; i < K; i++) { result[i] += N; for (int j = 0; j < result.size(); j++) { if (i == j) { continue; } result[j]--; } } cout << N << endl; for (auto &val : result) { cout << val << " "; } cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Decrease (Contestant ver.) |
User | togatoga |
Language | C++14 (GCC 5.4.1) |
Score | 600 |
Code Size | 1738 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 |