The 3n + 1 problem
来源:互联网 发布:ubuntu 搜狗打字 编辑:程序博客网 时间:2024/06/06 04:30
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输入的要比较大小,输出时按输入输.用scanf和printf。容易超时#include<iostream>#include<algorithm>using namespace std;int main(){int a1,a2,i,p,b1,b2;while(scanf("%d %d",&b1,&b2)!=EOF){if(b1<b2) { a1=b1,a2=b2; } else { a1=b2,a2=b1; }int max=0,a;for(i=a1;i<=a2;i++){a=0;p=i;while(p!=1){if(p%2==0)p=p/2;else p=3*p+1;a++;}if(a>max)max=a;} printf("%d %d %d\n",b1,b2,max+1);}return 0;}
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
- Mysql数据库相关问题
- 在程序中调用bat文件
- 数字三角形
- [JAVA]比毫秒System.currentTimeMillis()更精确的时间戳(纳米级时间戳)
- 微信内置浏览器的JsAPI(WeixinJSBridge续)
- The 3n + 1 problem
- 让QToolBar工具栏的按钮既显示图标又显示文字
- VC基于MSCOMM控件串口通讯
- Visual Prolog 的 Web 专家系统 (7)
- MySQL修改某列默认值
- Storm入门教程 第五章 一致性事务
- Hive安装、配置及基本测试
- linux常用命令
- 【Leetcode长征系列】Best Time to Buy and Sell Stock II