POJ1207 The 3n + 1 problem
来源:互联网 发布:linux ChrootDirectory 编辑:程序博客网 时间:2024/05/17 22:44
这题不是很难,模拟一下即可,但有一些细节需要注意
输入的数不一定升序,且要按原顺序输出,还有就是读完数据的问题
The 3n + 1 problem
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 53006 Accepted: 16841
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 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 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
Source
Duke Internet Programming Contest 1990,uva 100
//oimonster#include<cstdio>#include<cstdlib>#include<iostream>using namespace std;int count(int i) { int s=1; while(i!=1) { if(i%2) i=3*i+1; else i/=2; s++; } return s; } int main(){ int i,j,n,max,k,t,ii,jj; while(scanf("%d%d",&i,&j)!=EOF){ ii=i; jj=j; if(i>j){ t=i; i=j; j=t; } max=0; for(n=i;n<=j;n++){ k=count(n); if(k>max)max=k; } printf("%d %d %d\n",ii,jj,max); } return 0;}
0 0
- poj1207(The 3n + 1 problem)
- poj1207--The 3n + 1 problem
- 【模拟】poj1207 The 3n + 1 problem
- POJ1207 The 3n + 1 problem
- poj1207 The 3n + 1 problem
- poj1207-The 3n + 1 problem
- poj1207 The 3n + 1 problem
- poj1207——The 3n + 1 problem
- POJ1207,The 3n + 1 problem,水输出要注意...
- Poj1207 The 3n + 1 problem(水题(数据)+陷阱)
- poj1207-the 3n+1 problems
- 北大暑假训练计划—POJ1207 The 3n + 1 problem(C语言)
- poj1207(3n+1)
- The 3n + 1 problem
- The 3n+1 Problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- sprintf学习总结
- ListView 与ContextMenu的关联管理
- PAT-1007. Maximum Subsequence Sum (25)
- C与OC、C++的区别
- ZOJ-2274(最大公约数 + 枚举)
- POJ1207 The 3n + 1 problem
- Eclipse开发Android关闭logcat的自动滚动
- 不破不立
- python调用c库的方式
- 猴子摘桃的问题处理
- CString与char之间转换
- 最大子列和问题
- HDU2144Evolution(并查集+暴力或LCS)
- HDU - 1248 - 寒冰王座 (完全背包 or 贪心)