OJ Board

Code: Select all

#include <iostream>

using namespace std;

#define MAX 1000000    // max int for input

// cycle_length_array[i] store the value of int i, init value is 0
int cycle_length_array[MAX];  
int generate_cycle_length(int n);  
int get_max_cycle_length(int start, int end);

int main()
{
	int start = 0;
	int end = 0;
	int max = 0;
	while (cin>>start>>end)
	{
		if (start > end)
		{
			max = get_max_cycle_length(end, start);
		}
		else
		{
			max = get_max_cycle_length(start, end);
		}
		cout << start << " "<< end << " "<< max<<endl;
	}
	return 1;
}

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

int get_max_cycle_length(int start, int end)
{
	int max = 0;
	for (int i = start; i <= end; ++i)
	{
		if (cycle_length_array[i] == 0)
		{
			cycle_length_array[i] = generate_cycle_length(i);
		}
		if (cycle_length_array[i] > max)
		{
			max = cycle_length_array[i];
		}
	}
	return max;
}

Code: Select all

if(veces==0) System.out.print(Math.min(a, b)+" "+Math.max(a, b)+" "+maxSteps);
else System.out.print("\n"+a+" "+b+" "+maxSteps);

Code: Select all

#include<stdio.h>

int main()
{
unsigned int m,n,x[20],y[20],i,j,c,mc[20],k,size,t;

i=0;
j=0;

while(scanf("%lu %lu",&x[i],&y[i])==2)	
	{
	if(x[i]>y[i])
		{
		t=x[i];
		x[i]=y[i];
		y[i]=t;
		}
	mc[i]=0;
	i++;	
	}

c=0;
mc[0]=1;

for(j=0;j<i;j++)
{
for(m=x[j];m<y[j];m++)
{
n=m;

while(n>=1)
{
c++;
if(n==1)
	{
	break;
	}

if((n%2)!=0)
	n=(3*n)+1;
else
	n=n/2;
}
if(mc[j]<c)
	mc[j]=c;
c=0;
}

}

for(j=0;j<i;j++)
	printf("%lu %lu %lu\n",x[j],y[j],mc[j]);

return 0;
}

Code: Select all

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

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

/**
 *
 * @author Kareem Ergawy
 */
class Main {

    public static final int SIZE = 100001;
    private int[] cycleLenght = new int[SIZE];

    static String ReadLn(int maxLength) {  // utility function to read from stdin,
        // Provided by Programming-challenges, edit for style only
        byte line[] = new byte[maxLength];
        int length = 0;
        int input = -1;
        try {
            while (length < maxLength) {//Read untill maxlength
                input = System.in.read();
                if ((input < 0) || (input == '\n')) {
                    break; //or untill end of line ninput
                }
                line[length++] += input;
            }

            if ((input < 0) && (length == 0)) {
                return null;  // eof
            }
            return new String(line, 0, length);
        } catch (IOException e) {
            return null;
        }
    }

    public static void main(String args[]) // entry point from OS
    {
        Main myWork = new Main();  // Construct the bootloader
        myWork.run();            // execute
        System.exit(0);
    }

    public void run() {
        cycleLenght[1] = 1;
        String nextLine = null;

        while (!(nextLine = Main.ReadLn(Byte.MAX_VALUE)).equals("")) {
            Scanner scanner = new Scanner(nextLine);
            int i = scanner.nextInt();
            int j = scanner.nextInt();
            int maxCycle = 0;

            if (i < j) {
                for (int x = i; x <= j; x++) {
                    int tmp = calcCycleLength(x);

                    if (maxCycle < tmp) {
                        maxCycle = tmp;
                    }
                }
            } else {
                for (int x = j; x <= i; x++) {
                    int tmp = calcCycleLength(x);

                    if (maxCycle < tmp) {
                        maxCycle = tmp;
                    }
                }
            }

            System.out.println(i + " " + j + " " + maxCycle);
        }
    }

    public int calcCycleLength(int n) {
        if (n < SIZE && cycleLenght[n] != 0) {
            return cycleLenght[n];
        }

        if (n % 2 == 0) {
            if (n < SIZE) {
                cycleLenght[n] = 1 + calcCycleLength(n >> 1);
                return cycleLenght[n];
            } else {
                return (1 + calcCycleLength(n >> 1));
            }
        } else {
            if (n < SIZE) {
                //http://loblog.wordpress.com/2007/03/29/programming-challenge-the-3n1-problem/
                cycleLenght[n] = 2 + calcCycleLength((3 * n + 1) >> 1);
                return cycleLenght[n];
            } else {
                return 2 + calcCycleLength((3 * n + 1) >> 2);
            }
        }
    }
}

Code: Select all

#include <iostream>
using namespace std;

long algo(long,long);
long find(long,long);

long algo(long a, long cnt){
  if(a==1){
    return cnt+1;
  }else{
    if(a%2!=0){
      algo((3*a)+1,cnt+1);
    }else{
      algo(a/2,cnt+1);
    }
  }
}

long find(long a,long b){
  long tmp = 0;
  long max = 0;
  for(; a<=b; a++){
    tmp = algo(a,0);
    if(max<=tmp)max=tmp;
  }
  return max;

}

int main(){
    char input_line[100];
    int a,b;

    while(cin.getline(input_line,100)) {
      sscanf(input_line, "%d %d",&a,&b);
      if(a<=b){
        printf("%d %d %d\n",a,b,find(a,b));
      }else{
        printf("%d %d %d\n",a,b,find(b,a));
      }
    }
  return 0;
}

Code: Select all

#include <iostream>
#include <stdio.h>

using namespace std;

int np(unsigned int num, unsigned int res){
	if (num == 1){
		return res;
	}else{ 
		if (num%2 != 0){
			res++;
			np((3*num)+1,res);
		}else{
			res++;
			np(num/2,res);
		}
	}
}

int main ()
{
   int a,b,max,temp;
      while(scanf("%d %d", &a,&b) != EOF){
      max = 0;
      printf("%d %d",a,b);
      if(a>b){ 
	swap(a,b);
      }
      for(a;a<=b;a++){
	 temp = np(a,1);
	 if(max < temp)
	    max = temp;
      }
      printf(" %d\n", max);
      }
  return 0;
}