#include <iostream.h>
#include <time.h>
void init_mm( );
int number_range( int from, int to );
int number_mm( void );
static	int	rgiState[2+55]; // leave this alone
int main()


    {
    	init_mm(); //seed the number generator
    	int random = number_range( 0, 1 );
    	cout << random << endl;
}
int number_mm( void )


    {
    int *piState;
    int iState1;
    int iState2;
    int iRand;
    piState		= &rgiState[2];
    iState1	 	= piState[-2];
    iState2	 	= piState[-1];
    iRand	 	= ( piState[iState1] + piState[iState2] )
    			& ( ( 1 << 30 ) - 1 );
    piState[iState1]	= iRand;
    if ( ++iState1 == 55 )
    	iState1 = 0;
    if ( ++iState2 == 55 )
    	iState2 = 0;
    piState[-2]		= iState1;
    piState[-1]		= iState2;
    return iRand >> 6;
}
/*
* Generate a random number.
*/
int number_range( int from, int to )


    {
    int power;
    int number;
    if ( ( to = to - from + 1 ) <= 1 )
    	return from;
    for ( power = 2; power < to; power <<= 1 )
    	;
    while ( ( number = number_mm( ) & ( power - 1 ) ) >= to )
    	;
    return from + number;
}
/*
* This is the Mitchell-Moore algorithm from Knuth Volume II.
*/
void init_mm( )


    {
    int *piState;
    int iState;
    piState	= &rgiState[2];
    piState[-2]	= 55 - 55;
    piState[-1]	= 55 - 24;
    piState[0]	= ( (int) time( NULL ) ) & ( ( 1 << 30 ) - 1 );
    piState[1]	= 1;
    for ( iState = 2; iState < 55; iState++ )


        {
        	piState[iState] = ( piState[iState-1] + piState[iState-2] )
        			& ( ( 1 << 30 ) - 1 );
    }
    return;
}

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

void init_mm();
int number_mm(void);

//
// Put your implementations of init_mm() and number_mm() somewhere in this file
//
double dran(double lower, double upper)
{
    const unsigned int ranmax = 0x00ffffff; //This is for the function you posted
    unsigned int iran = number_mm();
    return lower + (upper - lower)*iran /(ranmax+1.0);
}


int main()
{

    double xran;

    double a = 0.1;
    double b = 10.0;

    double minval = b;
    double maxval = a;
    double sum = 0;

    int n = 1000000; // Generate a million variates

    init_mm();

    cout << fixed;
    for (int i = 0; i < n; i++) {
        xran = dran(a, b);
        if (i < 20) { //Print out the first twenty
            cout << setw(10) << xran;
            if (i % 5 == 4) {
                cout << endl;
            }
        }
        sum += xran;
        if (xran < minval) {
            minval = xran;
        }
        else if (xran > maxval) {
            maxval = xran;
        }
    }
    cout << endl;
    cout << fixed;
    cout << "a      = " << setw(11) << a
         << ", b      = "  << setw(11) << b << endl;
        
    cout << "minval = " << setw(11) << minval
         << ", maxval = " << setw(11) << maxval << endl
         << endl;

    cout << "sum = " << sum << ", average = " << sum/n << endl;

    return 0;
}