The 3n + 1 problem
来源:互联网 发布:网络科科是什么意思 编辑:程序博客网 时间:2024/05/21 11:22
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
我坚信这是一个十足笨的算法,认为可以用动规做,但是因为利用不好已有的数据导致重复计算反而贡献了一个TLE,还是用笨思路AC的,简直呵呵。
#include <stdio.h>int tim(int ii){ int i = ii; int t = 1; while (i != 1) { if (i % 2) { i = i * 3 + 1; }else { i /= 2; } t++; } return t;}int main(){ int A,a,B,b,i; while (~scanf ("%d%d",&A,&B)) { if (A > B) { a = B; b = A; }else { a = A; b = B; } int tmp; int imax = 0; for (i = a;i <= b;i++) { tmp = tim(i); if (tmp > imax) imax = tmp; } printf ("%d %d %d\n",A,B,imax); } return 0;}
0 0
- The 3n + 1 problem
- The 3n+1 Problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 problem
- The 3n + 1 Problem
- The 3n + 1 problem
- SQL SERVER日期间隔函数
- 映射SharePoint 2013主页到外网的方法
- 前端页面设置只读属性组件
- Second, Millisecond(毫秒), Microsecond(微秒)
- c++API设计
- The 3n + 1 problem
- uint8_t / uint16_t / uint32_t /uint64_t 是什么数据类型 - 大总结,看完全明白了
- 元旦至今全国确诊96人感染H7N9 春节不会暴发疫情
- linux下chrome字体发虚
- 解除wicket的ajax debug状态
- vs2013的起始
- Linux下以C构建WEB服务并响应XHR(XMLHttpRequest)请求
- JVM的类的加载
- Cookie、 Session和 Cache