OpenJudge/Poj 1207 The 3n + 1 problem
1.链接地址:
http://bailian.openjudge.cn/practice/1207/
http://poj.org/problem?id=1207
2.题目:
- 总时间限制:
- 1000ms
- 内存限制:
- 65536kB
- 描述
- 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 2Given 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 10
100 200
201 210
900 1000- 样例输出
1 10 20
100 200 125
201 210 89
900 1000 174- 来源
- Duke Internet Programming Contest 1990,uva 100
3.思路:
4.代码:
#include "stdio.h"
//#include "stdlib.h"
#define N 1000002
int a[N];
int main()
{
int i,j,k,count,n,max,tmp;
while(scanf("%d%d",&i,&j) != EOF)
{
max=;
//if(j<i){tmp=j;j=i;i=tmp;}
if(i<j)
{
max=;
for(k=i;k<=j;k++)
{
if(a[k]>) count = a[k];
else
{ count=;
n=k;
while(n!=)
{
if(n%==) n=n/;
else n=*n+;
count++;
}
}
if(count>max) max=count;
}
}
else
{
for(k=j;k<=i;k++)
{
if(a[k] > ) count = a[k];
else
{ count=;
n=k;
while(n!=)
{
if(n%==) n=n/;
else n=*n+;
count++;
}
a[k] = count;
} if(count>max) max=count;
}
}
printf("%d %d %d\n",i,j,max);
}
//system("pause");
return ;
}
OpenJudge/Poj 1207 The 3n + 1 problem的更多相关文章
- The 3n + 1 problem 分类: POJ 2015-06-12 17:50 11人阅读 评论(0) 收藏
The 3n + 1 problem Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 53927 Accepted: 17 ...
- UVa 100 - The 3n + 1 problem(函数循环长度)
题目来源:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&pa ...
- 烟大 Contest1024 - 《挑战编程》第一章:入门 Problem A: The 3n + 1 problem(水题)
Problem A: The 3n + 1 problem Time Limit: 1 Sec Memory Limit: 64 MBSubmit: 14 Solved: 6[Submit][St ...
- uva----(100)The 3n + 1 problem
The 3n + 1 problem Background Problems in Computer Science are often classified as belonging to a ...
- 【转】UVa Problem 100 The 3n+1 problem (3n+1 问题)——(离线计算)
// The 3n+1 problem (3n+1 问题) // PC/UVa IDs: 110101/100, Popularity: A, Success rate: low Level: 1 / ...
- 100-The 3n + 1 problem
本文档下载 题目: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_pro ...
- PC/UVa 题号: 110101/100 The 3n+1 problem (3n+1 问题)
The 3n + 1 problem Background Problems in Computer Science are often classified as belonging to a ...
- UVA 100 - The 3n+1 problem (3n+1 问题)
100 - The 3n+1 problem (3n+1 问题) /* * 100 - The 3n+1 problem (3n+1 问题) * 作者 仪冰 * QQ 974817955 * * [问 ...
- classnull100 - The 3n + 1 problem
新手发帖,很多方面都是刚入门,有错误的地方请大家见谅,欢迎批评指正 The 3n + 1 problem Background Problems in Computer Science are o ...
随机推荐
- Struts的类型转换
struts中jsp提交的数据,struts会自动转换为action中的属性类型: 对于基本的数据类型以及日期类型会自动转换: 就像前面那一篇博客的代码封装一样,会把字符串类型传过来的数据转化为相应的 ...
- Cocos2d-x 3.0心得(01)-图片载入与混合模式
近期開始用cocos2dx 3.0做东西,略有心(cao)得(dian),略微作下记录吧. v3.0相对v2.2来说,最引人注意的,应该是对触摸层级的优化.和lambda回调函数的引入(嗯嗯.不枉我改 ...
- 显示 png 图片
uses pngimage;{显示 png 图片}procedure TForm1.Button2Click(Sender: TObject);var png: TPngImage;begin ...
- UIWebView的使用,简单浏览器的实现
#import "ViewController.h" @interface ViewController () <UIWebViewDelegate> @propert ...
- js 三元运算符以及|| 和 && 测试
var a = '0';var b = a ? 'me':'hi'; console.log(b);//false 有: undefined , 0, '', false,null//true ...
- window.top、window.parent
iframe和frameset中可能会用到window.parent.window.top 其中window.parent是相对于打开子页面的当前js所在页面的层级: 例如:a页面中包含一个ifram ...
- (一)javascript中的数组index属性——获取数组的索引值
例如:要做到这样的效果 点击每个选项时,会显示不同的div. 我们的做法:在javascript中,先把所有的div的display设置为none,然后在根据当前的数组里的索引值进行一个显示div的过 ...
- 获取select值
//Jquery中select的使用 //select获取当前选中的value值 $('#sel').change(function () { var depId = $(this).children ...
- swift switch语句
switch选择 1)case多条件匹配:条件之间用逗号隔开 用三个点表示范围:…,..<:表示不包含上边界 var tand = 1 switch tand{ case 0: ...
- Android_scrollview
xml: <LinearLayout xmlns:android="http://schemas.android.com/apk/res/android" xmlns:too ...