Problem I. 101. (March 2005)
I. 101. Determine the number of ways of writing a positive integer n as a sum of positive integers without regard to order. (For example, there are 7 possibilities to decompose ``five'': 5=4+1=3+2=3+1+1=2+2+1=2+1+1+1=1+1+1+1+1, where ``5'' itself is also allowed as a sum with one term.)
Write your program (i101.pas, ...) whose input is a positive integer n, then it displays the different decompositions of n as well as the number of these decompositions.
The program should be submitted. Notice that there are similarities but also differences between the current problem and problem I. 87.
Deadline expired on April 15, 2005.
14 students sent a solution. 10 points: Acsai Péter, Filus Tamás, Gyüre Balázs, Kisfaludi-Bak Sándor, Ozsvárt László, Ökrös Tamás, Stippinger Marcell, Ureczky Bálint, Vincze János, Zöld Péter. 8 points: 1 student. 5 points: 1 student. 4 points: 1 student. 3 points: 1 student.