hdu1032 The 3n + 1 problem
来源:互联网 发布:宁波行知实验小学网站 编辑:程序博客网 时间:2024/06/05 08:44
Problem 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:
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 (including the 1). 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 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 (including the 1). 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 1,000,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 can assume that no opperation overflows a 32-bit integer.
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 can assume that no opperation overflows a 32-bit integer.
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
Source
UVA
C语言AC代码
#include<stdio.h>int main(){ int i,j,k,n,Len,Max; while(scanf("%d%d",&i,&j)!=EOF) { printf("%d %d ",i,j); if(i>j) { k=i; i=j; j=k; } Max=0; for(n=i; n<=j; n++) { k=n; Len=1; while(k!=1) { if(k%2==0) k=k/2; else k=3*k+1; Len++; } if(Len>Max) Max=Len; } printf("%d\n",Max); } return 0;}分析:题目是要求从i到j的所有数的length,然后找出其中最大的输出,代码本身没什么难度,小心一点就可以了
阅读全文
0 0
- HDU1032:The 3n + 1 problem
- The 3n + 1 problem(HDU1032)
- HDU1032--The 3n + 1 problem
- HDU1032 The 3n + 1 problem
- HDU1032 The 3n + 1 problem
- HDU1032 The 3n + 1 problem(java)
- hdu1032 The 3n + 1 problem
- HDU1032&Uva100 The 3n + 1 problem
- HDU1032:The 3n + 1 problem
- HDU1032 The 3n + 1 problem
- hdu1032 The 3n + 1 problem
- hdu1032 The 3n + 1 problem
- hdu1032 3n+1 Problem
- HDU1032 - The 3n + 1 problem (暴力)
- HDU1032 The 3n + 1 problem循环次数
- HDU1032-The 3n + 1 problem-水题压惊
- HDU1032——The 3n + 1 problem
- HDU1032:The 3n + 1 problem(比较运算次数)
- 【OpenCV】访问Mat中每个像素的值(新)
- Spring Boot学习之旅:(三)springboot热部署
- markDown的一些思路
- 9.26学习报告
- ARKit框架学习
- hdu1032 The 3n + 1 problem
- java中常量和变量
- 拷贝构造
- post请求上传文件和文本时http格式
- Linux基础入门(六) --学习笔记-正则表达式
- 浅谈opencv中的Mat在处理图像数据中的用法
- 153. Find Minimum in Rotated Sorted Array
- 对接钉钉接口可能遇到的问题 50004 60011
- CSU1811-Tree Intersection