"Empty bottles for wine" was originally a means for businesses to make profits, and later it gradually evolved into a high-frequency test center in the national civil service examination, mainly to examine the thinking transformation of candidates. This type of question is generally not difficult. Remember the formula and then calculate the question type, and you can easily get the correct answer. Today, Fujian Civil Service Examination Network will reveal the most critical formula problem of "empty bottles for wine".

First, the formula of "empty bottle for wine"

For example: three empty bottles can be exchanged for 1 bottle of wine, and eight empty bottles (no extra empty bottles, no credit or borrowing empty bottles) can be exchanged for the most bottles of wine?

1. Take three empty bottles and directly change them into 1 bottle of wine, and drink the rest 1 bottle.

Idea: Assume that every empty bottle is fully utilized, and make up the most wine in the most possible situation. According to the above algorithm, there are still 1 empty bottles useless. Obviously, this will not reach the assumed maximum. So this answer is not the most likely number.

2. First exchange two empty bottles for 1 bottle of wine, and leave the bottles there directly after drinking. (that is, don't take the bottle away after drinking)

Idea: Because every time I change my wine, the bottle is directly there and I don't bring it back. So there are no empty bottles. Just in line with the assumption of "making full use of every empty bottle to make up the most wine". Only in this case, the wine exchanged is the assumed maximum.

To sum up, the formula of "empty bottle for wine" is obtained: b ÷ (a-1) = C.