11877 the Coco-cola Store

Title: 11877 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 had n empty bottles right in your hand, how many
Full bottles of Coco-cola can you drink?

input

  input terminates with n = 0, which should isn't be processed.

output
     for Each test case, print the number of bottles of Coco-cola so you can drink.
 spoiler
       let me tell-you-to-drink 5 full bottles with all 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 and 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

Ideas:

Each time the existing empty bottle n divided by 3, the quotient is the new exchange number, the remainder plus the quotient is the new empty bottle number, so loop to the new empty bottle number less than 3 o'clock jump out of the loop.

If there are two empty bottles left, you can borrow one bottle and then empty the bottle.

#include <iostream>using namespace Std;int main () {int N,i,j,x,y,sum;cin>>n;while (n!=0) {sum=0;while (n >=3) {x=n%3;y=n/3;sum=sum+y;n=y+x;} if (n==2) sum++;cout<<sum<<endl;cin>>n;} return 0;}

　　

11877 the Coco-cola Store