counting and printing partitions of 1 to n-1

[LB]

You loop n times. You increment count by 1 on each loop. Therefore, count is incremented n times... so it equals n...

[al547]

Thanks. The one where you count permutations. It works but I want to
know how to make it count 1 to n-1 without doing anything in the main

[al547]

Is that for my permutation one? Because I need 1 to n-1 so if I input 4 then the count should be 4

[LB]

I'm not sure what you're asking, could you try rephrasing?

[al547]

If you check.out the question I posted it'll be clear

[al547]

Back to partitions. After I convert the int to string where can I court my output? Can I set that last recursion call equal to a string and then cout that way?
Sorry for the typos. Had to switch to my tablet

[LB]

The code already outputs as it recurses.