compile visual studio c++ online

Language: Layout:

#include <iostream>
#include <cstdlib>
#include <ctime>
#include <Windows.h>
#include <algorithm>
#include <numeric>
#include <iterator>

namespace disch
{
    namespace
    {
        unsigned state = 0;
    }

void srand( unsigned seed )
    {
        state = seed;
    }

unsigned rand( )
    {
        return state = ( 69069 * state ) + 362437;
    }
}

const int N = 6 ;
void analyse( const char* tag, const unsigned int(&seq)[N] )
{
    std::cout << tag << ": " ;
    for( auto v : seq ) std::cout << v << ' ' ;
    std::cout << "\nsorted? " << std::boolalpha << std::is_sorted( seq, seq + N ) << '\n' ;
    std::cout << "adjacent difference: " ;
    unsigned int diff[ N ] ;
    std::adjacent_difference( seq, seq + N, diff ) ;
    std::copy( diff+1, diff+N, std::ostream_iterator<unsigned int>( std::cout, " " ) ) ;
    std::cout << "\n\n" ;
}

int main( )
{
    unsigned int rand[N], high[ N ], low[ N ] ;

for( int i = 0 ; i < N ; ++i )
    {
        disch::srand( std::time( nullptr ) ) ;
        const auto r = disch::rand( ) ;
        rand[ i ] = r ;
        high[ i ] = r >> 16 ;
        low[ i ] = r & 0xffff ;
        Sleep( 1000 ) ;
    }

analyse( "disch rand", rand ) ;
    analyse( "high order bits of disch rand", high ) ;
    analyse( "low order bits of disch rand", low ) ;
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 1.98 sec, absolute running time: 6.14 sec, absolute service time: 8.13 sec