【ACM Steps】 The 3n + 1 problem
来源:互联网 发布:check it 编辑:程序博客网 时间:2024/06/05 01:13
The 3n + 1 problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 676 Accepted Submission(s): 312Problem 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:
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 (including the 1). 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 (including the 1). 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 1,000,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 can assume that no opperation overflows a 32-bit integer.
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 can assume that no opperation overflows a 32-bit integer.
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
这个题一直WA,一直WA,到最后才发现,原来存在a>b的情况,所以要进行判断并转换一下。
#include <iostream>using namespace std;int algo(int n){int sum=0;while(n!=1){if(n%2==0)n/=2;elsen=3*n+1;sum++;}return sum+1;}int main(){ int a,b,n,m; while(cin>>n>>m) { if(n>m) { a=m,b=n; } else { a=n,b=m; } int max=1; for(int i=a;i<=b;i++) { if(max<algo(i)) max=algo(i); } cout<<n<<" "<<m<<" "<<max<<endl; } return 0;}
- 【ACM Steps】 The 3n + 1 problem
- [ACM]The 3n + 1 problem
- 杭电ACM HDU 1032 The 3n + 1 problem
- 北大ACM 1207 The 3n + 1 problem
- 杭电 acm 1032 The 3n + 1 problem
- 【ACM Steps】N!Again
- 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
- fzu 1656 How many different numbers(线段树)
- .Net反射用到的基本方法
- ABAP 使用Smartforms发送HTML邮件
- 浅谈C#中的枚举
- Android本机调试服务器地址
- 【ACM Steps】 The 3n + 1 problem
- vs2008下编译bochs-2.4.6
- SAP 物料订单创建、下达、报工、收货与投料(ABAP代码)
- 去除Visual Studio 红色波浪线
- Servlet 线程安全
- win7新建ODBC数据源找不到驱动处理
- 自己的一些小shell脚本
- Eclipse+ZendDebugger调试PHP Web Page 无反应的解决方法
- 个人小博客