The 3n + 1 problem

http://poj.org/problem?id=1207

此题注意比较n,m的大小，还有最后的原样输出。

#include<stdio.h>
int main()
{
    int n,m,i,j,max,t;
    while(~scanf("%d%d",&n,&m))
    {
        int n1 = n;
        int m1 = m;
        max = 0;
        if(n > m)
        {
            t = n;
            n = m;
            m = t;
        }
        for (i = n; i <= m; i ++)
        {
            int cnt = 1;
            j = i;
            while(j!=1)
            {
                if (j%2==0)
                {
                    j /= 2;
                }
                else
                {
                    j = 3*j+1;
                }
                cnt++;
            }
            if (cnt > max)
                max = cnt;
        }
        printf("%d %d %d
",n1,m1,max);
    }
    return 0;
}