UVA 3n+1 Problems

[聰┼聰]

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

class Main {
public static void main(String args[]){
long count;
long max = 0;
long n = 0;
int from = 0, tmpFrom = 0;
int to = 0, tmpto = 0;
Scanner br = new Scanner(new BufferedInputStream(System.in));
while(br.hasNext()){
tmpFrom = from = br.nextInt();
tmpto = to = br.nextInt();

if(from>to){
to = tmpFrom;
from = tmpto;
}
max = 0;
for(long i=from; i<=to; i++){
count = 1;
n = i;
while(n != 1){
if((n & 1) == 1){
n = (n << 2) - n +1;
}else{
n = n >> 1;
}
count++;
}
if(count > max){
max = count;
}
}
System.out.println(tmpFrom + " " + tmpto + " " + max);
}
}
}

[Henry Hong-Ning Dai]

Dear Jeff,

Have your code passed the UVA online judge?

Regards,
Henry

--
Hong-Ning Dai, Ph.D.
Assistant Professor
Faculty of Information Technology
Macau University of Science and Technology
Tel: (853) 8897 2154
Email: hndai...@gmail.com

[聰┼聰]

Yes,I have. but the running time around 1S

> Email: hndai.m...@gmail.com

[Henry Hong-Ning Dai]

I think it is acceptable for Java. Another student tried this by C++ and his runtime is about 0.6s.

Go ahead for other questions. Good luck!

Henry

Email: hndai...@gmail.com