PAT (Basic level) 1001 3n+1 conjecture (15)

Karaz (Callatz) conjecture:

For any natural number n, if it is even, cut it in half, and if it is odd, cut it off by half (3n+1). This has been repeatedly cut down, and finally must be in a certain step to get n=1. Karaz at the 1950 World Mathematicians conference published this conjecture, the legend of Yale University teachers and students to mobilize, desperately want to prove this seemingly silly very naïve proposition, the result of students do not want to study, the only card (3n+1), so that some people say this is a conspiracy, Karaz is deliberately delaying the progress of teaching and research in the American mathematical world ...

Our topic today is not to prove Karaz conjecture, but to give no more than 1000 positive integers n, simply to count, how many steps (a few cuts) are needed to get n=1?

input Format: each test input contains 1 test cases, which gives the value of the natural number N.

output format: outputs the number of steps required to calculate from N to 1.

Input Sample:

3

Sample output:

5

My Code:

#include <iostream>using namespacestd;intMain () {intnum,ways=0; CIN>>num;  while(1){    if(num%2==0) {num=num/2; Ways++; }Else if(num==1) {cout<<ways;  Break; }    Else{num=(3*num+1)/2; Ways++; }    }

}

PAT (Basic level) 1001 3n+1 conjecture (15)