The 3n + 1 problem
来源:互联网 发布:怎样开发app软件 编辑:程序博客网 时间:2024/06/03 06:01
Description
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.
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.
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 10100 200201 210900 1000
Sample Output
1 10 20100 200 125201 210 89900 1000 174
#include<iostream>#include<cstdio>#include<cstring>#include<vector>using namespace std;int p,q;//p开始q结束int steps[100005];int step(int n){int all=1;while(1){if(n==1)return all;elseif(n<100001&&steps[n]){return steps[n]+all-1;}else if(n&1){n=n*3+1;all++;}else{n=n>>1;all++;}}}int main(){memset(steps,0,sizeof(steps));for(int i=1;i<100001;i++){if(!steps[i])steps[i]=step(i);}while(scanf("%d%d",&p,&q)!=EOF){bool flag=true;if(p>q){flag=false;int n;n=p;p=q;q=n;}int max=0;for(int i=q;i>=p;i--){steps[i]=step(i);if(max<steps[i])max=steps[i];}if(flag)cout<<p<<' '<<q<<' '<<max<<endl;elsecout<<q<<' '<<p<<' '<<max<<endl;}}
注意: 原题一定细看,要按原来的顺序输出,而不是从小到大的顺序,固有思维根深蒂固。
0 0
- The 3n + 1 problem
- The 3n+1 Problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 Problem
- The 3n + 1 problem
- 随记
- 小谈变量的作用域
- 第三周Android的学习笔记
- 机器学习笔记
- 软硬件调试九法:第三条规则 不要想而要看
- The 3n + 1 problem
- 为啥公司愿花更多钱从外面招人
- 微软Hololens应用及开发——HoloLens介绍篇(一)全息图介绍
- 275. H-Index II
- Mac 校园网有线网络配置
- Mac上安装spark过程
- Python 进阶—— list 的头插和尾插
- 修改Tomcat的端口号
- Javascript:谈谈JS的全局变量跟局部变量