The 3n + 1 problem （C语言代码）不知道为什么超时，求解释！！

#include<stdio.h>
#include"math.h"
int main()
{
    long i,j,k,temp;
    int count,max;
    while(scanf("%ld%ld",&i,&j)!=EOF)
    {
       max=0;
       if(i>0&&i<pow(10,6)&&j>0&&j<pow(10,6))
       {
          for(k=i;k<=j;k++)
          {
              temp=k;
              count=1;
              if(temp>1)
              {
              while(temp!=1)
              {
               if(temp%2==0) {temp/=2;count++;}
               if(temp%2==1) {temp=temp*3+1;count++;}
              }
              count++;
              }
              if(count>max) max=count;
          }
          printf("%ld %ld %d\n",i,j,max);
        }
     }
    return 0;
}