hdu1032 The3n+1problem

#include <iostream>
using namespace std;
int Function(int x,int nums)
{
if(x == 1)return nums;
if(x % 2 == 1)
{
Function(3*x + 1,nums+1);
}
else
{
Function(x / 2,nums+1);
}

}
int main()
{
int i,j,b = 0,m,k = 0,max;
while(cin>>i>>j)
{
if(i > j)
{
m = i;
i = j;
j = m;
b = 1;
}
for(int p = i; p <= j; p++)
{
max = Function(p,1);
if( max > k)
{
k = max;
}
}
if(b == 1)
{
m = i;
i = j;
j = m;
b = 0;
}


cout<<i<<" "<<j<<" "<<k<<endl;
k = 0;
}
return 0;
}