OJ Board

Code: Select all

#include <iostream>
#include <vector>
using namespace std;
const int MAX_DIS = 1000000;
int already_found[MAX_DIS] = {0};
int Ackermann_3n(unsigned long long number)
{
	vector<unsigned long long> seq;
	int steps = 0;
	if (number == 1)
	{
		number = number * 3 + 1;
		steps++;
	}
	while (number != 1)
	{
		if (number < MAX_DIS)
			if (already_found[number]) 
			{
				steps += already_found[number];
				break;
			}
		seq.push_back(number);
		if (number % 2 == 0) number /= 2;
		else number = number * 3 + 1;
		steps++;
	}
	for (int a = 0; a < seq.size(); a++)
		if (seq[a] < MAX_DIS)
			already_found[seq[a]] = steps - a; 
	return steps;
}
int main()
{
	unsigned long long first, second, lower, upper;
	while (cin >> first >> second)
	{
		if (first == 0 && second == 0) return 0;
		lower = first <? second;
		upper = first >? second;
		
		unsigned long long max = 0, number = lower, result = 0;
		for (unsigned long long a = lower; a <= upper; a++)
		{
			result = Ackermann_3n(a);
			if (result > max)
			{
				max = result;
				number = a;
			}
		}	
		cout << "Between " << lower << " and " << upper << ", " << number << " generates the longest sequence of " << max << " values.\n";
	}
	return 0;
}

Code: Select all

  2147483647 2147483647
  1 20
 35 55
 1 1
 20 1
 1000001  1200000
 1000000 1000000
 2000000 2000000
 4000000 4000000
 2147483647 2147483647
 16 16
 1 2
 58 58
 19 19
 1 3
 1 2
 2 2
 1 2
1 10000
30000 100000
1 1000000
42 18
35 1
20 25
29 9
13 15
6 46
32 28
12 42
46 43
28 37
42 5
3 4
43 33
22 17
19 46
48 27
22 39
20 13
18 50
36 45 
0 0

Code: Select all

#define EMPTY 0
#define LIMIT 10000
#define RATIO 100
#define MAX 20
#include <stdio.h>

typedef unsigned long int ulong;

ulong fAckermann( ulong, ulong [] );
ulong fMaxi( ulong, ulong, ulong [] );


main()
{
	ulong i, count;
	ulong low[MAX] = { 0 }, upp[MAX] = { 0 };
	ulong cycleLength[LIMIT] = { 0 };        /*  caution! Do not use cycleLength[0] */
	for(i=1;i<LIMIT/RATIO;i++)
	{
		cycleLength[i] = fAckermann( i,cycleLength );
	}

i = 0, count = 0;
while(i<MAX){

	scanf("%d %d",&low[i],&upp[i]);
	if(low[i] == 0 && upp[i] == 0) break;
	else { count++, i++; }
}

for(i=0;i<count;i++)
{
    ulong longest = fMaxi(low[i], upp[i], cycleLength);
	printf("Between %d and %d, %d generates the longest sequence of length %d values.\n",low[i],upp[i], longest, cycleLength[longest] );
}


}


ulong fAckermann( ulong x, ulong clist[] )
{
ulong retv = 0;
if(x==1) {	
	if(clist[1] == EMPTY) retv = 3;
	else retv = 0;
}
else{
		if(clist[x] == EMPTY){
			if(x%2 == 1){
				retv = 1+fAckermann(3*x + 1, clist);
			}
			else{
				retv = 1+fAckermann(x/2, clist);
			}
		}
		else retv = clist[x];	
	}
return retv;
}

ulong fMaxi(ulong l, ulong h, ulong clist[])
{
ulong biggest, i;
biggest = l;
for(i = l + 1;i<=h;i++)
{
if(clist[i] > clist[biggest]) biggest = i;
else ;
}
return biggest;
}

Code: Select all

#include<iostream>
#include<algorithm>
using namespace std;

long long int ackermann(long long int x)
{
	long long int len=0;
	while(x>1)
	{
	if(x%2==0)
		x=x/2;
	else
		x=3*x+1;
		len++;
	}
	return len;
}

