Submission #1519120
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll> P; int main(){ ll K; cin >> K; vector<ll> ans(50, 0); for(int i=0;i<50;i++) ans[i] = 49 - i; for(ll i = 0; i<50;i++){ ans[i] += K/50; ans[i] += (K%50) > i; } for(int i=0;i<50;i++){ cout << ans[i]; if(i == 49) cout << endl; else cout << " "; } return 0; } /* 49 48 47 ... 0 = 0 50 48 47 .. 0 = 1 50 49 48 0 .... 0 = 3 50 49 48 47 ... 1 = 50 51 49 48 47 ... 1 = 51 51 50 48 47 ... 1 = 52 51 50 49 47 ... 1 */
Submission Info
Submission Time | |
---|---|
Task | D - Decrease (Contestant ver.) |
User | base64 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 595 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 1 ms | 256 KB |
corner1 | WA | 1 ms | 256 KB |
corner2 | WA | 1 ms | 256 KB |
corner3 | WA | 1 ms | 256 KB |
corner4 | WA | 1 ms | 256 KB |
corner5 | WA | 1 ms | 256 KB |
corner6 | WA | 1 ms | 256 KB |
corner7 | WA | 1 ms | 256 KB |
corner8 | WA | 1 ms | 256 KB |
corner9 | WA | 1 ms | 256 KB |
example0 | AC | 1 ms | 256 KB |
example1 | WA | 1 ms | 256 KB |
example2 | WA | 1 ms | 256 KB |
example3 | WA | 1 ms | 256 KB |
example4 | WA | 1 ms | 256 KB |
rand0 | WA | 1 ms | 256 KB |
rand1 | WA | 1 ms | 256 KB |
rand2 | WA | 1 ms | 256 KB |
rand3 | WA | 1 ms | 256 KB |
rand4 | WA | 1 ms | 256 KB |
rand5 | WA | 1 ms | 256 KB |
rand6 | WA | 1 ms | 256 KB |
rand7 | WA | 1 ms | 256 KB |
rand8 | WA | 1 ms | 256 KB |
rand9 | WA | 1 ms | 256 KB |