OJ Board

Code: Select all

import java.io.*;
import java.util.*;

class Main {
	void Begin () {
		String in;
		int p, q, i;
		boolean Reversed;
		
		while ((in= ReadLn(20)) != null) {
			Reversed= false;
			
			i= in.indexOf(' ');
			p= Integer.parseInt(in.substring(0, i));
			q= Integer.parseInt(in.substring(++i, in.length()));
			
			if (p > q) {
				int tmp= q;
				q= p;
				p= tmp;
				Reversed= true;
			}
			
			cycleLength(p, q, Reversed);
		}
	}
	
	static void cycleLength(int p, int q, boolean Reversed) {
		int MaxCycleLength= 0;
		int Count, n;
		
		for (int i= p; i<=q;i++) {
			Count= 1;
			n= i;
			
			while (n != 1) {
				if (n%2 == 1) {
					n= 3*n + 1;
				} else {
					n= n/2;
				}
				
				Count++;
			}
			
			if (Count > MaxCycleLength) {
				MaxCycleLength= Count;
			}
		}
		
		if (Reversed == false) {
			System.out.println(p+" "+q+" "+MaxCycleLength);
		} else {
			System.out.println(q+" "+p+" "+MaxCycleLength);
		}
	}

    static String ReadLn (int maxLg) {
        byte lin[] = new byte [maxLg];
        int lg = 0, car = -1;
        String line = "";

        try
        {
            while (lg < maxLg)
            {
                car = System.in.read();
                if ((car < 0) || (car == '\n')) break;
                lin [lg++] += car;
            }
        }
        catch (IOException e)
        {
            return (null);
        }

        if ((car < 0) && (lg == 0)) return (null);  // eof
        return (new String (lin, 0, lg));
    }

    public static void main (String args[])  // entry point from OS
    {
        Main myWork = new Main();  // create a dinamic instance
        myWork.Begin();
    }	
}

Code: Select all

var N1,N2,solve1:longint;
function Solve(N,k:longint):longint;
var i,j,res:longint;
begin
   solve1:=0;
   FOR j:=n TO k DO
   begin
    i:=j;
    Res:=0;
     while i>1 do
     begin
          if odd(i) then i:=i*3+1
                    else I:=I div 2;
                    Inc(res);
     end;
     if res>solve1 then solve1:=res
   end;
result:=solve1;
end;
begin
 while not eof do
 begin
   read(N1);
   Read(n2);
   Write(N1,' ',N2,' ',Solve(n1,n2)+1);
 end;
end.

Code: Select all

program problem_100;
var N1,N2,count,solve1:longint;
    mass1,mass2,mass3:array[1..100] of longint;
function Solve(N,k:longint):longint;
var i,j,res:longint;
begin
   solve1:=0;
   FOR j:=n TO k DO
   begin
    i:=j;
    Res:=0;
     while i>1 do
     begin
          if odd(i) then i:=i*3+1
                    else I:=I div 2;
                    Inc(res);
     end;
     if res>solve1 then solve1:=res
   end;
result:=solve1;
end;
begin
 count:=0;
 while not eof do
 begin
   inc(count);
   read(N1);
   Read(n2);
   mass1[count]:=N1;
   mass2[count]:=N2;
   mass1[count]:=Solve(n1,N2)+1;
 end;

 for N1:=1 to count do Write(mass1[n1],' ',mass2[n1],' ',mass3[n1]);
 Writeln;
end.

Code: Select all

program p100;
var N1,N2,count,solve1:longint; 
    mass1,mass2,mass3:array[1..1000000] of longint; 
function Solve(N,k:longint):longint; 
var i,j,res:longint; 
begin 
   solve1:=0;
 if N<K then
 Begin
   FOR j:=n TO k DO
   begin
    i:=j;
    Res:=0;
     while i>1 do
     begin
          if odd(i) then i:=i*3+1
                    else I:=I div 2;
                    Inc(res);
     end;
     if res>solve1 then solve1:=res
   end;
 End
 else
 Begin
   FOR j:=k TO n DO
   begin
    i:=j;
    Res:=0;
     while i>1 do
     begin
          if odd(i) then i:=i*3+1
                    else I:=I div 2;
                    Inc(res);
     end;
     if res>solve1 then solve1:=res
   end;

 End;
result:=solve1;
end; 
begin 
 count:=0; 
 while not eof do 
 begin 
   inc(count); 
   read(N1); 
   Read(n2); 
   mass1[count]:=N1; 
   mass2[count]:=N2; 
   mass3[count]:=Solve(n1,N2)+1; 
 end;

 for N1:=1 to count do 
  begin
    Write(mass1[n1],' ',mass2[n1],' ',mass3[n1]);
    Writeln;
  end;
end.

Code: Select all

import java.io.FileInputStream;
import java.io.InputStream;
import java.io.IOException;

import java.util.StringTokenizer;

interface MyReader {
    String readLine () throws IOException;}

final class MyBufferedReader implements MyReader {
    private InputStream in;

    public MyBufferedReader (InputStream in) {
        this.in = in;}

    public String readLine () throws IOException {
        final StringBuffer s = new StringBuffer(255);
        int i = 0;
        while (((i = in.read()) != '\n') && (i != -1))
            if (i != '\r')
                s.append((char) i);
        if (i == -1)
            return null;
        return s.toString();}}

 final class Main {
    static int eval (int i, int j) {
        int max = 0, temp = 0;
        if(j<i)
        {
        	temp = i;
        	i = j;
        	j = temp;
        	temp = 0;
        }
        for(int x = i - 1; x <= j; x++)
        { 	
        	temp = cyclelength(x);
        	if (max < temp)
        	max = temp;
        }
        return max;}
    static int cyclelength(int i)
    {
    int cycle = 1;
    while(i != 1)
    {	
    	if(i%2 == 1)
    	{
    		i=3*i+1;
    		cycle++;
    	}	
    	if(i%2 == 0)
    	{
    		i = i/2;
    		cycle++;
    	}
    }
    return cycle;
    }
    static void main (String[] args) {
        try {
            MyReader in = new MyBufferedReader(System.in);
            String   s;
            while ((s = in.readLine()) != null) {
                StringTokenizer st = new StringTokenizer(s);
                int i = Integer.parseInt(st.nextToken());
                int j = Integer.parseInt(st.nextToken());
                System.out.println(i + " " + j + " " + eval(i, j));}}
        catch (IOException e) {
            e.printStackTrace();}}}