POJ 1027 The 3n+1 problem
2015-08-07 19:52
288 查看
The 3n + 1 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:
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.
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
Sample Output
Source
Duke Internet Programming Contest 1990,uva 100
AC代码:
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 54275 | Accepted: 17261 |
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 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.
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
Source
Duke Internet Programming Contest 1990,uva 100
AC代码:
#include <iostream> #include <cmath> #include <cstring> #include <algorithm> using namespace std; int main(){ int i,j,n,a,b,m,t; while(cin>>a>>b){ n=min(a,b); m=max(a,b); int ans=0; for(;n<=m;++n){ for(i=1,t=n;t>1;++i){ if(t%2==0)t/=2; else t=3*t+1; } ans=ans>i?ans:i; } cout<<a<<' '<<b<<' '; cout<<ans<<'\12'; } return 0; }
相关文章推荐
- hihoCoder 1141 二分·归并排序之逆序对
- bdyyservice.exe 系统错误
- POJ3122-Pie 解题心得
- hdu 5363 Key Set
- Contest 6 1008 Hiking【贪心+优先队列】
- jQuery 学习笔记二
- 由“stay hungry,stay foolish”所引发出的内心激荡
- Oracle经典查询练手第二篇
- iOS UItextView针对删除表情特殊字符串处理
- Ubuntu 14.10 下开机不进入图形化界面
- nodejs配置与入门
- 2015届华为校园招聘机试题 (java实现)
- [暴力搜索] poj 3187 Backward Digit Sums
- 机房收费系统—注册 实时错误“-2147217873(80040e2f)”
- Codeforces Round #274 (Div. 2)E. Riding in a Lift
- UVA-1068 Sum-1-N之间所有数的和
- 使用Material Design 应用主题
- POJ 2000 Gold Coins 简单模拟
- POJ-3299 Humidex-湿度温度露点
- DOM文档对象的简单介绍