Pagini recente » Cod sursa (job #2643617) | Cod sursa (job #819717) | Cod sursa (job #2087121) | Cod sursa (job #2497051) | Cod sursa (job #2301960)
#include<cstring>
#include<fstream>
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
#define R 0xFF
int n,v[10000001],a,b,c,i,*t;
void C(int a[],int b[],int y)
{
int d[256],e[256],i;
memset(d,0,sizeof(d));
for(i=0;i<n;i++)
d[(a[i]>>(y*8))&R]++;
for(e[0]=0,i=1;i<256;i++)
e[i]=e[i-1]+d[i-1];
for(i=0;i<n;i++)
b[e[(a[i]>>(y*8))&R]++]=a[i];
}
int main()
{
f>>n>>a>>b>>c;
v[0]=b%c;
for(i=1;i<n;i++)
v[i]=(1LL*a*v[i-1]%c+b)%c;
t=new int[n];
C(v,t,0),C(t,v,1),C(v,t,2),C(t,v,3);
for(i=0;i<n;i+=10)
g<<v[i]<<' ';
}