zoj 2830

Champion of the Swordsmanship Time Limit: 1 Second      Memory Limit: 32768 KB

In Zhejiang University, there is a famous BBS named Freecity. Usually we call it 88.

 

Recently some students at the Humour board on 88 create a new game - Swordsmanship. Different from the common sword fights, this game can be held with three players playing together in a match. Only one player advances from the match while the other two are eliminated. Sometimes they also hold a two-player match if needed, but they always try to hold the tournament with as less matches as possible.

Input

The input contains several test cases. Each case is specified by one positive integer n (0 < n < 1000000000), indicating the number of players. Input is terminated by n=0.

Output

For each test case, output a single line with the least number of matches needed to decide the champion.

Sample Input

3
4
0

Sample Output

1
2

#include <iostream> using namespace std; int main() { int n; while(cin>>n&&n!=0) { int t = 0; while(n>1) { if(n>3) { t += n/3; n = n/3+n%3; } else { t++; n /= 3; } } cout<<t<<endl; } return 0; }

你可能感兴趣的:(Integer,less,input,each,bbs,output)