Pagini recente » Cod sursa (job #259679) | Cod sursa (job #725772) | Cod sursa (job #2918588) | Cod sursa (job #2524985) | Cod sursa (job #1843178)
#include <iostream>
#include <fstream>
#define NMAX 10000005
using namespace std;
ifstream si("radixsort.in");
ofstream so("radixsort.out");
int n,cont[260];
int x[NMAX];
int fin[NMAX];
int gr(int i,int c)
{
return ((x[i]>>(8*c))&255);
}
void radix(int c)
{
int i;
for(i=0;i<256;++i)
cont[i]=0;
for(i=1;i<=n;++i)
{
++cont[gr(i,c)];
}
for(i=1;i<256;++i)
cont[i]+=cont[i-1];
for(i=n;i;--i)
{
fin[cont[gr(i,c)]]=x[i];
--cont[gr(i,c)];
}
for(i=1;i<=n;++i)
x[i]=fin[i];
}
int main()
{
int a,b,c;
si>>n>>a>>b>>c;
for(int i=1;i<=n;++i)
x[i]=(1LL*x[i-1]*a+b)%c;
for(int i=0;i<4;++i)
{
radix(i);
}
for(int i=1;i<=n;i+=10)
so<<x[i]<<' ';
return 0;
}