import java.util.*;
public class Main {
public static void main(String[] args) {
int i =0,j =0,x;
Scanner scn = new Scanner(System.in);
while(scn.hasNextInt()) {
i = scn.nextInt();
j = scn.nextInt();
int start,end;
if(i > j) {
start = j;
end = i;
}
else {
start = i;
end = j;
}
int max = 0;
int n =0;
int count;
for(x=start;x<=end;x++) {
n = x;
count = 1;
while(n != 1) {
if(n%2 == 0)
n = n/2;
else
n = 3*n+1;
count++;
}
if(count > max )
max = count;
}
System.out.println(i +" " +j +" " +max);
}
}
}
Share this
Related Posts
11172 - Relational OperatorProblem Link
import java.util.*;
public class Main {
public static void main(String[]- 11727 - Cost CuttingProblem Link
import java.util.*;
public class Main {
public static void main(String []
- C-PROM 2014 (PROBLEM 8 :COMPUTE COOKIES SOLD)
800x600
Normal
0
false
false
false
EN-US
X-NONE
- 10921 - Find the TelephoneProblem Link
Cara nak selesaikan soalan ni senang sangat untuk di selesaikan. Kita hanya
:)
:(
hihi
:-)
:D
=D
:-d
;(
;-(
@-)
:P
:o
:>)
(o)
:p
:-?
(p)
:-s
(m)
8-)
:-t
:-b
b-(
:-#
=p~
$-)
(y)
(f)
x-)
(k)
(h)
cheer