Submission #1466358

---

Source Code Expand

#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <set>
#include <cstring>
#include <map>
#include <bitset>
#include <random>
#include <stack>
#include <list>
#include <unordered_set>
#include <unordered_map>
#include <ctime>

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define sc second
#define fs first
#define mp make_pair
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

template<class T> T sqr(T x) { return x*x; }
ld pi = 3.1415926535897932384626433832795;
ll mod = 1e9 + 7;
const int N = 1e6 + 10;

typedef vector<vector<ll> > mtrx;

ll gcd(ll a, ll b) {
	return b ? gcd(b, a % b) : a;
}

ll ans[111];

void try_solve(ll k, int n) {
	while (k--) {
		int id = 0;
		for (int i = 0; i < n; i++)
			if (ans[i] > ans[id]) id = i;
		for (int i = 0; i < n; i++) ans[i] += 1;
		ans[id] -= n + 1;
	}
	cout << "\nSEEE\n";
	ll sum = 0;
	for (int i = 0; i < n; i++) {
		cout << ans[i] << ' ';
		sum += ans[i];
	}
	cout << "SUM" << ' ' << sum;
}

int main(){
	ll k;
	cin >> k;
	if (k == 1) {
		cout << 3 << '\n' << 0 << ' ' << 0 << ' ' << 3;
	}
	else if (k == 2) {
		cout << 2 << '\n' << 2 << ' ' << 2;
	} else if (k < 1000)
	cout << 2 << '\n' << 2 - 1 << ' ' << 2ll - 1ll + k;
	else {
		ll n = 50;
		ll cur = k;
		for (int i = 0; i < n; i++) {
			ans[i] = 0;
			ll add = min(cur, k / n);
			ans[i] += add;
			cur -= add;
		}
		for (int i = 0; i < cur; i++)
			ans[i] += 1+n-cur;
		//ans[0] += 10;
		cout << n << endl;
		for (int i = 0; i < n; i++) {
			cout << ans[i] << ' ';
		}
		//try_solve(k, n);
	}
	return 0;
}

Submission Info

Judge Result