fjnu 1167 The 3n + 1 problem
来源:互联网 发布:jdbc怎么连接数据库 编辑:程序博客网 时间:2024/06/05 17:50
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 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 10100 200201 210900 1000
Sample Output
1 10 20100 200 125201 210 89900 1000 174
KEY:简单题,题目看会了就会了
#include<iostream>
using namespace std;
int length(int n)
...{
int N=0;
while(n!=1)
...{
N++;
if(n%2!=0) n=3*n+1;
else n=n/2;
}
return N;
}
int maxlength(int a,int b)
...{
int l;
int MAX=0;
if(a<b)
...{
for(int i=a;i<=b;i++)
...{
l=length(i);
if(l>MAX) MAX=l;
}
}
else
...{
for(int i=b;i<=a;i++)
...{
l=length(i);
if(l>MAX) MAX=l;
}
}
return MAX;
}
int main()
...{
// freopen("fjnu_1167.in","r",stdin);
int i,j;
while(cin>>i>>j)
...{
cout<<i<<" "<<j<<" "<<maxlength(i,j)+1<<endl;
}
return 0;
}
- fjnu 1167 The 3n + 1 problem
- The 3n + 1 problem
- The 3n+1 Problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 Problem
- 从算法入手讲解如何在数据库中实现最优最简
- nginx启动脚本--
- 2008------学会拒绝
- 全能打手,首推ShellExecute
- 能让人喷饭的百度知道问答
- fjnu 1167 The 3n + 1 problem
- log4net1.2.10 在asp.net 2.0当中的使用
- onblur的死锁和解决方案
- Win2003下關於打印水晶報表沒有權限與報表按鈕不顯示的問題
- fjnu 1156 粗心的物理学家
- PhpMyadmin超重数据导入zt
- 新公司的异常回滚处理
- fjnu 1002 Factorial
- fjnu 1307 阶乘结果末尾有多少零