HDOJ 1032 The 3n + 1 problem
来源:互联网 发布:nginx 获取header 编辑:程序博客网 时间:2024/06/02 07:30
The 3n + 1 problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 26578 Accepted Submission(s): 9866
Problem 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
大水题,但是实在没考虑到两个数大小的问题,错了一次,还写了一次打表的,还是错。真坑!
代码如下:
<span style="font-size:14px;">#include<stdio.h>#define num 1000010int count(int i){int time=1;while(i!=1){if(i&1) i=i*3+1;else i>>=1;time++;}return time;}int main(){int n,m,max,i,time;while(scanf("%d%d",&n,&m)!=EOF){max=0;if(n<m){for(i=n;i<=m;i++){time=count(i);if(time>max) max=time;}}else{for(i=m;i<=n;i++){time=count(i);if(time>max) max=time;}}printf("%d %d %d\n",n,m,max);}return 0;}</span>
0 0
- 【HDOJ】1032 -> The 3n + 1 problem
- hdoj 1032 The 3n + 1 problem
- HDOJ 1032 The 3n + 1 problem
- HDOJ The 3n + 1 problem 1032
- HDOJ 1032 The 3n + 1 problem
- HDOJ 1032 The 3n+1 problem
- hdoj-1032-The 3n + 1 problem
- HDOJ 1032 The 3n + 1 problem解题报告
- hdoj.1032 The 3n + 1 problem 20140726
- HDOJ 1032 The 3n + 1 problem(水)
- HDOJ 1032(POJ 1207) The 3n + 1 problem
- hdoj 1032 The 3n + 1 problem(细节细节)
- Hdoj 1032 The 3n+1 problem (看题目很重要)
- HDOJ The 3n + 1 problem(Java)
- HDOJ, 杭电1032, The 3n+1 problem. POJ, 北大OJ,1207....数学题。。又一发
- 杭电OJ(HDOJ)1032题:The 3n + 1 problem(穷举,水题)
- ACM--次数最多--HDOJ 1032--The 3n + 1 problem--水(数据太弱)
- hdu 1032 The 3n + 1 problem
- 存储过程
- Unity3D的主要类图
- 系统登录界面
- GP(Global Platform) External authentication and MAC sending APDU
- 存储过程的优缺点
- HDOJ 1032 The 3n + 1 problem
- Xcode6为什么干掉pch(Precompile Prefix Header)&如何添加pch文件
- Scala 基础
- IT技术博客
- MySQL存储过程
- UIRefreshControl:点击按钮实现下拉刷新
- 相似图片搜索原理二(phash—c++实现)
- Android开发——自动连接指定SSID的wifi热点(不加密/加密)
- 【VB.NET机房重构】外键冲突