PlaygroundCpp/Sources/Playground.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

#include <iostream>
#include <vector>
//#include <gtest/gtest.h>

using std::vector;

vector<int> optimal_summands(int n) {
	vector<int> summands;
	if (n < 3) {
		summands.push_back(n);
		return summands;
	}
	int runningSum = 0;
	for (int i = 1; i < n + 1; i++) {
		runningSum = runningSum + i;
		summands.push_back(i);
		if (runningSum == n) {
			break;
		}
		if (runningSum > n) {
			summands.pop_back();
			summands.back() = summands.back() + n - runningSum + i;
			break;
		}
	}
	return summands;
}


int main() {
	int n;
	std::cin >> n;
	vector<int> summands = optimal_summands(n);
	std::cout << summands.size() << '\n';
	for (size_t i = 0; i < summands.size(); ++i) {
		std::cout << summands[i] << ' ';
	}
}