zoukankan      html  css  js  c++  java
  • ACM HDU 1032The 3n + 1 problem

    The 3n + 1 problem

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 8757    Accepted Submission(s): 3196


    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.
     

    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.
     

    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 10 100 200 201 210 900 1000
     

    Sample Output
    1 10 20 100 200 1
    25 201 210 89 900 1000 174
     

    Source
     

    Recommend
    mcqsmall
     
    简单题:
     
    #include<stdio.h>
    #include
    <iostream>
    using namespace std;
    int main()
    {
    int a,b,c,d;
    int len,maxlen;
    int i,j;
    while(cin>>a>>b)
    {
    c
    =a;d=b;//最后要输出的,复制一份,小的放前面
    if(c>d)c=c+d,d=c-d,c=c-d;
    for(i=c,maxlen=1;i<=d;i++)
    {
    for(j=i,len=1;j!=1;len++)
    {
    if(j%2==0)j/=2;
    else j=3*j+1;
    }
    if(len>maxlen)maxlen=len;
    }
    cout
    <<a<<" "<<b<<" "<<maxlen<<endl;
    }
    return 0;
    }

     
  • 相关阅读:
    QT QQuickView嵌入到QT MDI中
    地理入门-经纬度时区速成总结篇(转)
    Linux下系统时间函数、DST等相关问题总结(转)
    camera接口---MIPI CSI-2接口、DVP接口和FPD-Link III LVDS、GMSL等接口对比(转)
    基于spi FLASH的嵌入式文件系统 littlefs(转)
    PID 温控系统 解决方法(转)
    单相计量芯片RN8209D使用经验分享(转)
    【开源】EasyFlash 新年发布 V4.0 beta 版,完全重写(转)
    在uboot中加入cmd_run命令,运行环境变量(转)
    MPU6050开发 -- 数据分析(转)
  • 原文地址:https://www.cnblogs.com/kuangbin/p/2122242.html
Copyright © 2011-2022 走看看