Number Sequence


		 
Given a positive integer number, we want to generate a number sequence with the following rules:
If the current number is 1, the process will be terminated. Otherwise, if the current number is even, the next number will be n/2. If the current number is odd (except 1), the next number will be 3*n+1. Then we turn to deal with the new number, until we get 1.
For example, given the first number 22, we will get {22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1}. The length of this sequence is 16.
Given the first number, your task is to find the length of the sequence generated with these rules. We assume that the length will not be more than 1000.
Input
There is only one number N (1 ≤ N ≤ 1000) for each test case, indicating the first number of the sequence.
The input is terminated by a zero.
Output
Output one number in a line for each test case, indicating the length of the sequence we generate.
Sample Input
22
1000
1
0
Sample Output
16
112
1 
 
题意概述：按照给定规则产生数字串，直到产生1时终止。水题。。
 
解题思路：没有什么简单的思路，只能按照给定规则穷举。
 
源代码：
 
#include<iostream>
using namespace std;
int main()
{
    int N,L;
    while(cin>>N&&N)
    {
          L=1;
          while(N>1)
          {
               if(N%2==0)N/=2;
               else N=N*3+1;
               ++L;
          }
          cout<<L<<endl;
    }
    return 0;
}

补充：综合编程 , 其他综合 ,