poj-1207-The 3n + 1 problem
来源:互联网 发布:ubuntu exe安装包 编辑:程序博客网 时间:2024/05/20 10:21
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 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.
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
题意不多说了。直接模拟即可。
注意a,b的大小就好了
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;int sum,num;int prin(int n){ int num=0; for(;;) { if(n==1) { num++; break; } else if(n%2==1) { n=3*n+1; num++; } else if(n%2==0) { n=n/2; num++; } } return num;}int main(){ int a,b; while(scanf("%d%d",&a,&b)!=EOF) { int x=max(a,b); int y=min(a,b); int maxx=0; sum=0; int t; for(int i=y;i<=x;i++) { sum=prin(i); if(sum>maxx) maxx=sum; } printf("%d %d %d\n",a,b,maxx); } return 0;}
0 0
- poj 1207 The 3n + 1 problem
- POJ 1207 The 3n + 1 problem
- poj 1207 The 3n + 1 problem
- POJ 1207 The 3n + 1 problem
- poj 1207 The 3n + 1 problem
- POJ 1207 - The 3n + 1 problem
- POJ 1207 The 3n + 1 problem
- POJ 1207 The 3n + 1 problem
- The 3n+1 problem POJ 1207
- POJ 1207 The 3n + 1 problem
- POJ 1207: The 3n+1 problem
- The 3n + 1 problem(POJ--1207
- POJ-1207 The 3n + 1 problem
- The 3n + 1 problem POJ 1207
- [POJ]1207 The 3n + 1 problem
- poj-1207-The 3n + 1 problem
- POJ 1207-----the 3n + 1 problem
- poj 1207 The 3n + 1 problem
- 以下介绍的三种方法属于Object
- 基础编程4-1
- Orcal数据库的表结构转换成mysql数据库的表结构
- IOS在后台每隔一段时间执行一下 资料1
- 在非主线程是否可以更新UI
- poj-1207-The 3n + 1 problem
- YK线上机器cpu、内存信息
- ZOJ 3946 Highway Project (spfa)
- http通信
- HTML基础知识总结
- KMP算法
- mySQL
- IOS在后台每隔一段时间执行一下 资料2
- 时间复杂度与空间复杂度