算法笔记 PAT B1001 （3n+1猜想）

# include
# include
# include  

/*这里写代码片
PAT B1001 (3N+1猜想)
*/

int main()
{
    int n=0;
    int count=0;
    scanf("%d",&n);
    while(n!=1)
    {
        if(n%2==0)
        {
            n=n/2;
            count++;
        }
        else if(n%2==1)
        {
            n=(3*n+1)/2;
            count++;
        }
    }
    printf("%d\n",count);
    return 0;
}