第二章 I - The 3n + 1 problem(2.4.2)
来源:互联网 发布:linux运行我的世界 编辑:程序博客网 时间:2024/06/05 01:11
这是一道很坑爹的题,一定注意输入的两个数的大小,并且不能简单的交换,因为在最后的输出的时候还需要将原来的数按照原来的顺序和大小,这就是为什么还得开辟两个值得原因
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.
Consider the following algorithm:
1. input n2. print n3. if n = 1 then STOP4. if n is odd then n <-- 3n+15. else n <-- n/26. 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.
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 10100 200201 210900 1000
Sample Output
1 10 20100 200 125201 210 89900 1000 174
#include<iostream>#include <cmath>#include <cstdio>using namespace std;int main (){ int m,n,w,mmax; while(scanf("%d%d",&m,&n)) { int x=m,y=n; if(m>n) swap(m,n); mmax=-1; for(int i=m; i<=n; i++) { int j=i; w=0; while(j>1) { j%2!=0 ? j=3*j+1 : j=j/2; w++; } w++; if(mmax<w) mmax=w; } printf("%d %d %d\n",x,y,mmax); } return 0;}
0 0
- 第二章 I - The 3n + 1 problem(2.4.2)
- I - The 3n + 1 problem(2.4.2)
- I - The 3n + 1 problem(2.4.2)
- I - The 3n + 1 problem(2.4.2)
- I - The 3n + 1 problem(2.4.2)
- 《数据结构编程实验》 2.4.2The 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
- 对CIO关心的常见云安全问题的系列解答
- WinCE5.0基础学习
- <黑马程序员>JAVA5的新特性总结
- 大数据在世界杯中的应用
- POJ 1328 Radar Installation 贪心
- 第二章 I - The 3n + 1 problem(2.4.2)
- 面向对象与爱
- vim的使用
- EHCache–分布式缓存集群环境配置
- C# SQLite开发:创建数据库和表(转载别人)
- U3D 延迟光照渲染路径的细节 Deferred Lighting Rendering Path Details
- 干撒的噶是的噶速度
- 江苏东华附近受到部分建设部分散的(代发QQ977177223)
- 感动撒感动撒干大事