I - The 3n + 1 problem(2.4.2)
来源:互联网 发布:sql必知必会 pdf 微盘 编辑:程序博客网 时间:2024/06/05 07:02
I - The 3n + 1 problem(2.4.2)
Crawling in process...Crawling failedTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uDescription
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
题目大意:给出两个数求在两个数之间的有最大循环长度的数,最大循环长度利用题目所给的3n+1解决问题的方法求出。
#include<stdio.h>#include <iostream>int arr[10001];using namespace std;int main(){ int a,b; int i; arr[1]=1; arr[2]=2; for(i=3;i<10001;i++) { long long temp=i; int cnt=0; while(1) { if(temp&(0x01)) { temp*=3; temp+=1; cnt++; } else { cnt++; temp>>=1; } if(temp<i) { arr[i]=cnt+arr[temp]; break; } } } int t; while(scanf("%d%d",&a,&b)!=EOF) { if(a>b) { t=a; a=b; b=t; } int max=0; for(i=a;i<=b;i++) { if(max<arr[i]) { max=arr[i]; } } printf("%d %d %d\n",a,b,max); } return 0;}
0 0
- I - The 3n + 1 problem(2.4.2)
- I - The 3n + 1 problem(2.4.2)
- 第二章 I - The 3n + 1 problem(2.4.2)
- I - The 3n + 1 problem(2.4.2)
- I - The 3n + 1 problem(2.4.2)
- 《数据结构编程实验》 2.4.2The 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
- LeetCode Valid Sudoku
- servlet工作原理及实例演示
- hduoj1096(A+B for Input-Output Practice (VIII))
- 去掉java反编译(JD-GUI)生成的源文件中注释
- Web开发108式
- I - The 3n + 1 problem(2.4.2)
- Linux通过该控制台的字符流 实现打印出的字符不同颜色
- Raising Modulo Numbers +快速幂取模算法
- android:clipChildren属性的分析——是否剪裁子View
- 如何优雅的研究 RGSS3 番外(一) ruby 实现的后缀自动机
- linux下搭建SVN服务器完全手册
- J - MANAGER(2.4.5)
- windows 如何查看端口占用情况
- Prim算法