100 - The 3n + 1 problem

UVa網站題目連結
My Solved Problems Performance

Background

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.

The Problem

Consider the following algorithm:

 1.   input n

2. print n

3. if n = 1 then STOP

4. if n is odd then tex2html_wrap_inline44

5. else tex2html_wrap_inline46

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.

The 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 operation overflows a 32-bit integer.

The 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

Solution

  1. import java.io.BufferedInputStream;
  2. import java.util.Scanner;

  3. public class Main {

  4. public static void main (String[] args) {

  5. int in1, in2, x, min, max, counter = 0, counterMax = 0;
  6. Scanner in = new Scanner(new BufferedInputStream(System.in));
  7. while (in.hasNext()) {
  8. in1 = in.nextInt();
  9. in2 = in.nextInt();
  10. if (in1 > in2) {
  11. max=in1;
  12. min=in2;
  13. } else {
  14. max=in2;
  15. min=in1;
  16. }
  17. counterMax = 0;
  18. for (x=min; min<=max; min++) {
  19. x = min;
  20. for (counter = 1; x!=1; counter++) {
  21. if ((x&1)==1) x=3*x+1;
  22. else x>>=1;
  23. }
  24. if (counter>counterMax)counterMax =counter;
  25. }
  26. System.out.println(in1 + " " + in2 + " " + counterMax);
  27. }
  28. }
  29. }

關鍵字:UVa Online Judge, ACM. Java


留言

相關文章

這個網誌中的熱門文章

【博客來折價券】博客來免費序號e-coupon分享(持續更新)

【證件遺失補辦】身分證/健保卡/駕照/行照/信用卡總整理

【多益成績】TOEIC多益成績分數查詢、計算標準與換算對照表

【超商懶人包】消費享10%回饋攻略+繳費取貨也能賺回饋?

【銀行代碼查詢】3碼銀行代碼列表、7碼分行代碼查詢

【台新@GoGo】消費享1.5%網購3.5%!行動支付/保費密技!

【Uber優步】2019免費序號「ewdnacom」享200乘車優惠!

【華南i網購生活卡】2019網購+行動支付5%神卡(最高6%)!

【信用卡排行榜】2019網購/行動支付神卡推薦最高6%回饋!

【玉山卡申辦攻略】玉山新戶辦icash+Pi雙刀流賺首刷900!