Cod sursa(job #3327669)

Utilizator calinulCalin Cernat calinul Data 4 decembrie 2025 18:53:22
Problema Radix Sort Scor 30
Compilator c-64 Status done
Runda Arhiva educationala Marime 0.91 kb
#include <stdio.h>

#define NMAX 10000000

int v[NMAX];

static inline void swap( int *a, int *b ) {
  int aux = *a;
  *a = *b;
  *b = aux;
}

void rs( int v[], int begin, int end, int bit ) {
  int p = begin, i;

  if ( begin < end && bit >= 0 ) {
    for ( i = begin; i <= end; i++ )
      if ( (v[i] & (1 << bit)) == 0 ) {
        swap( &v[p], &v[i] );
        p++;
      }
    rs( v, begin, p - 1, bit - 1 );
    rs( v, p, end, bit - 1 );
  }
}

int main() {
  FILE *fin, *fout;
  int n, a, b, c, i;

  fin = fopen( "radixsort.in", "r" );
  fscanf( fin, "%d%d%d%d", &n, &a, &b, &c );
  fclose( fin );

  v[0] = b;
  for ( i = 1; i < n; i++ )
    v[i] = ((long long)a * v[i - 1] + b) % c;

  rs( v, 0, n - 1, 30 );

  fout = fopen( "radixsort.out", "w" );
  for ( i = 0; i < n; i += 10 )
    fprintf( fout, "%d ", v[i] );
  fputc( '\n', fout );
  fclose( fout );

  return 0;
}