Pagini recente » Cod sursa (job #673525) | Cod sursa (job #2005607) | Cod sursa (job #2240040) | Cod sursa (job #352898) | Cod sursa (job #2619787)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
int v[10000002];
void radixSort(int v[],int dim)
{
int i,j,fr[256]={0},mapp[256],aux[dim],temp;
for(i=0; i<32; i+=8)
{
for(j=0; j<dim; j++)
{
fr[(v[j]>>i)&255]++;
aux[j]=v[j];
}
mapp[0]=0;
for(j=1; j<256; j++)
mapp[j]=mapp[j-1]+fr[j-1];
for(j=0; j<dim; j++)
{
temp=(aux[j]>>i)&255;
v[mapp[temp]++]=aux[j];
}
}
}
int main()
{
long long int n,a,b,c,i;
f>>n>>a>>b>>c;
v[0] = b;
for(i=1; i<n; i++)
v[i] = (a*v[i-1]+b)%c;
radixSort(v,n);
for(i=0; i<n; i+=10)
g<<v[i]<<" ";
return 0;
}