Think of a discount question: One dollar a bottle of soda, two empty bottles can change a bottle of soda, ask 20 yuan can drink how many bottles of soda?

1, first summed up the algorithm:

Whether you buy a bottle of a bottle or a one-time buy, the result is the same.

A, first buy 20 bottles

B, 20 empty bottles for 10 bottles

C, 10 empty bottles for 5 bottles

D, 5 empty bottles for 2 bottles left an empty bottle

E, 2 empty bottles for 1 bottles

F, 2 empty bottles, one more bottle.

2, the implementation of the program:

int max =;
int sum = max;
int result = max;
int mode = 0;

int base_number = 2;
while (Result! = (base_number-1)) {
     mode = result% Base_number;
     Result/= Base_number;
     sum + = result;
     result + = mode;
}