OJ Board

Code: Select all

#include <stdio.h>
void swap( long int* x, long int* y)
{
   long int temp;
 
   temp = *x;
   *x    = *y;
   *y    = temp;
}
int main(){
	long int i,j, act_value, aux, count, max;
	while (scanf("%d %d" , &i, &j) != EOF){	
		max=0;
		printf("%d %d", i, j);
		if (i>j) swap (&i, &j);
		for (act_value=i;act_value<=j; act_value++){
			aux= act_value;
			count=1;
			while(aux!=1){
				if(aux%2 ==1) aux =(aux*3)+1;
				else aux=aux/2;
				count++;
			}
			if (count>= max) max =count;
			}
			printf(" %d \n",max);
			}	 
				
	

return (0);}

Code: Select all

#include <stdio.h>

int f(int i);

int main()
{
    int num1, num2, n, i, j, h;
    while(scanf("%d %d", &num1, &num2) == 2){
        n = 0;
        for(i=num1; i<=num2; i++){
            j = f(i);
            if(n < j) {
                n = j;
                h = i;
            }
        }
        printf("%d %d %d\n", num1, num2, n+1);
    }
    return 0;
}

int f(int n)
{
    int i;
    for(i=0; n!=1;i++){
            if(n%2){
                n = 3 * n + 1;
            }
            else if(!(n%2)){
                n = n / 2;
            }
    }

    return i;
}

Code: Select all

#include <cstdio>
#include <queue>
#include <map>

using namespace std;

typedef unsigned long int_t;

map<int_t, int_t> record;

void calc(int_t);

int main()
{
	int_t a = 0, b = 0, m = 0;
	int_t l = 0, r = 0;
	bool first = true;
	while(scanf("%ld%ld", &l, &r) == 2)
	{
		if(l > r) a = r, b = l;
		else a = l, b = r;
		for(int_t i = a; i <= b; ++i)
			calc(i);
		m = 0;
		for(int_t i = a; i <= b; ++i)
			m = m > record[i] ? m : record[i];
		if(first) printf("%ld %ld %ld", l, r, m + 1);
		else printf("\n%ld %ld %ld", l, r, m + 1);
		first = false;
	}
	return 0;
}

void calc(int_t t)
{
	queue<int_t> a;
	while(t != 1)
	{
		if(record[t] != 0) break;
		a.push(t);
		if(t % 2 == 0)
			t /= 2;
		else
			t = 3 * t + 1;
	}
	int_t base = record[t];
	while(!a.empty())
	{
		if(record[a.front()] != 0) break;
		record[a.front()] = a.size() + base;
		a.pop();
	}
}

Code: Select all

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

class Main {
    public static void main(String[] args)
    {
        new Main().run();
    }
    
    long Fef(long x)
    {
        long cicles = 0;
        long  temp = x;
        while (temp != 1)
        {
            if (temp % 2 == 0)
            {
                temp = temp /2;
                cicles++;
            }
            else
            {
                temp = 3 * temp + 1;
                temp = temp / 2;
                cicles = cicles + 2;
            }
        }
        cicles++;
        return cicles;
    }
    long MaxF(long from, long to)
    {
        long maximum = -1;
        for (long i = from; i <= to; i++)
        {
            long result = Fef(i);
            if (result > maximum)
                maximum = result;
        }
        return maximum;
    }
    private final long MAX = 1000000; // the maximum value accepted

    public void run()
    {
    	
    	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	StringTokenizer idata;
	String line = null;
	try {
		line = br.readLine();
	        long from_value = 0;
	        long to_value = 0;
	
		while ( line != null ) 
		{
		    idata = new StringTokenizer(line);

		    while(idata.hasMoreTokens())
		    {
			    	if( from_value <= 0 && idata.hasMoreTokens() )
			    		from_value = Long.parseLong(idata.nextToken());
			    	if( to_value <= 0 && idata.hasMoreTokens() )
			    		to_value = Long.parseLong(idata.nextToken());
			    	if( from_value > 0 && to_value > 0 )
			    	{
			            long from, to;
			            if (from_value > to_value)
			            {
			                from = to_value;
			                to = from_value;
			            }
			            else
			            {
			                from = from_value;
			                to = to_value;
			            }
			            if( from > 0 && to < MAX)
			            	System.out.printf("%d %d %d\n", from_value, to_value, MaxF(from, to));
			            from_value = -1;
			            to_value = -1;
			    	}
			    }		    
			    line = br.readLine();
			}
		} catch (IOException e) {
			e.printStackTrace();
		}
    }

}

Code: Select all

999999 1

Code: Select all

21 64 32 16 8 4 2 1