The Coco-Cola Store（湖南省第六届ACM竞赛题）

最新推荐文章于 2020-09-01 07:30:00 发布

蚕豆儿

最新推荐文章于 2020-09-01 07:30:00 发布

阅读量1k

点赞数

分类专栏：其他文章标签：湖南省第六届程序设计竞赛 ACM

本文链接：https://blog.csdn.net/candouer/article/details/10982309

版权

其他专栏收录该内容

11 篇文章 0 订阅

订阅专栏

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=30851#problem/A

The Coco-Cola Store

Time Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %llu

Submit Status

Description

� 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 $\le$ n $\le$ 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.

Sample Input

Sample Output

1
5
40

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!

Problemsetter: Rujia Liu, Special Thanks: Yiming Li & Sohel Hafiz

直接暴力

AC代码：

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    int n,hg,now,i,sum;
    while(scanf("%d",&n)&&n)
    {
        sum = hg = 0;
        now = n;
        while(now>1)
        {
            hg = now/3;
            sum+=hg;
            now = now%3;
            now = now+hg;
            if(now==2)
            {
                sum++;
                now = 0;
                hg = 0;
            }
        }
        printf("%d\n",sum);
    }

    return 0;
}