UVA 100 The 3*n+1 problem

#include <stdio.h>
#include <stdlib.h>

void FindResult(int Min,int Max)
{
    int i,count,temp;
    temp=0;       //temp存放最大步数
    long long n;  //注意这n类型为long long型，当这为int时，计算837799溢出
    for(i=Min;i<=Max;i++)
    {
        n=i;
        count=0;
        while(1)
        {
            if(n==1)
            {
                count++;
                if(temp<count)
                {
                    temp=count;
                }
                break;
            }
            if(n%2==1)
            {
                n=3*n+1;
                count++;
            }
            else
            {
                n=n/2;
                count++;
            }
        }


    }

    printf("%d\n",temp);
}

int main()
{
    int MaxN,MinN,t;       //MinN下界，MaxN为上界。
    t=0;
    while(scanf("%d %d",&MinN,&MaxN)!=EOF)
    {
        printf("%d %d ",MinN,MaxN);
        if(MinN>MaxN)
        {
            t=MinN;
            MinN=MaxN;
            MaxN=t;

        }
        FindResult(MinN,MaxN);   //计算最大步数



    }
    return 0;
}