poj 1207 The 3n + 1 problem -- 模拟
2016-05-03 21:58
495 查看
The 3n + 1 problem
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:
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 before the 1 is printed. 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 10,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.
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
Sample Output
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 55787 | Accepted: 17774 |
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 before the 1 is printed. 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 10,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.
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 这xjb题。坑就是 输入的i,j是没有大小之分的,得判断一下他们的大小。。。。 #include <stdio.h> #include <string.h> #include <algorithm> using namespace std; int main(){ int i,n,m,ans,max; while(~scanf("%d %d",&n,&m)){ max=0; int tempn = n; int tempm = m; if(n>m){ int temp = n; n = m; m = temp; } for(i=n;i<=m;i++){ ans=1; int t=i; while(1){ if(t==1) break; if(t%2){ t=t*3+1; } else{ t=t/2; } ans++; } if(max<ans) max=ans; } printf("%d %d %d\n",tempn,tempm,max); } return 0; }
相关文章推荐
- UE4:文件读写
- Android拍照,上传,预览综合【修改】
- hdu5673 Robot 卡特兰数 / 默慈金数
- 安卓计算器
- 20159302《网络攻击与防范》第九周学习总结
- java笔记--理解java类加载器以及ClassLoader类
- PCL库文件配置那点事
- ubuntu终端自体重叠问题
- Problem G: 小数的处理
- 看了淘宝代销(分销)的结果
- 专题三1010
- AsyncTask(异步消息处理机制)
- classloader之getresource,findClass深度分析
- 第十周、第十一周学习总结
- 第十周、第十一周学习总结
- 【java】Commons.Configuration读取配置文件(xml/property)
- Problem F: 多个数的平均值【简单循环】
- 第9周项目3 人数不定的工资类
- DataRow 复制
- code1047 邮票面值设计