POJ 1207 The 3n + 1 problem
来源:互联网 发布:淘宝店必须交保证金吗 编辑:程序博客网 时间:2024/06/06 19:04
The 3n + 1 problem
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 57922 Accepted: 18480
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 n2. print n3. if n = 1 then STOP4. if n is odd then n <-- 3n+15. else n <-- n/26. 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
//这道题目是按照题意给出的数的判断规则,求出给定的两个输入的整数,求两个输入整数之间最长的周期对应的数,因为题目的要求是输入两个整数之间的最大周期长度对应的数,所以要注意两个输入整数的大小,保证循环的正常进行
#include <iostream>#include <cstdio>#include <algorithm>#include <cstdio>using namespace std;int caculate(int num){int no=1;if(num==1)return no;else {while(num!=1){if(num%2==0)num/=2;elsenum=num*3+1;no++;}}return no;}int main(int argc, char const *argv[]){int m,n;while(cin>>m>>n){int tM=m,tN=n;if(m>n){int t=m;m=n;n=t;}int maxn=0;for(int i=m;i<=n;i++)maxn=max(maxn,caculate(i));cout<<tM<<" "<<tN<<" "<<maxn<<endl;}return 0;}
0 0
- poj 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
- POJ 1207 - The 3n + 1 problem
- POJ 1207 The 3n + 1 problem
- POJ 1207 The 3n + 1 problem
- The 3n+1 problem POJ 1207
- POJ 1207 The 3n + 1 problem
- POJ 1207: The 3n+1 problem
- The 3n + 1 problem(POJ--1207
- POJ-1207 The 3n + 1 problem
- The 3n + 1 problem POJ 1207
- [POJ]1207 The 3n + 1 problem
- poj-1207-The 3n + 1 problem
- POJ 1207-----the 3n + 1 problem
- poj 1207 The 3n + 1 problem
- Numpy 中数组和矩阵的基本运算
- word怎么恢复默认样式
- 思维-Gym
- POJ 1032 Parliament
- Unity重写Text
- POJ 1207 The 3n + 1 problem
- 第28课:彻底解密Spark Sort-Based Shuffle排序具体实现内幕和源码详解
- Python语言中的类型之字符串型--Python(12)
- 内核模式下的文件操作_zwcreatefile_zwopenfile_zwreadfile_zwwritefile
- ExAllocatePool函数
- [C/C++]_[初级]_[关于std::string的compare陷阱]
- Python语言中的类型之字符串操作--Python(12)
- linux svn在处理lib(二进制文件)库时会有坑
- 文法和语法和词法的解释