HDU 1032 The 3n + 1 problem
来源:互联网 发布:电脑绘画软件哪个好 编辑:程序博客网 时间:2024/05/16 05:54
The 3n + 1 problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13649 Accepted Submission(s): 5010
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
Source
UVA
Recommend
mcqsmall
分析:找到i,j之间的符合上述做法的拥有最大循环数的数字,并输出循环数
代码:
#include<stdio.h>int solve(int n){ int count=0; while(1) { if(n==1) return count+1; else if(n%2==0) n=n/2; else n=3*n+1; count++; }}int main(){ int i,j,k; while(scanf("%d%d",&i,&j)!=EOF) { int max=0,flag=0; if(i>j) { int temp=i; i=j; j=temp; flag=1; } for(k=i;k<=j;k++) { if(solve(k)>max) max=solve(k); } if(flag==0) printf("%d %d %d\n",i,j,max); else printf("%d %d %d\n",j,i,max); } return 0;}
- hdu 1032 The 3n + 1 problem
- hdu 1032 The 3n + 1 problem
- HDU 1032 The 3n + 1 problem
- hdu 1032 The 3n + 1 problem
- HDU 1032 The 3n + 1 problem
- hdu 1032 The 3n + 1 problem
- HDU 1032 The 3n + 1 problem
- hdu 1032 The 3n + 1 problem
- HDU 1032 The 3n + 1 problem
- hdu-1032-The 3n + 1 problem
- hdu 1032 The 3n + 1 problem
- hdu 1032 The 3n + 1 problem
- hdu 1032 The 3n + 1 problem
- HDU 1032 The 3n + 1 problem
- HDU 1032 The 3n + 1 problem
- hdu 1032 The 3n + 1 problem
- hdu 1032 The 3n + 1 problem
- HDU 1032 The 3n + 1 problem
- 成员函数指针与回调函数
- Mac开发相关
- 两种实现Toast 的例子(图片&文字)
- Windows CE和Windows XP Embedded比较
- Centos下安装设置PPTP
- HDU 1032 The 3n + 1 problem
- Android中Toast的用法简介(转)
- for循环下的scanf("%s%c")问题
- QQ视频聊天时可以给对方加特效恶搞对方的软件--- 变色鸟摄像头视频特效
- hdu4405 Aeroplane chess 期望
- 如何在ecshop中实现后台商品列表显示会员等级价格的解决办法
- Java IO(文件操作工具类)
- linux下补丁的创建及使用原理
- 破解学习笔记-----获取按钮事件地址---追出注册吗----编写内存注册机