PKU 1207 The 3n + 1 problem
2013-07-11 16:25
316 查看
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
题目很简单,但一定要注意到输入的两个数有可能前面的数比后面的数大,这里是细节,如果大了,则要换一下,输出的时候又要换回来。
#include<iostream>
using namespace std;
int main(void)
{
int a,b;
int t;
int flag=0;
while(cin>>a>>b)
{
if(a>b)
{
int temp=a;
a=b;
b=temp;
flag=1;
}
int max=0;
for(int i=a; i<=b; i++)
{
t=i;
int ans=1;
while(t>1)
{
if(t%2==0)
{
t/=2;
}
else
{
t=3*t+1;
}
ans=ans+1;
}
if(ans>max)
{
max=ans;
}
}
if(flag==1)
{
cout<<b<<" "<<a<<" "<<max<<endl;
}
else
{
cout<<a<<" "<<b<<" "<<max<<endl;
}
}
return 0;
}
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 46860 | Accepted: 14769 |
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
题目很简单,但一定要注意到输入的两个数有可能前面的数比后面的数大,这里是细节,如果大了,则要换一下,输出的时候又要换回来。
#include<iostream>
using namespace std;
int main(void)
{
int a,b;
int t;
int flag=0;
while(cin>>a>>b)
{
if(a>b)
{
int temp=a;
a=b;
b=temp;
flag=1;
}
int max=0;
for(int i=a; i<=b; i++)
{
t=i;
int ans=1;
while(t>1)
{
if(t%2==0)
{
t/=2;
}
else
{
t=3*t+1;
}
ans=ans+1;
}
if(ans>max)
{
max=ans;
}
}
if(flag==1)
{
cout<<b<<" "<<a<<" "<<max<<endl;
}
else
{
cout<<a<<" "<<b<<" "<<max<<endl;
}
}
return 0;
}
相关文章推荐
- PKU 1207 The 3n + 1 problem
- pku 1207 The 3n + 1 problem
- The 3n + 1 problem(PKU 1207)
- POJ 1207 The 3n + 1 problem
- poj1207——The 3n + 1 problem
- POJ 1207 The 3n + 1 problem
- UVa 100 / HDU 1032 / POJ 1207 The 3n + 1 problem (数论&Collatz序列周期)
- Pku oj 1207 The 3n + 1 problem(模拟)
- 北大ACM 1207 The 3n + 1 problem
- poj 1207 The 3n + 1 problem
- poj 1207 The 3n + 1 problem -- 模拟
- poj 1207 The 3n + 1 problem 解题报告
- POJ 1207 The 3n + 1 problem
- POJ1207,The 3n + 1 problem,水输出要注意...
- POJ1207-The 3n + 1 problem
- POJ 1207 The 3n + 1 problem (数学)
- POJ 1207 The 3n + 1 problem
- (简单模拟2.4.2)POJ 1207 The 3n + 1 problem(直叙式模拟——输入时前一个数可能比后一个数要大,但输出时原样输出)
- HDOJ 1032(POJ 1207) The 3n + 1 problem
- POJ 1207 The 3n + 1 problem(水题)