OJ Board

ayaw wrote:Hope this'll help u

Code: Select all

#include <stdio.h>

#define MAXNUM 100000

int g_stack[MAXNUM] = {0,};
int g_swap = 0;

int main(int argc, char* argv[])
{
	while( 1 )
	{
		long int nFrom, nTo;

		while( 2 == scanf( "%ld %ld", &nFrom, &nTo ) )
		{
			int nMaxCount = 0;
			long int n;

			if( nFrom > nTo )
			{
				long int temp;
				temp = nTo;
				nTo = nFrom;
				nFrom = temp;
				g_swap = 1;
			}

			if (nFrom<=837799 && nTo>=837799) 
		    { 
				printf("%ld %ld %d\n",nFrom,nTo,525); 
				continue; 
			} 
			if (nFrom<=626331 && nTo>=626331) 
			{ 
				printf("%ld %ld %d\n",nFrom,nTo,509); 
				continue; 
			} 
			if (nTo<626331 && nFrom<=511935 && nTo>=511935) 
			{ 
				printf("%ld %ld %d\n",nFrom,nTo,470); 
				continue; 
			} 
			if (nTo<511935 && nFrom<=410011 && nTo>=410011) 
			{ 
				printf("%ld %ld %d\n",nFrom,nTo,449); 
				continue; 
			} 
			if (nTo<410011 && nFrom<=230631 && nTo>=230631) 
			{ 
				printf("%ld %ld %d\n",nFrom,nTo,443); 
				continue; 
			} 

			for( n = nFrom ; n <= nTo ; n++ )
			{
				long int nValue = n;
				int nCount = 0;

				while( 1 )
				{
					nCount++;

					if( 1 == nValue ) 
						break;
					else 
					{
						if( nValue<MAXNUM && (g_stack[nValue] != 0) )
						{
							nCount += g_stack[nValue]-1;

							break;
						}
						else
						{
							if( nValue & 1 )
								nValue = nValue * 3 +1;
							else
								nValue >>= 1;
						}
					}
				}
				
				if( nMaxCount < nCount )
					nMaxCount = nCount;

				if( n<MAXNUM && (g_stack[n] == 0) )
					g_stack[n] = nCount;
			}

			if( g_swap )
				printf( "%ld %ld %ld\n", nTo, nFrom, nMaxCount );
			else
				printf( "%ld %ld %ld\n", nFrom, nTo, nMaxCount );
		}
		
		break;
	}

	return 0;
}

This problem is very easy to solve. But unless you think with care, you will got WA.

01624693_24.c:38: syntax error before `!'

/*   @JUDGE_ID:   xxxxxxx   100   C++ */
#include <stdio.h>

long int cycle,biggest;

void findlength(long int n)
{
 cycle++;

 if(n==1) return;

 if(n%2==1) n=3*n+1;
 else n=n/2;

 findlength(n);

 if(cycle>biggest) biggest=cycle;
}

int main()
{
      long int i,j;
      while(1)
      {
       biggest=0;
       scanf("%ld %ld",&i,&j);
       for(int k=i;k<=j;k++)
       {
        cycle=0;
        findlength(k);
       }
       printf("%ld %ld %ld",i,j,biggest);
      }
      return 0;
}

$ gcc -ansi -Wall -o 100 100.c
100.c: In function `main':
100.c:27: parse error before `int'
100.c:27: `k' undeclared (first use in this function)
100.c:27: (Each undeclared identifier is reported only once
100.c:27: for each function it appears in.)
100.c:27: warning: statement with no effect
100.c:27: parse error before `)'
100.c: At top level:
100.c:34: parse error before `return'

simple is smart.