NSOJ The 3n + 1 problem

The 3n + 1 problem

时间限制: 1000ms

内存限制: 32768KB

HDU       ID: 1032
64位整型:      Java 类名:

上一题 

 提交  运行结果  统计  讨论版

 下一题

类型: 

没有

 没有 难度     lv.1     lv.2     lv.3     lv.4     lv.5     lv.6     lv.7     lv.8     lv.9     lv.10 搜索 数据结构 动态规划 STL练习 高精度计算 图论 几何 数学 矩阵计算 入门题目 字符串 博弈论                  添加

题目描述

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. 

输入

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.

输出

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

来源

UVA

思路：简单的水题；

#include<stdio.h>int main(){    int k,c,m,n,max,a,b,i;    while(~scanf("%d%d",&a,&b))    {        max=0;       printf("%d %d ",a,b);        if(a>b)        {            m=a;            a=b;            b=m;        }        for(i=a;i<=b;i++)        {             k=1;n=i;            while(n!=1)            {                if(n%2==0)                    n=n/2;                else n=n*3+1;                k++;            }            if(max<k)                max=k;        }        printf("%d\n",max);    }    return 0;}