The 3n + 1 problem
题目描述
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 is unknown whether this conjecture is true. It has been verified, however, for all integers n such that 0 < n < 1,000,000 (and, in fact, for many more numbers than this.)
Given 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.
For any two numbers i and j you are to determine the maximum cycle length over all numbers between i and j.
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.
You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j.
You can assume that no opperation overflows a 32-bit integer.
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.
You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j.
You can assume that no opperation overflows a 32-bit integer.
Output
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).
Sample Input
1 10
100 200
201 210
900 1000
Sample Output
1 10 20
100 200 125
201 210 89
900 1000 174
思路:
题意:给定一种操作,对于数x,先输出x,如果x为奇数,则x=3*x+1,并输出;如果x为偶数,则x=x/2,并输出……直到输出的数为1时停止,并统计输出数子的个数,记为n;
现在给定两个数x,y,计算范围在x和y之间所有数的n值,记最大的n值为maxn,最后按照输入的x,y以及maxn的顺序输出。
坑:
输入的x和y的相对大小未确定,所以在确定循环范围的时候要注意;
最后输出要按输入的x,y的顺序输出,所以最好开始就记录下输入的x,y值;
给的数据范围比较大,解决的算法时间复杂度是N^2,测例给的数如果较大,那就很不友好了,绝对的超时!
代码
#include <stdio.h>
int x,y;
int func(int x)
{
int num=1;
while(x!=1){
if(x%2==0)
x=x/2;
else x=x*3+1;
num++;
}
return num;
}
int main()
{
while(scanf("%d%d",&x,&y)!=EOF){
int i;
int n;
int s,e;
int maxn=0;
if(x>=y){
s=y;
e=x;
}
else {
s=x;
e=y;
}
for(i=s;i<=e;i++){
n=func(i);
if(n>=maxn)
maxn=n;
}
printf("%d %d %d\n",x,y,maxn);
}
return 0;
}