Submission #2551203
Source Code Expand
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 1, 1, -1, -1};
int dx[]={1, -1, 0, 0, 1, -1, -1, 1};
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define mp make_pair
#define fi first
#define sc second
ll k;
ll a[100];
int main(){
cin >> k;
ll n = 50;
REP(i,n) {
a[i] = n - 1 + (k / n);
}
REP(i,k % n) {
a[i] += n - (k % n) + 1;
}
FOR(i,k % n,n) {
a[i] -= (k % n);
}
cout << n << endl;
REP(i,n) {
cout << a[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 |