Submission #7928770
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
//repetition
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
//container util
#define all(x) (x).begin(),(x).end()
//typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
//const value
//const ll MOD = 1e9 + 7;
//const int dx[] = {0,1,0,-1};//{0,0,1,1,1,-1,-1,-1};
//const int dy[] = {1,0,-1,0};//{1,-1,0,1,-1,0,1,-1};
//conversion
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline ll toLL(string s) {ll v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll K;
const ll N = 50;
cin >> K;
cout << N << endl;
VLL ans(N,0);
rep(i,N) ans[i] = 49 + K/50;
rep(i,K%N){
ans[i] += N+1;
rep(j,N) ans[j]--;
}
rep(i,N) cout << ans[i] << " ";
cout << endl;
return 0;
}
Submission Info
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 |