🚀 go-pugleaf

Marco de Boer wrote:
> Hi Lovens Weche,
> 
> Just another simple lotto generator (balls out of 45) and sorted
> 
> Good luck, Marco
> 
> /*
> * Lotto Generator
> */
> 
> #include <stdio.h>
> #include <stdlib.h>
> #include <time.h>
> 
> #define RAND(x)     ((size_t)((x)*rand()/(1.0+RAND_MAX)))
> #define SWAP(t,a,b) {t _Swap=a;a=b;b=_Swap;}
> 
> static void Lotto(size_t*,size_t,size_t);
> static int Compare(const void*,const void*);
> 
> int main()
> {
>     size_t *Array,iDrawing,iCount,iTotal;
> 
>     srand((unsigned int)time(NULL));
>     iCount=6;
>     iTotal=45;
>     if ( (Array=calloc(iTotal,sizeof(size_t)))==NULL ) return 1;
>     for ( iDrawing=0; iDrawing<20; iDrawing++ ) Lotto(Array,iCount,iTotal);
>     free(Array);
>     return 0;
> }
> 
> static void Lotto(size_t *Array,size_t iCount,size_t iTotal)
> {
>     size_t i,j;
> 
>     for ( i=0; i<iTotal; i++ ) Array[i]=i+1;
>     for ( i=0; i<iCount; i++ ) {
>         j=i+RAND(iTotal-i);
>         SWAP(size_t,Array[i],Array[j]);
>     }
>     qsort(Array,iCount,sizeof(size_t),Compare);
>     for ( i=0; i<iCount; i++ )
> (void)fprintf(stdout,"%2d%c",Array[i],(i+1==iCount)?'\n':' ');
>     return;
> }
> 
> static int Compare(const void *a,const void *b)
> {
>     return (*(size_t**)a<*(size_t**)b)?-1:1;
> }
> 
> 

I suppose this combination has as much chance as any of occuring:
Hardy: $ ./lotto
  1  2  3  4  5  6
  1  2  3  4  6  7
  1  2  3  4  5  7
  1  2  4  5  6  7
  1  2  3  4  5  6
  1  2  4  5  6  7
  1  2  3  4  5  6
  1  2  3  4  6  7
  1  2  3  4  5  6
  1  2  3  4  6  7
  1  2  3  4  5  6
  1  2  3  4  5  7
  1  2  3  4  5  7
  1  2  3  4  5  7
  1  2  3  4  5  6
  1  2  3  4  5  6
  1  2  3  4  5  6
  1  2  3  4  5  7
  1  2  3  4  5  6
  1  2  3  4  5  7