hdu1032 3n+1 Problem
来源:互联网 发布:索尼xperiaz1手机网络 编辑:程序博客网 时间:2024/06/05 00:38
The 3n + 1 problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22827 Accepted Submission(s): 8537
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<stdio.h>#include<math.h>int fun(int x){int s=1;while(x!=1){if(x%2==1) x=3*x+1;else x=x/2;s++;}return s;}int main(){int a,b,i,t,sum;while(scanf("%d%d",&a,&b)!=EOF){sum=0;printf("%d %d ",a,b);if(a>b){t=a;a=b;b=t;}for(i=a;i<=b;i++){if(sum<fun(i)) sum=fun(i);}printf("%d\n",sum);/*printf("%d %d %d\n",a,b,sum); */}return 0;}
0 0
- hdu1032 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(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 The 3n + 1 problem循环次数
- HDU1032-The 3n + 1 problem-水题压惊
- HDU1032——The 3n + 1 problem
- HDU1032:The 3n + 1 problem(比较运算次数)
- XML序列化
- 针对SVG的性能优化
- 逻辑回归不错的文章
- AT&T/UNIX 与Intel 汇编语法区别
- jsp中session的判断用户是否登陆问题?
- hdu1032 3n+1 Problem
- HDU 5074 Hatsune Miku
- SIM900A基站定位调试笔记
- Ubuntu Linux平台下Django1.6.8开发环境搭建
- 特征生成
- jdk的设置及安装android studio提示does not point to a valid jvm问题
- JProfiler 解决 Java 服务器的性能跟踪
- C#遍历设置计算机分辨率
- hdu 4542 打表+含k个约数最小数