I - The 3n + 1 problem(2.4.2)
Crawling in process...
Crawling failed
Time Limit:1000MS
Memory Limit:10000KB 64bit IO Format:%I64d & %I64u
Description
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
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
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
题目大意:给出两个数求在两个数之间的有最大循环长度的数,最大循环长度利用题目所给的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;
}
最新文章
- bug__android studio 出现布局文件不提示,且点击代码不能跟踪代码
- HDU 5925 Coconuts
- sass&;compass&;grunt
- CSS样式设置记录
- 你足够了解Context吗?
- iOS开发——数据持久化&;本地数据的存储(使用NSCoder将对象保存到.plist文件)
- [转]33 useful Keyboard Shortcuts for Run commond
- java异常类的使用
- iOS - Blocks
- Bootstrap 静态分页 和 jquery_pagination插件 动态分页
- Linux内核的同步机制---自旋锁
- SOA的企业系统架构
- python面对对象编程中会用到的装饰器
- css三种样式表写法
- bootstrap之css样式
- Hibernate5总结
- 表单验证—js循环所有表单验证
- File I/O的总结
- opengl键盘回调函数不能获取Ctrl+c的问题
- 悟道—位IT高管20年的职场心经(读书笔记三)