Pagini recente » Cod sursa (job #1099411) | Cod sursa (job #1964922) | Cod sursa (job #1342223) | Cod sursa (job #2811381) | Cod sursa (job #1370598)
#include<fstream>
#include<cstdio>
using namespace std;
ifstream fin("radixsort.in");
unsigned int k1, k2, aa, bb, cc;
unsigned int a[2][10000009], pr[256], ul[256], nr[256];
unsigned int n, i, cif, k, baza, *t1, *t2, *aux;
long long p, p1, x;
int main()
{
FILE *fout;
fout=fopen("radixsort.out","wt");
baza=256;
fin>>n>>aa>>bb>>cc;
p=8;
t1=a[0];
t1[1]=bb;
x=bb;
nr[(x>>p)%baza]++;
for(i=2;i<=n;i++)
{
x=((long long)aa*x+bb)%cc;
t1[i]=x;
nr[(x>>p)%baza]++;
}
t2=a[1];
for(k=1;k<=4;k++)
{
pr[0]=1;
ul[0]=0;
for(i=1;i<=3;i++)
{
pr[i]=pr[i-1]+nr[i-1];
ul[i]=pr[i]-1;
nr[i-1]=0;
}
nr[3]=0;
p1=p+8;
for(i=1;i<=n;i++)
{
x=t1[i];
cif=(x>>p)%baza;
ul[cif]++;
t2[ul[cif]]=x;
nr[(x>>p1)%baza]++;
}
p=p1;
aux=t1;
t1=t2;
t2=aux;
}
for(i=1;i<=n;i=i+10)
{
fprintf(fout,"%u ",t1[i]);
}
fclose(fout);
fin.close();
return 0;
}