summaryrefslogtreecommitdiff
path: root/AlgoDesignAndTechniqueEdxJava/sources/DifferentSummands.java
blob: 1be417c708eb15c8f1b9086c6e3666f7e60afd1d (plain)
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
39
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class DifferentSummands {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		List<Integer> summands = getOptimalSummands(n);
		System.out.println(summands.size());
		for (Integer summand : summands) {
			System.out.print(summand + " ");
		}
	}

	public static List<Integer> getOptimalSummands(int n) {
		List<Integer> summands = new ArrayList<Integer>();
		if (n < 3) {
			summands.add(n);
			return summands;
		}
		int runningSum = 0;
		for (int i = 1; i < n + 1; i++) {
			runningSum = runningSum + i;
			summands.add(i);
			if (runningSum == n) {
				break;
			}
			if (runningSum > n) {
				summands.remove(summands.size() - 1);
				summands.set(summands.size() - 1, summands.get(summands.size() - 1).intValue() + n - runningSum + i);
				break;
			}
		}
		return summands;
	}

}