int main()
{
long long int value,num1,num2,length,clen,u,v;
while(cin>>u>>v)
{
	if(u==0 && v==0)
		break;
	if(u>v)
	{
	num1=v;
	num2=u;}
	else
	{
	num1=u;
	num2=v;}
	length=ackermann(num1);
	value=num1;
	for(long long int i=num1+1;i<=num2;i++)
		{
		 clen=ackermann(i);
			if(clen>length)
			{
					length=clen;
					value=i;		
			}
		}
	cout<<"Between "<<num1<<" and "<<num2<<", "<<value<<" generates the longest sequence of "<<length<<" values."<<endl;

}
return 0;

}

Code: Select all

#include<iostream>
#include<algorithm>
using namespace std;

long long int ackermann(long long int x)
{
	long long int len=0;
	while(x>1)
	{
	if(x%2==0)
		x=x/2;
	else
		x=3*x+1;
		len++;
	}
	return len;
}

int main()
{
long long int value,num1,num2,length,clen,u,v;
while(cin>>u>>v)
{
	if(u==0 && v==0)
		break;
	if(u>v)
	{
	num1=v;
	num2=u;}
	else
	{
	num1=u;
	num2=v;}
	length=ackermann(num1);
	value=num1;
	for(long long int i=num1+1;i<=num2;i++)
		{
		 clen=ackermann(i);
			if(clen>length)
			{
					length=clen;
					value=i;		
			}
		}
	cout<<"Between "<<num1<<" and "<<num2<<", "<<value<<" generates the longest sequence of "<<length<<" values."<<endl;

}
return 0;

}

Code: Select all

#include<stdio.h>



int main()
{

unsigned long  i,j,n,t,p,temp,count,max,n1;



while(scanf("%lu %lu",&i,&j)==2)
{	
	max=0;
	p=0;
	if(i==0 && j==0){break;}
	if(i>j)
	{
		temp=i;
		i=j;
		j=temp;
		printf("Between %lu and %lu, ",j,i);
	}
	
	else
	{
		printf("Between %lu and %lu, ",i,j);
	}
	
	
	
	n=i;
	while(n<=j)

	
	{	
		
		 count=0;
		if(n==1)
		{
			n1=3*n+1;
			count++;
		
			t=n1;
			while(t>1)
				{	
			
			
			
					if(t%2==0)
			
					{t=t/2;}
			
					else 
		
					{t=3*t+1;}
					count++;
				}
		
			if(max<count)
			{
				max=count;
				p=n;
			}
		}	 
		else
		{
		t=n;
			while(t>1)
			{	
			
			
			
			if(t%2==0)
			
				{t=t/2;}
			
			else 
		
			{	
			 t=3*t+1;}
			
						
			
			count++;
			}
		
		if(max<count)
		{
			max=count;
			p=n;
		}
		}
		
	  	n=n+1;
		
				
	}
	
	printf("%lu generates the longest sequence of %lu values.\n",p,max);
}

return 0;
}

Code: Select all

#include<stdio.h>



int main()
{

unsigned long  i,j,n,t,p,temp,count,max,n1;



while(scanf("%lu %lu",&i,&j)==2)
{	
	max=0;
	p=0;
	if(i==0 && j==0){break;}
	if(i>j)
	{
		temp=i;
		i=j;
		j=temp;
		printf("Between %lu and %lu, ",j,i);
	}
	
	else
	{
		printf("Between %lu and %lu, ",i,j);
	}
	
	
	
	n=i;
	while(n<=j)

	
	{	
		
		 count=0;
		if(n==1)
		{
			n1=3*n+1;
			count++;
		
			t=n1;
			while(t>1)
				{	
			
			
			
					if(t%2==0)
			
					{t=t/2;}
			
					else 
		
					{t=3*t+1;}
					count++;
				}
		
			if(max<count)
			{
				max=count;
				p=n;
			}
		}	 
		else
		{
		t=n;
			while(t>1)
			{	
			
			
			
			if(t%2==0)
			
				{t=t/2;}
			
			else 
		
			{	
			 t=3*t+1;}
			
						
			
			count++;
			}
		
		if(max<count)
		{
			max=count;
			p=n;
		}
		}
		
	  	n=n+1;
		
				
	}
	
	printf("%lu generates the longest sequence of %lu values.\n",p,max);
}

return 0;
}