Print all unique solution to split number n

Print all unique solution to split number N, given choice of 1 3 5 10
For example if n is 4
{1, 1, 1, 1}
{1, 3}

Idea: You can certainly solve the problem by using DFS, but you need to traverse all possibilities and implement it by recursion after paper-cutting. The main pruning idea is that the last number must be greater than or equal to the previous number.

2. # Include <iostream>
4. # Include <vector>
6. Using namespace STD;
8. Vector <vector <int> res;
10. Vector <int> cur;
12. Void getallpath (vector <int> & base, int last, int N ){
14. If (n = 0 ){
16. Res. push_back (cur );
18. Return;
20. }
22. For (INT I = 0; I <base. Size (); I ++ ){
24. If (base [I]> N) return;
26. If (base [I] <last) continue;
28. Cur. push_back (base [I]);
30. Getallpath (base, base [I], n-base [I]);
32. Cur. pop_back ();
34. }
36. }
38. Int main (){
40. Vector <int> base (4 );
42. Base [0] = 1;
44. Base [1] = 3;
46. Base [2] = 5;
48. Base [3] = 10;
50. Getallpath (base, 0, 8 );
52. For (INT I = 0; I <res. Size (); I ++ ){
54. For (Int J = 0; j <res [I]. Size (); j ++ ){
56. Cout <res [I] [J] <"\ t ";
58. }
60. Cout <Endl;
62. }
64. Return 0;
66. }

Print all unique solution to split number n