{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv id\u003d\"problem-body\"\u003e \n \u003cp align\u003d\"left\"\u003e\u003cstrong\u003eBackground:\u003c/strong\u003e\u003cbr\u003e Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.\u003c/p\u003e \n \u003cp align\u003d\"left\"\u003e\u003cstrong\u003eThe Problem:\u003c/strong\u003e\u003c/p\u003e \n \u003cpre\u003eConsider the following algorithm:\n1. input n\n2. print n\n3. if n \u003d 1 then STOP\n 4. if n is odd then n \u003d 3n + 1\n 5. else n \u003d n / 2\n6. GOTO 2\u003c/pre\u003e \n \u003cp align\u003d\"left\"\u003eGiven the input 22, the following sequence of numbers will be printed 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1\u003c/p\u003e \n \u003cp align\u003d\"left\"\u003eIt is conjectured that the algorithm above will terminate (when a 1 is printed) for any integral input value. Despite the simplicity of the algorithm, it is unknown whether this conjecture is true. It has been verified, however, for all integers n such that 0 \u0026lt; n \u0026lt; 1,000,000 (and, in fact, for many more numbers than this.)\u003c/p\u003e \n \u003cp align\u003d\"left\"\u003eGiven an input n, it is possible to determine the number of numbers printed (including the 1). For a given n this is called the cycle-length of n. In the example above, the cycle length of 22 is 16.\u003c/p\u003e \n \u003cp align\u003d\"left\"\u003eFor any two numbers i and j you are to determine the maximum cycle length over all numbers between i and j.\u003c/p\u003e \n \u003cp align\u003d\"left\"\u003e\u003cstrong\u003eInput\u003c/strong\u003e\u003cbr\u003e 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.\u003c/p\u003e \n \u003cp align\u003d\"left\"\u003eYou should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j.\u003c/p\u003e \n \u003cp align\u003d\"left\"\u003eYou can assume that no operation overflows a 32-bit integer.\u003c/p\u003e \n \u003cp align\u003d\"left\"\u003e\u003cstrong\u003eOutput:\u003c/strong\u003e\u003cbr\u003e For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear in the output in the same order in which they appeared in the input and should be followed by the maximum cycle length (on the same line).\u003c/p\u003e \n \u003cpre\u003e\u003cstrong\u003eSample Input:\u003c/strong\u003e\n1 10\n100 200\n201 210\n900 1000\n\n\u003cstrong\u003eSample Output:\u003c/strong\u003e\n1 10 20\n100 200 125\n201 210 89\n900 1000 174\n\u003c/pre\u003e \n\u003c/div\u003e"}}]}