杭电1032——The 3n + 1 problem(简单题)
2015-11-08 11:47
417 查看
问题描述
Problem DescriptionProblems 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.
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.
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 10
100 200
201 210
900 1000
Sample Output
1 10 20
100 200 125
201 210 89
900 1000 174
问题分析
该题比较简单,求最大值,一个个枚举既可。注意输入i ,j,有可能是i>j。还有就是输出的i,j要和输入的i,j 顺序一致,不能倒过来~~AC代码
# include<stdio.h> int main() { int a,b,max; while(scanf("%d%d",&a,&b)!=EOF) { int m1,m2; if(a>b) {m1=b;m2=a;} else {m1=a;m2=b;} int i,j,count; max=0; for(i=m1;i<=m2;i++) { count=0; int n=i; while(1) { if(n==1) { count++; break; } else if(n%2==1) { //如果n为奇数,3n+1必定为偶数,接下来肯定就是(3n+1)/2 n=(int)(1.5*n+0.5); count=count+2; } else if(n%2==0) { n=n/2; count++; } } if(count>max) max=count; } printf("%d %d %d\n",a,b,max); } return 0; }
相关文章推荐
- windows共享文件夹给centOS
- 图片加载到内存、原图实现画画、扒衣服
- 递归和迭代算法深入分析(入门篇)
- 淘宝开源项目
- 最长递增子序列详解(longest increasing subsequence)
- 第18章 堆
- Java集合类
- 数据结构实验之二叉树五:层序遍历
- 典型用户故事
- UIImage拉伸显示
- iptables详解
- 大道至简-第六章-心得体会
- SQL Server 2008 允许远程连接的配置
- 对android消息机制的总结
- Hive入门学习之三:Hive客户端的连接
- 安卓适配器的简单介绍
- javascript中var的作用
- linux下搭建SVN服务器完全手册
- JAVA中的Final关键字的使用
- php实现处理输入转义字符的代码