http://acm.sdut.edu.cn:8080/judge/contest/view.action?cid=5#problem/K
#include<stdio.h>
int maxlength(int x)
{
int l=1;
while(x!=1)
{
if(x%2==1)
x=3*x+1;
else x/=2;
l++;
}
return l;
}
int main()
{
int n,m,t,begin,end;
int max;
while(scanf("%d%d",&m,&n)!=EOF)
{
if(m<n)
{
begin=m;
end=n;
}
else
{
begin=n;
end=m;
}
max=-1;
for(t=begin;t<=end;t++)
{
if(max<maxlength(t))
max=maxlength(t);
}
printf("%d %d %d\n",m,n,max);
}
return 0;
}