CareerCup

linear congruential method :

  seed=sys.time();
  X(0)=seed ;

     while( i < n )
      {
         X(i+1)= { aX(i) + c )mod( 2^32-1 );
         i++;
       }

a=multiplier=31425621 ;
GCD( c , 2^32-1) should be 1 .

store random numbers in a table :
Difference generator :

ran[1...100];

i=100;
while( i<100 )
{
ran[i]=( ran[i-37] - ran[i-99] )& ( 1<<32 - 1) ;

}

store random numbers in a table :
Difference generator :

ran[1...100];

i=100;
while( i++<n )
{
ran[i]=( ran[i-37] - ran[i-99] )& ( 1<<32 - 1) ;

}

Here is the code to produce a random number (less than 65535) once every second.

#include <iostream>
#include <time.h>
#include <windows.h>
using namespace std;

#define HASHSIZE 65535

unsigned hash(char *s)
{
	unsigned hashval;
	
	for (hashval = 0; *s != '\0'; s++)
		hashval = *s + 31 * hashval;
	
	return hashval % HASHSIZE;
}

void main()
{
	while(1)
	{
	    char *date;
        time_t timer;
        timer=time(NULL);
        date = asctime(localtime(&timer));
        printf("%d    ", hash(date));
		Sleep(1000);
	}
}