Submission #1466179
Source Code Expand
#include <iostream> #define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++) using namespace std; typedef long long ll; ll K, A[50]; int main(void) { ll N = 50; cin >> K; REP(i, 0, N) A[i] = (N - i - 1) + (K / N); REP(i, 0, K % N) A[i]++; cout << N << endl; REP(i, 0, N) { cout << A[i]; if(i + 1 != N) cout << " "; } cout << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Decrease (Contestant ver.) |
User | kshinya |
Language | C++14 (GCC 5.4.1) |
Score | 600 |
Code Size | 386 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 |