C语言基础-3N+1问题！！

输入将由一系列整数i和j组成，每行一对整数。
处理所有整数对，并为每对确定i和j之间的所有整数的最大周期长度
对于每对输入整数i和j，应输出i、j以及i和j之间的整数的最大周期长度。这三个数字 应至少用一个空格分隔，其中所有三个数字在一行上，每行输入输出一行。整数i和j必 须以它们在输入中出现的相同顺序出现在输出中，并应后跟最大周期长度（在同一行）

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.
Consider the following algorithm:
1. input n
2. print n
3. if n = 1 then STOP
4. if n is odd then n <-- 3n+1
5. else n <-- n/2
6. GOTO 2
Given 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

It 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 i