OJ Board

Code: Select all

#include<iostream>

int foo(long num)
{
	long c=num;
	long iter=1;
	while (c!=1)
	{
		if ((c%2)==0)
			c/=2;
		else
			c=c*3+1;
		iter++;
	}
	return iter;
}

int main()
{
	long i,j,tmp,max;
	while (std::cin>>i>>j)
	{
		std::cout<<i<<" "<<j<<" ";
		if (i>j)
		{
			tmp=i;
			i=j;
			j=tmp;
		}
		max=0;
		for (long x =i;x<=j;x++)
		{
			tmp=foo(x);
			if (tmp>max)
				max=tmp;
		}
		std::cout<<max<<std::endl;
	}
}

Code: Select all

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

class Main
{
	Arbol tree;
	int cont;
	int de;
	public static void main(String args[])
	{
		Main myWork = new Main();
		myWork.Begin();
	}
	public int teur(long n)
	{
		int temp = tree.buscar(n);
		//System.out.println(n);
		if(n==1)
			return 1;
		else
		{
			if(temp==0)
			{	
				cont ++;
				temp = 1 + teur(((n%2)==0)?n/2:(3*n+1));
				tree.insertaNodo(n, temp);
			}
			de++;
		}
		return temp;
	}
	public void Begin()
	{
		String input;
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);
		tree = new Arbol();
		cont = 0;
		de = 0;
		int a, b, min, max, mayor, c;
		try{
			while((input = in.readLine())!=null)
			{
				a = Integer.parseInt(input.split(" ")[0]);
				b = Integer.parseInt(input.split(" ")[1]);
				if(a < b ){ min = a; max = b;}else{min = b; max = a;}
				mayor=-1;
				for(long n = min; n<=max; n++)
				{
					c = teur(n);
					if(c>mayor) mayor = c;
				}
				out.println(a + " " + b + " " + mayor);
				out.flush();
			}
		}catch(Exception ex){System.exit(0);}
	}
	class Arbol
	{
		Nodo raiz;
		public Arbol()
		{
			raiz = null;
		}
		public void insertaNodo(long d, int c)
		{
			if(raiz==null)
			{
				raiz = new Nodo(d, c);
			}else{
				Nodo aux = new Nodo(d, c);
				Nodo actual = raiz;
				if((d%2)==0)
				{
					if(actual.getRight()==null)
						actual.setRight(aux);
					}else{
					if(actual.getLeft()==null)
						actual.setLeft(aux);
					else
						insertaHijo(actual.getLeft(),aux);
				}
			}
		}
		public void insertaHijo(Nodo rama,Nodo aux)
		{
			while(rama!=null)
			{
				if(rama.getData()<aux.getData())
				{
					if(rama.getLeft()!=null)
					{
						rama = rama.getLeft();
					}else{
						rama.setLeft(aux);
						return;
					}
				}else{
					if(rama.getRight()!=null)
					{
						rama = rama.getRight();
					}else{
						rama.setRight(aux);
						return;
					}
				}
			}
		}
		public int buscar(long d)
		{
			if(raiz==null)
				return 0;
			else
			{
				Nodo actual = raiz;
				if(raiz.getData()==d)
					return raiz.getCount();
				else
				{
					if((d%2)==0)
					{
						return busquedaR(raiz.getRight(),d);
					}else{
						return busquedaR(raiz.getLeft(),d);
					}
					
				}
			}
		}
		public int busquedaR(Nodo rama, long d)
		{
			
			while(rama!=null)
			{
				if(rama.getData()==d)
				{
					return rama.getCount();
				}else{
					if(rama.getData()<d)
					{
						rama = rama.getLeft();
					}else{
						rama = rama.getRight();
					}
				}
			}
			return 0;
		}
	}
	class Nodo
	{
		long dato;
		int count;
		Nodo izq;
		Nodo der;
		public Nodo(long d, int c)
		{
			dato = d;
			count = c;
			izq = null;
			der = null;
		}
		
		public long getData()
		{
			return dato;
		}
		public int getCount()
		{
			return count;
		}
		public Nodo getLeft()
		{
			return izq;
		}
		public Nodo getRight()
		{
			return der;
		}
		public void setLeft(Nodo n)
		{
			izq = n;
		}
		public void setRight(Nodo n)
		{
			der = n;
		}
	}
}

Code: Select all

import java.util.*;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Main {

    public static String sequenceEvaluator(int begin, int end){
        return (begin + " " + end+ " " + sequenceEvaluatorHelper(begin, end));
    }

    private static int sequenceEvaluatorHelper(int begin, int end){
        int maxTimes = -1;
        int timesThroughCycle;
        int start;
        if(end < begin){
            start = begin;
            begin = end;
            end = start;
        }
        for(int dummy = begin; dummy <= end; dummy++){
            timesThroughCycle = 1;
            start = dummy;
            while(start != 1){
                if(start % 2 == 1){
                    start = 3*start+1;
                }else{
                    start = start/2;
                }
                timesThroughCycle++;
            }
           // System.out.println("Times through: " + timesThroughCycle);
            if(timesThroughCycle > maxTimes){
                maxTimes = timesThroughCycle;
            }
        }
        return maxTimes;
    }


    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
         while(in.hasNext()){
                String[] numbers = in.nextLine().split(" ");
                int start = Integer.parseInt(numbers[0]);
                int end = Integer.parseInt(numbers[1]);
                System.out.println(sequenceEvaluator(start, end));
        }
    }

}

Code: Select all

./a.out 10 1 100 200 201 210 900 1000
10 1 20
100 200 125
201 210 89
900 1000 174

Code: Select all

echo 10 1 100 200 201 210 900 1000  | ./a.out

Code: Select all

echo 10 1 100 200 201 210 900 1000  | ./a.out
10 1 20
200 100 125
201 210 125
900 1000 174
sh: pause: command not found

Code: Select all

system("pause");

Code: Select all

echo 10 1 100 200 201 210 900 1000  | ./a.out
10 1 20
200 100 125
201 210 125
900 1000 174