杭电1032
来源:互联网 发布:淘宝模特培训 编辑:程序博客网 时间:2024/05/29 14:43
The 3n + 1 problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18197 Accepted Submission(s): 6721
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
#include <iostream>using namespace std ;inline bool isOdd(int n){if ( n & 0x01) return true ;return false ;}int cycleLen(int n){int ret = 0 ;while (1) {ret ++ ;if (n == 1) break ;if (isOdd(n)) n = ( n << 1 ) + n + 1 ;else n >>= 1 ;}return ret ;}int cycleLen(int m, int n){int i = m; int j = n;if ( m > n){i = n; j = m ;}int ret = 0 ;for (int p = i; p <= j; ++ p){int tmp = cycleLen(p) ;if (ret < tmp)ret = tmp ;}return ret ;}int main(int argc, char ** argv){int test1, test2 ; while(cin >> test1 >> test2)cout <<test1 << " " << test2 << " "<< cycleLen(test1, test2) << endl;return 0 ;}
- 杭电1032
- 杭电1032题
- 杭电1032
- 杭电1032
- 杭电1032题
- 杭电1032
- 杭电
- 杭电
- 杭电
- 杭电1032 --3n+1
- 杭电 1032【一种规律运算】
- 杭电 1234 和 杭电 2115
- 杭电2056之Rectangles 杭电
- 杭电ACM1061Rightmost Digit
- 杭电2099 7.11
- 杭电ACM 1003
- 杭电 ACM 2016
- 杭电ACM1466
- 南阳OJ76
- .net技术类面试、笔试题汇总1
- jsp 标签库使用小结 JSTL EL表达式 JSP的标签分类
- IOS详解TableView——静态表格使用以及控制器间通讯
- win7下搭建apache+mysql+php服务器
- 杭电1032
- gdb和g++的简单使用
- IOS比Android用户体验好的原因
- base64
- 【stagefrightplayer】5 音频输出AudioPlayer介绍
- 类的四种默认函数
- 观察者模式(一)
- Spring注解的使用和区别:@Component、@Service、@Repository、@Controller
- NSString字符串的实际应用