(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/6_maximum_number_of_prizes/DifferentSummands.java
<filename>(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/6_maximum_number_of_prizes/DifferentSummands.javaimport java.util.*;

public class DifferentSummands {
    private static List<Integer> optimalSummands(int n) {
        List<Integer> summands = new ArrayList<Integer>();
        //write your code here
        return summands;
    }
    
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        List<Integer> summands = optimalSummands(n);
        System.out.println(summands.size());
        for (Integer summand : summands) {
            System.out.print(summand + " ");
        }
    }
}

