The 3n + 1 problem POJ 1207
来源:互联网 发布:淘宝客推广如何收费 编辑:程序博客网 时间:2024/06/11 04:17
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<algorithm>#include<cstdio>#include<cstring>using namespace std;int main(){ int n,m; while(~scanf("%d%d",&n,&m)) { int k=n,k1=m,p=0,sum; if(n>m) swap(n,m);//没说那个大那个小。 for(int i=n; i<=m; i++) { int l=i; sum=1; while(l!=1) { if(l%2==0) { l=l/2; } else { l=3*l+1; } sum++; } if(p<sum)p=sum; } printf("%d %d %d\n",k,k1,p); } 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
- 十招教你从屌丝变身高富帅
- HDOJ 湫湫系列故事——减肥记I(完全背包)
- jquery入门
- mybatis
- 获取n个月后的日期
- The 3n + 1 problem POJ 1207
- Android导入已有的SQLite数据库
- List<T>排序
- 转帖:深入理解JavaScript系列
- 转帖:《EnterLib PIAB深入剖析》系列博文汇总
- Entity Framework 5.0系列之Code First数据库迁移
- Entity Framework 5.0系列之自动生成Code First代码
- Entity Framework 5.0系列之约定配置
- Entity Framework 5.0系列之数据操作