This is the Problem Statement:

The3n + 1 Problem

Consider the following algorithm to generate a sequence of numbers. Start with an integer n. If

n is even, divide by 2. If n is odd, multiply by 3 and add 1. Repeat this process with the new value

of n, terminating when n = 1. For example, the following sequence of numbers will be generated for

n = 22:

22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

It is conjectured (but not yet proven) that this algorithm will terminate at n = 1 for every integer n.

Still, the conjecture holds for all integers up to at least 1; 000; 000.

For an input n, the cycle-length of n is the number of numbers generated up to and including the

1. In the example above, the cycle length of 22 is 16. Given any two numbers i and j, you are to

determine the maximum cycle length over all numbers between i and j, including both endpoints.

Input

The input will consist of a series of pairs of integers i and j, one pair of integers per line. All

integers will be less than 1,000,000 and greater than 0.

Output

For each pair of input integers i and j, output i, j in the same order in which they appeared in

the input and then the maximum cycle length for integers between and including i and j. These three

numbers should be separated by one space, with all three numbers on one line and with one line of

output for each line of input.

Sample Input

1 10

100 200

201 210

900 1000

Sample Output

1 10 20

100 200 125

201 210 89

900 1000 174

I had written the following C++ code for it:

Code://110101 The 3n + 1 Problem # include <iostream> using namespace std; int main() { int i,j,k,x,n1,n,m=909,mmax; /*m= a random number that i expect will never appear in the program. just so that the program keeps repeating and exits only on <ctr+c> */ do { cin>> i>>j; n=j-i;int counter[n+1];//n is the size for this counter array if ((i<1000000) && (i>0) && (j<1000000) && (j>0)) { for (x=0;x<=n;x++) counter[x]=1; x=0; for (k=i;k<=j;k++) { n1=k; while (n1!=1) {if ((n1%2)==0) {n1= n1/2; counter[x]=counter[x]+1;} else {n1= n1*3; n1++; counter[x]=counter[x]+1;} } x++; } mmax=counter[0]; for (x=1;x<=n;x++) if (counter[x]>mmax) mmax=counter[x]; cout <<i<<" "<<j<<" "<<mmax<<"\n"; } else cout<<"invalid input!"; } while (m==909); }

I submit this code on the website which had asked for it, but it says "Wrong Answer". I am not able to find any mistake in this. Can anyone please check and let me know what my mistake is? It is not a presentation error. Thanks a lot. Would be of great help.