OJ Board

Code: Select all

If you get WA in problem 100, read me before post!

Code: Select all

class Main
{	

	///Punto de entrada del programa...
	public static void main(String args[])
	{	
		long a;
		long i, j, x;
		int y, secuenciaMayor;
		String sin, sout = "";
		boolean primero = true;
		while(true)
		{
			sin = leerLinea();
			
			if(sin == null || sin.length() == 0 || sin == "")
				break;
		/*	else if(!primero)
				///sout += "\n";
				System.out.println();
			else if(primero)
				primero = false;
		*/	
			i = Integer.parseInt(sin.substring(0, sin.indexOf(' ')));
			j = Integer.parseInt(sin.substring(sin.indexOf(' ') + 1));	
		
	///		sout += (i + " " + j + " ");
			
			System.out.print(i + "  " + j + "  ");
			
			x = min(i,j);
			j = max(i,j);
			secuenciaMayor = 0;
		
	///		sout += (x + "  " + j + "  ");
		
			///Collatz para todos los n

Code: Select all

10 1

Code: Select all

void output(void) 
{ 
unsigned long mem=j-i+1; 
unsigned long counter=j-i; 
temp = new unsigned long[mem]; 
no_Zero=mem; 
hindex=0; 
hvalue=0; 
for(unsigned long k=0;k<=(j-i);k++) 
{ 
temp[k]=0; 
} 
while(no_of_zeros() > 0 || counter==0 ) 
{ 
// cout <<"No of zeros " <<no_of_zeros() << " " << "Next zero "<<next_zero() <<" " ; 
if(temp[counter]==0) 
result(counter+i); 
counter--; 
} 
if(i < j) 
{ 
cout << i <<" "<< j <<" "<< hvalue ; 
} 
else 
{ 
cout << j <<" "<< i <<" "<< hvalue ; 
} 
} 

int main(int argc , char ** argv) 
{ 
unsigned long swp=0; 
while(scanf("%ld%ld",&i,&j)!=EOF) 
{ 
if(i > j) 
{ 
swp=i; 
i=j; 
j=swp; 
} 
output(); 
cout << endl; 
} 
return 0; 
}

Code: Select all

#include <iostream>

using namespace std;

void swap (unsigned long &a, unsigned long &b) {
	unsigned long temp;
	temp = a;
	a = b;
	b = temp;
}

unsigned long cycle_length (unsigned long n) {
	unsigned long length=1;
	do {
		length++;
		if (n%2!=0)
			n = 3*n+1;
		else
			n /= 2;
	} while (n!=1);
	return length;
}

unsigned long max_length(unsigned long a, unsigned long b) {
	unsigned long i,maxlength=0;
	for (i=a;i<=b;i++) {
		if (cycle_length(i)>maxlength)
			maxlength=cycle_length(i);
	}
	return maxlength;
}

int main () {
	unsigned long i,j;
	while (cin >> i >> j) {
		cout << i << " " << j << " ";
		if (i>j)
			swap (i,j);
		cout << max_length(i,j) << endl;
	}
	return 0;
}

Code: Select all

#include <iostream>
using namespace std;

class MaxCycle
{
public:
	int getMax(long i, long j);

private:
	long j;
	long i;

};

int MaxCycle::getMax(long i, long j)
{
	long long temp = 0;
	long long max = 0;
	long long count = 1;
	if ( i > j )
	{
		temp = i;
		i = j;
		j = temp;
	}
	for (int min = i; min <= j; min++)
	{
		count = 1;
		long long answer = min;

		do
		{
			if ( answer == 1 )
			{
				continue;
			}

			if ( answer%2 != 0 )
			{
				answer = (3 * answer) + 1;
			}
			else
			{
				answer = ( answer / 2 );
			}

			count++;

		} 

		while ( answer != 1);



		if ( count > max )
		{
			max = count;
		}
	}

	return max;
}




int main ()
{
	int firstNumber;
	int secondNumber;

	cin >> firstNumber;
	cin >> secondNumber;

	MaxCycle M1;
	int result = M1.getMax(firstNumber,secondNumber);

	cout << firstNumber;
	cout << " ";
	cout << secondNumber;
	cout << " ";
	cout << result;
	cout << "\n";
	return 0;
}