HDU1032:The 3n + 1 problem(比较运算次数)
来源:互联网 发布:java工程师是青春饭吗 编辑:程序博客网 时间:2024/05/16 07:05
The 3n + 1 problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35045 Accepted Submission(s): 12712
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; int main() { int a,b,t,i,max; while(cin >> a >> b) { cout << a << " " << b << " "; if(a>b) { swap(a,b); } max = 0; for(i = a; i<=b; i++) { int n = i, sum = 1; while(n-1)//等于1时就结束 { if(n%2) n = 3*n+1; else n = n/2; sum++; } if(sum>max) max = sum; } cout << max << endl; } return 0; }
0 0
- HDU1032:The 3n + 1 problem(比较运算次数)
- HDU1032 The 3n + 1 problem循环次数
- The 3n + 1 problem(HDU1032)
- HDU1032:The 3n + 1 problem
- HDU1032--The 3n + 1 problem
- HDU1032 The 3n + 1 problem
- HDU1032 The 3n + 1 problem
- HDU1032 The 3n + 1 problem(java)
- hdu1032 The 3n + 1 problem
- HDU1032&Uva100 The 3n + 1 problem
- HDU1032:The 3n + 1 problem
- HDU1032 The 3n + 1 problem
- hdu1032 The 3n + 1 problem
- hdu1032 The 3n + 1 problem
- HDU1032 - The 3n + 1 problem (暴力)
- hdu1032 3n+1 Problem
- HDU1032-The 3n + 1 problem-水题压惊
- HDU1032——The 3n + 1 problem
- 【Unity3D】本地数据加密_1
- osi七层模型,TCP/IP四层模型
- HDU 1506 Largest Rectangle in a Histogram(dp求最大子矩阵和)
- Maven Plugins
- POJ 1273&Dinic解决
- HDU1032:The 3n + 1 problem(比较运算次数)
- 遥感常用数据下载链接
- 华为2017年大牛机试题—最长回文字符串
- POJ 1703 并查集
- eclipse build path功能总结
- mysql遇到的问题总结
- 51nod 1119
- 唉,都是摄像头惹的祸 :-(
- 阅读小结:InfoGAN:Interpretable Representation Learning by Information Maximising Generative Adversarial