zoukankan      html  css  js  c++  java
  • poj 1207 The 3n + 1 problem

    The 3n + 1 problem
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 51221   Accepted: 16262

    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 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.

    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 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.

    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 125
    201 210 89
    900 1000 174
     1 #include<iostream>  
     2 #include<string.h>  
     3 #include<stdio.h>  
     4 #include<ctype.h>  
     5 #include<algorithm>  
     6 #include<stack>  
     7 #include<queue>  
     8 #include<set>  
     9 #include<math.h>  
    10 #include<vector>  
    11 #include<map>  
    12 #include<deque>  
    13 #include<list>  
    14 using namespace std;
    15 
    16 int CycleNum(int i)
    17 {
    18     int count=1;
    19     while(i!=1)
    20     {
    21         if(i%2)
    22             i=3*i+1;
    23         else
    24             i/=2;
    25         count++;
    26     }
    27     return count;
    28 }
    29 
    30 int main(void)
    31 {
    32     int a,b;
    33     while(cin>>a>>b)
    34     {
    35         int x=a<b?a:b;
    36         int y=a>b?a:b;
    37         int MaxCycle=0;
    38         for(int i=x;i<=y;i++)
    39         {
    40             int temp=CycleNum(i);
    41             if(MaxCycle<temp)
    42                 MaxCycle=temp;
    43         }
    44         cout<<a<<' '<<b<<' '<<MaxCycle<<endl;
    45     }
    46     return 0;
    47 }
    View Code
  • 相关阅读:
    python一次性解压多层嵌套zip压缩包
    zabbix自定义监控项、添加图形、设置触发器、远程执行命令
    制作自己的docker镜像
    vue-router的Import() 异步加载模块问题的解决方案
    Idea Maven配置镜像地址总出问题,麻烦检查一下这里!(最新)
    杂谈:开发人员如何进行复杂业务的学习?让boss刮目相看
    Spring Boot 2.x 基础案例:整合Dubbo 2.7.3+Nacos1.1.3(配置中心)
    整理一些大厂的开源平台及github,向他们看齐...
    Spring Boot 2.x 基础案例:整合Dubbo 2.7.3+Nacos1.1.3(最新版)
    Java图片处理:ico格式转 PNG/JPG等格式
  • 原文地址:https://www.cnblogs.com/qscqesze/p/3877355.html
Copyright © 2011-2022 走看看