AtCoder Regular Contest 079 D

D - Decrease (Contestant ver.)
Time limit : 2sec / Memory limit : 256MB

Score : 600 points

Problem Statement
We have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes N−1 or smaller.

Determine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element by N, and increase each of the other elements by 1.
It can be proved that the largest element in the sequence becomes N−1 or smaller after a finite number of operations.

You are given an integer K. Find an integer sequence ai such that the number of times we will perform the above operation is exactly K. It can be shown that there is always such a sequence under the constraints on input and output in this problem.

Constraints
0≤K≤50×1016
Input
Input is given from Standard Input in the following format:

K
Output
Print a solution in the following format:

N
a1 a2 … aN
Here, 2≤N≤50 and 0≤ai≤1016+1000 must hold.

Sample Input 1
Copy
0
Sample Output 1
Copy
4
3 3 3 3
Sample Input 2
Copy
1
Sample Output 2
Copy
3
1 0 3
Sample Input 3
Copy
2
Sample Output 3
Copy
2
2 2
The operation will be performed twice: [2, 2] -> [0, 3] -> [1, 1].

Sample Input 4
Copy
3
Sample Output 4
Copy
7
27 0 0 0 0 0 0
Sample Input 5
Copy
1234567894848
Sample Output 5
Copy
10
1000 193 256 777 0 1 1192 1234567891011 48 425
找规律

#include <bits/stdc++.h>#define int long long using namespace std;signed main(){    long long k;    cin>>k;    long long f=k%50;    long long cnt=(k)/50;    cnt+=49;    cout<<"50"<<endl;    for(int i=1;i<=50;i++){        if(i<=(50-f)){            cout<<cnt-f<<" ";        } else {            cout<<cnt+51-f<<" ";        }    }    puts("");    return 0;}