Pagini recente » Cod sursa (job #2536979) | Cod sursa (job #2970708) | Diferente pentru info-oltenia-2018/individual intre reviziile 16 si 14 | Cod sursa (job #1530139) | Cod sursa (job #2498030)
#include <fstream>
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int v[10000100],n,maxim,x,y,z,aux[10000100],frecvc[256];
int main(){
fin>>n>>x>>y>>z;
maxim=-1;
v[0]=y;
maxim=max(maxim,v[0]);
for(int i=1;i<n;i++){
v[i]=(x*v[i-1] +y)%z;
maxim=max(maxim,v[i]);
}
for(int i=1;maxim/i>0; i*=256){
for(int j=0;j<256;j++){
frecvc[j]=0;
}
for(int j=0;j<n;j++){
frecvc[(v[j]/i) % 256]++;
}
for(int j=1; j<256;j++){
frecvc[j]+=frecvc[j-1];
}
for (int j =n - 1; j>= 0; j--){
aux[frecvc[(v[j]/i) % 256]-1] = v[j];
frecvc[(v[j]/i)%256]--;
}
for (int j = 0; j < n; j++){
v[j]=aux[j];
}
}
for(int i=0;i<n;i+=10){
fout<<v[i]<<" ";
}
}