Recursive Algorithms for bottle problems. (Reminds me of BaO Qian a while ago -_-!)

Forum address: http://topic.csdn.net/u/20081214/00/5285a066-d37b-455f-a3be-4bb15aeda0ef.html? Seed = 290962744

 

The scenario is: one yuan a bottle of soda, two empty bottles can change one bottle of soda.
If you have X yuan, you can drink y bottles of soda, which is represented by Y = f (x ).

If n empty bottles are used for another empty bottle, y = f (x, n) indicates

 

My code, if it is 2 for 1:

 

1. Package lihan;
3. Public class test {
5. Public static integer digui (int x)
6. {
7. If (x = 1)
8. {
9. Return X;
10. }
11. If (X % 2 = 1)
12. Return x + digui (X/2) + 1;
13. Else
14. Return x + digui (X/2 );
15. }
17. /**
18. * @ Param ARGs
19. */
20. Public static void main (string [] ARGs ){
21. // Todo automatically generates method stubs
22. Int I = digui (11 );
23. System. Out. Print (I );
25. }
27. }

If n is used for 1, then

 

1. Public class lihan {
3. Public static integer digui (int x, int N)
4. {
5. If (x = 1)
6. {
7. Return X;
8. }
9. If (X % N = (n-1 ))
10. Return x + digui (x/n, n) + 1;
11. Else
12. Return x + digui (x/N, N );
13. }
15. /**
16. * @ Param ARGs
17. */
18. Public static void main (string [] ARGs ){
19. // Todo automatically generates method stubs
20. Int I = digui (12, 3) + 1;
21. System. Out. Print (I );
23. }
25. }