NYOJ 271 The 3n + 1 problem【打表法】
来源:互联网 发布:众筹网络大电影 编辑:程序博客网 时间:2024/06/04 18:27
感觉题目有些问题,红字的地方,但是感觉还是输入的数据范围更加准确一点,不然按描述上面的范围,就算打表也会超时的,还有就是这题和hdu 1032一样,令人很不爽的是在杭电 ac的代码拿到nyoj就TLE了,然后看了讨论区,果断加上打表,就过了。哎,实在受不了,至于这么难为我们吗?
The 3n + 1 problem
时间限制:1000 ms | 内存限制:65535 KB
难度:2
- 描述
- 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 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.- 输入
- 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. - 输出
- 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).
- 样例输入
1 10100 200201 210900 1000
- 样例输出
1 10 20100 200 125201 210 89900 1000 174
- 来源
- POJ
- 上传者
- sadsad
#include<stdio.h>#define MAXN 10000+10int arr[MAXN];int len(int n){int i=1;while(n!=1){if(n&1)n=3*n+1;elsen/=2;++i;}return i;}void count(){int i;for(i=1;i!=MAXN;i++)arr[i]=len(i);}int main(){count();int i,t,x,y,maxlen;while(~scanf("%d%d",&x,&y)){maxlen=-1;if(x>y){t=x;x=y;y=t;}for(i=x;i<=y;i++){t=arr[i];if(t>maxlen)maxlen=t;}printf("%d %d %d\n",x,y,maxlen);}return 0;}
0 0
- nyoj-271-The 3n + 1 problem
- NYOJ 271 The 3n + 1 problem
- NYOJ 271 The 3n + 1 problem
- NYOJ 271 The 3n + 1 problem【打表法】
- NYOJ 271 The 3n + 1 problem【打表法】
- HDUOJ&&NYOJ----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
- The 3n + 1 problem
- 给搜索换一种打开方式
- Window下配置Hadoop
- 分布式文件系统HDFS名字节点
- 关于ExpandableListView的childview刷新问题
- 最大子序列和的问题
- NYOJ 271 The 3n + 1 problem【打表法】
- Runnable并不一定新开线程
- Listview不同项问题
- Java之OutOfMemoryError简单分析
- Java的Nio(一)
- 应用时标分离和动态逆方法设计飞行器的姿态控制系统(源代码)
- vim使用教程(全)-最好的编辑器
- Python 命名空间 及变量搜索规则 属性名称 属性名称 无点号运算的变量名
- 【大型网站技术实践】初级篇:借助Nginx搭建反向代理服务器