Cod sursa(job #2606321)

Utilizator lev.tempfliTempfli Levente lev.tempfli Data 27 aprilie 2020 15:25:41
Problema Radix Sort Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.06 kb
#include <bits/stdc++.h>
	
#define LAST_BYTE(x) ((x >> (dv * 8)) & (0xff))
	
 
	
using namespace std;
	
ifstream fin("radixsort.in");
	
ofstream fout("radixsort.out");
	
 
	
int n, a, b, c;
	
int nums[10000000], cnt[256], ind[256];
	
 
	
void radixBy(int dv, int a[], int b[]);
	
 
	
int main()
	
{
	
 
	
    fin >> n >> a >> b >> c;
	
    nums[0] = b % c;
	
 
	
    for(int i = 1; i < n; i++){
	
        nums[i] = (1LL * a * nums[i - 1] + b) % c;
	
    }
	
 
	
    int* trash = new int[n];
	
 
	
    for(int i = 0; i < 4; ++i){
	
        if(i % 2 == 0) radixBy(i, nums, trash);
	
        else radixBy(i, trash, nums);
	
    }
	
 
	
    for(int i = 0; i < n; i += 10){
	
        fout << nums[i] << " ";
	
    }
	
 
	
    return 0;
	
}
	
 
	
void radixBy(int dv, int a[], int b[]){
	
    memset(cnt, 0, sizeof(cnt));
	
 
	
    for(int i = 0; i < n; i++){
	
        ++cnt[LAST_BYTE(a[i])];
	
    }
	
    ind[0] = 0;
	
 
	
    for(int i = 1; i < 258; i++) ind[i] = ind[i - 1] + cnt[i - 1];
	
 
	
    for(int i = 0; i < n; i++){
	
        b[ind[LAST_BYTE(a[i])]++] = a[i];
	
    }
	
 
	
}