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.admin管理员组文章数量:1558073
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.
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 UVA
Recommend mcqsmall 分析:此题主要要注意i和j的大小问题,i可能会大于j! 参考代码: #include <iostream>
using namespace std; void swap(int& m, int& n)
{
int tmp = m;
m = n;
n = tmp;
} int calculate(int n)
{
int num = 1;
while (n != 1)
{
if (n%2==0)
n = n/2;
else
n = 3*n+1;
++num;
}
return num;
} int solve(int s, int e)
{
int res = 0, i, tmp;
if (s > e)
swap(s, e);
for (i = s; i <= e; ++i)
{
tmp = calculate(i);
if (res < tmp)
res = tmp;
}
return res;
} int main()
{
int i, j;
while (cin>>i>>j)
{
cout<< i <<" "<< j <<" "<<solve(i, j)<<endl;
} return 0;
}
本文标签: Problem
版权声明:本文标题:The 3n + 1 problem 内容由热心网友自发贡献,该文观点仅代表作者本人, 转载请联系作者并注明出处:https://m.elefans.com/dianzi/1727342827a1109614.html, 本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容,一经查实,本站将立刻删除。
发表评论