杭电1032——The 3n + 1 problem（简单题）

flying_fish_233

于 2015-11-08 11:47:01 发布

阅读量845

点赞数

分类专栏：杭电acm

本文链接：https://blog.csdn.net/qianchangdiyin/article/details/49717431

版权

博客分析了计算机科学中的一个问题——3n + 1问题，并提出求解两个数之间最大循环长度的方法。通过对输入i和j进行枚举，确定每个数的循环长度，最终找到区间内的最大值。题目提供了样例输入和输出，以说明解决方案的正确性。

摘要由CSDN通过智能技术生成

问题描述

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.