poj 1207
来源:互联网 发布:lol从服务器接收数据 编辑:程序博客网 时间:2024/06/16 09:22
The 3n + 1 problem
Time Limit: 1000MS
Memory Limit: 10000K
[显示标签]
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 n2. print n3. if n = 1 then STOP4. if n is odd then n <-- 3n+15. else n <-- n/26. GOTO 2Given 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 10100 200201 210900 1000
Sample Output
1 10 20100 200 125201 210 89900 1000 174
Source
Duke Internet Programming Contest 1990,uva 10
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
//Queue<Integer> queue=new LinkedList<Integer>();
int i,j;
i=sc.nextInt();
j=sc.nextInt();
System.out.println(i+" "+j+" "+maxLen(i,j));
while(sc.hasNext()){
//queue.offer(sc.nextInt());
i=sc.nextInt();
j=sc.nextInt();
System.out.println(i+" "+j+" "+maxLen(i,j));
}
sc.close();
}
static int cirLen(int n){
int num=1;
while(n!=1){
n=n%2==0?n/2:3*n+1;
num++;
}
return num;
}
static int maxLen(int i,int j){
int tmp=0,len;
for(int x=i;x<=j;x++){
len=cirLen(x);
tmp=tmp<len?len:tmp;
}
return tmp;
}
}
主要功能实现,在读取数据方面最后一组数据无法读入,还有未判断i j 大小。稍后改进。
阅读全文
0 0
- poj 1207
- POJ-1207
- poj 1207
- poj 1207
- poj 1207
- POJ 1207
- poj 1207
- poj 1207
- poj 1207 水题
- POJ 1207水题
- POJ 1207 解题报告
- poj日记(1207)
- POJ
- poj
- POJ
- POJ
- poj
- poj
- Java学习之Iterator(迭代器)的一般用法 (转)
- poj 1007
- poj 1046
- thinkphp与jQuery利用ajax进行数据传输操作
- Java字符串的10大热点问题汇总!
- poj 1207
- poj 1247
- SharedPreferences
- 绕过验证码,模拟登录 南理教务处
- CURL方法curl_setopt()函数的一些参数
- 牛客网刷题笔记--字符串
- busybox v1.22.1(debian 1:1.22.0-19) built-in shell(ash)解决方案
- 识别验证码API
- 图像识别-纯数字识别