OJ Board

Code: Select all

import java.util.*;

class Main {

	public static void main(String[] args){
		new Main().solveProblem();
	}

	public void solveProblem(){
		final Scanner in = new Scanner(System.in);
		while(in.hasNextInt()){
			int i = in.nextInt();
			int j = in.nextInt();
			int[] values = new int[j-i+1];
			for(int k = i;k <= j;k++){
				values[k-i] = findSeqNum(k);
			}
			int most = getMax(values,j-i+1);
			System.out.println(""+i+" "+j+" "+most);
		}
		in.close();
	}

	public int findSeqNum(int n){
		int count = 1;
		while(n != 1){
			if(n%2 == 0)
				n = n / 2;
			else
				n = 3 * n + 1;
			count++;
		}
		return count;
	}

	public int getMax(int[] vals,int size){
		int max = vals[0];
		for(int i = 0;i < size;i++)
			if(vals[i] > max)
				max = vals[i];
		return max;
	}
}

Code: Select all

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package sample_java;

/**
 *
 * @author Nawshad
 * Problem: 100
 */
// 

import java.io.IOException;
import java.util.StringTokenizer;

class Main
{
    static String ReadLn (int maxLg)  // utility function to read from stdin
    {
        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));
    }

    int loop(int i)
    {
        int n=i;
        int count=1;
        while(n>1)
        {
            if(n%2==0)
            {
                n=n/2;
            }
            else
            {
                n=3*n+1;
            }
            count++;
        }
       return count; 
    }

    int max_cycle(int j,int k)
    {

        int max=-1;
        for(int i=j;i<k;i++)
        {
            int count=loop(i);
            if(count>max)
            {
                max=count;
            }
        }
        return max;
    }

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

    void Begin()
    {
        String input;
        StringTokenizer idata;
        int a, b, min, max;

        while ((input = Main.ReadLn (255)) != null)
        {
          idata = new StringTokenizer (input);
          a = Integer.parseInt (idata.nextToken());
          b = Integer.parseInt (idata.nextToken());
          if (a < b) { min=a; max=b; } else { min=b; max=a; }
       
         System.out.println (a + " " + b + " " + max_cycle(min, max));
        }
          
    }
    
    
}

Code: Select all

1 1

Code: Select all

1 1 1