poj1207
来源:互联网 发布:八一农垦大学 知乎 编辑:程序博客网 时间:2024/04/29 22:01
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:
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 before the 1 is printed. 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 n2. print n3. if n = 1 then STOP4. if n is odd then n <-- 3n+15. else n <-- n/26. 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 before the 1 is printed. 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 10,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 should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j.
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
Hint
Source
Duke Internet Programming Contest 1990,uva 100
#include<stdio.h>int main(){int i,j,m,n,max,k,t;while(scanf("%d%d",&m,&n)!=EOF){t=0;max=0;if(m>n)//因为是两个数之间所以要判断两个数大小{t=m;m=n;n=t;}for(i=m;i<=n;i++){j=i;k=0;while(j!=1){k++;if(j%2==0){j=j/2;}else{j=j*3+1;}}max=max>k?max:k;}if(t==0)//t用来测试是否为从小到大的顺序输入的两个数。t=0则是,否则不是printf("%d %d %d\n",m,n,max+1);elseprintf("%d %d %d\n",n,m,max+1);}return 0;}
0 0
- POJ1207
- poj1207
- poj1207
- POJ1207
- POJ1207
- poj1207
- poj1207
- poj1207
- poj1207
- poj1207
- poj1207
- POJ1207 水题
- POJ1207解题报告
- POJ1207解题报告
- POJ1207解题报告 Java
- UVA 100(即POJ1207)
- poj1207~递归和打表
- poj1207(3n+1)
- 《python核心编程》
- github免费空间玩法
- 增删该优化+按编号姓名查找
- tjut 1166
- 【web开发】导出到Excel表格
- poj1207
- 什么是CGI、FastCGI、PHP-CGI、PHP-FPM、Spawn-FCGI?
- c++部分语法知识
- 数组 shift();slice();splice();indexof();lastIndexof();
- Java注解入门介绍
- HDU 5804 Price List
- 对中国安防芯片市场的学习和机会思考
- Mac小常识
- C语言程序设计谭浩强版 十 一