The 3N + 1 problem (PKU 1207)

/* Question 3: The 3N + 1 problem (PKU 1207)
* Author: Guo fengzai
*/
# Include <cstdio>
Using namespace STD;
Int main (){
Int X, Y;

While (scanf ("% d", & X, & Y )! = EOF ){
// While (CIN> x> Y ){
Int X1 = x, Y1 = y;
Int maxlength = 1; // maximum cycle length.
If (x1> Y1) {// The input may be large to small, but the order cannot be changed during output. Therefore, two alternative variables are declared.
Int T = x1;
X1 = Y1;
Y1 = T;
}
For (INT I = x1; I <= Y1; ++ I ){
Int temp = I;
Int length = 1; // The cycle length of each integer.
While (temp! = 1 ){
If (TEMP % 2 = 1 ){
Temp = 3 * temp + 1;
} Else {
Temp = temp/2;
}
++ Length;
}
Maxlength = maxlength> length? Maxlength: length; // store large objects in maxlength.
}

// Cout <x <"<Y <" "<maxlength <Endl;
Printf ("% d/N", X, Y, maxlength );
}
Return 0;
}