100 3n+1.cpp

UVA solutions to few selected problems

#include<iostream>
using namespace std;
int main()
{
    long i,j,max,t,l,start,end,change;
    while(cin>>i>>j)
    {               start=i;
                    end=j;
                    max=0;
                    t=1;
                    if(i>j)
                    {
                           change=i;
                           i=j;
                           j=change;
                    }
                    while(j>=i)
                    {
                            l=i;
                            t=1;
                            while(i!=1)
                            {           
                                       if(i%2==0)
                                       i=i/2;
                                       else
                                       i=3*i+1;
                                       t++;
                            }
                            if(t>max)
                            max=t;
                            l++;
                            i=l;
                    }   
                    cout<<start<<" "<<end<<" "<<max<<endl;
                    
    }
    system("pause") ;
}