UVA11877 The Coco-Cola Store【模拟】

Once upon a time, there is a special coco-cola store. If you return three empty bottles to the shop, you’ll get a full bottle of coco-cola to drink. If you have n empty bottles right in your hand, how many full bottles of coco-cola can you drink?
Input
There will be at most 10 test cases, each containing a single line with an integer n (1 ≤ n ≤ 100). The input terminates with n = 0, which should not be processed.
Output
For each test case, print the number of full bottles of coco-cola that you can drink.
Spoiler
    Let me tell you how to drink 5 full bottles with 10 empty bottles: get 3 full bottles with 9 empty bottles, drink them to get 3 empty bottles, and again get a full bottle from them. Now you have 2 empty bottles. Borrow another empty bottle from the shop, then get another full bottle. Drink it, and finally return this empty bottle to the shop!
Sample Input
3
10
81
0
Sample Output
1
5
40

问题链接：UVA11877 The Coco-Cola Store
问题简述：（略）
问题分析：
    开始时给定n个空可乐瓶，每3个空瓶可以换1瓶可乐，求能换到多少瓶可乐？
    本题采用模拟法来解决，也许可以直接用数学公式来计算。需要注意的是，最后剩下2个空瓶时，可以借一个空瓶换1瓶可乐，喝完后还空瓶。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++语言程序如下：

/* UVA11877 The Coco-Cola Store */

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, ans;
    while(~scanf("%d", &n) && n) {
        ans = 0;
        while(n) {
            ans += n / 3;
            n = n % 3 + n / 3;
            if(n == 1)
                break;
            else if(n == 2) {
                ans += 1;
                break;
            }
        }

        printf("%d\n", ans);
    }

    return 0;
}