Pagini recente » Cod sursa (job #345026) | Cod sursa (job #2177444) | Cod sursa (job #762768) | Cod sursa (job #1299170) | Cod sursa (job #2499135)
#include <bits/stdc++.h>
#define mod 255
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int n,v[10000002],w[10000002],i,p;
int fr[257];
int main()
{
long long a,b,c;
fin>>n>>a>>b>>c;
v[1]=b;
for(i=2; i<=n; i++)
v[i]=(a*v[i-1]+b)%c;
for(p=0; p<=24; p+=8)
{
memset(fr,0,sizeof(fr));
fr[0]=1;
for(i=1; i<=n; i++)
fr[((v[i]>>p)&mod)+1]++;
for(i=1; i<=256; i++)
fr[i]+=fr[i-1];
for(i=1; i<=n; i++)
{
int x=v[i];
w[fr[((x>>p)&mod)]++]=x;
}
memcpy(v,w,sizeof(v));
}
for(i=1;i<=n;i+=10)
fout<<v[i]<<" ";
}