Recursive Integer Division

# Include <stdio. h> </P> <p> int A [11], in, now; </P> <p> void F (int n, int M, int K) <br/> {<br/> int I, sum = 0; <br/> If (n = 1 | M = 1) <br/> {<br/> for (I = 0; I <n; I ++) <br/> A [k ++] = 1; <br/> for (I = 0; I <K; I ++) <br/> sum + = A [I]; <br/> if (a [0] = now-1) <br/> {<br/> now-= 1; <br/> printf ("/N"); <br/>}< br/> for (I = 0; I <K-1; I ++) <br/> printf ("% d +", a [I]); <br/> printf ("% d", a [k-1]); <br/> If (in-A [0] + 1 )! = K) <br/> printf (","); <br/> return; <br/>}< br/> else if (n <m) <br/>{< br/> F (n, n, k); <br/>}< br/> else if (n = m) <br/> {<br/> A [k] = N; <br/> for (I = 0; I <= K; I ++) <br/> sum + = A [I]; <br/> If (sum = in) <br/>{< br/> if (a [0] = now-1) <br/>{< br/> now-= 1; <br/> printf ("/N"); <br/>}< br/> for (I = 0; I <K; I ++) <br/> printf ("% d +", a [I]); <br/> printf ("% d", a [k]); <br/> If (in-A [0])! = K) <br/> printf (","); <br/>}< br/> F (n, n-1, k ); <br/>}< br/> else <br/> {<br/> A [k] = m; <br/> F (n-M, m, k + 1); <br/> F (m-1, k); <br/>}</P> <p> void main () <br/>{< br/> while (scanf ("% d", & in) <br/>{< br/> now = in; <br/> F (In, in, 0); <br/> printf ("/N"); <br/>}< br/>

 

Partial results:

 

6 <br/> 6 <br/> 5 + 1 <br/> 4 + 2, 4 + 1 + 1 <br/> 3 + 3 + 3 + 2 + 1 + 1 + 1 + 1 <br/> 2 + 2 + 2 + 2 + 1 + 1 + 1 + 1 + 1 + 1 + 1 <br/> 1 + 1 + 1 + 1 + 1 + 1 <br/> 7 <br/> 7 <br/> 6 + 1 <br/> 5 + + 1 + 1 <br/> 4 + + 2 + + 1 + 1 + 1 <br/> 3 + 3 + 1 + 1 + 2 + 2 + 2 + 2 + 1 + 1 + 1 + 1 <br/> 2 + 2 + 2 + 1, 2 + 2 + 1 + 1 + 1 + 1 + 1 + 1 + 1 <br/> 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 <br/> 8 <br/> 8 <br/> 7 + 1 <br/> 6 + + 1 + 1 <br/> 5 + 3, 5 + 2 + + 1 + 1 + 1 + 1 <br/> 4 + + 3 + + 2 + 2, 4 + 2 + 1 + + 1 + 1 + 1 + 1 <br/> 3 + 3 + 2 + 3 + 1 + + 2 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 <br/> 2 + 2 + 2 + 2, 2 + 2 + 2 + 1 + 1 + 2 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 <br/> 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 <br/> 9 <br/> 9 <br/> 8 + 1 <br/> 7 + 2, 7 + 1 + 1 <br /> 6 + + 2 + + 1 + 1 + 1 <br/> 5 + + 3 + + 2 + + 2 + 2 + 1 + + 1 + 1 + 1 + 1 + 1 + 1 <br/> 4 + 4 + + 3 + 2, 4 + 3 + 1 + 1 + + 2 + + 2 + 1 + 1 + + 1 + 1 + 1 + 1 + 1 <br/> 3 + 3 + 3 + 3 + 3 + 2 + 1 + 3 + 3 + 3 + 3 + 3 + 3 + 3 + 3 + 1 + 1 + 3 + 2 + 2 + 2 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 <br/> 2 + 2 + 2 + 1 + 1 + 2 + 2 + 1 + 1 + 1 + 1 + 2 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 <br/> 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 <br/>