Pagini recente » Cod sursa (job #2617546) | Cod sursa (job #869137) | Cod sursa (job #2220961) | Cod sursa (job #633424) | Cod sursa (job #1504620)
#include <cstdio>
#define baza 2
using namespace std;
int n,a,b,c,maxim,ptx;
int v[10000006],out[10000006];
int ct[20];
void counting()
{
for(int i=0;i<16;i++) ct[i]=0;
for(int i=1;i<=n;i++) ct[(v[i]>>ptx)&15]++;
for(int i=1;i<16;i++) ct[i]+=ct[i-1];
for(int i=n;i>=1;i--)
{
int nr=(v[i]>>ptx)&15;
out[ct[nr]]=v[i];
ct[nr]--;
}
for(int i=1;i<=n;i++) v[i]=out[i];
}
void radix()
{
ptx=0;
for(ptx=0;ptx<32;ptx+=4)
{
counting();
}
}
int main()
{
freopen ("radixsort.in","r",stdin);
freopen ("radixsort.out","w",stdout);
scanf("%d%d%d%d",&n,&a,&b,&c);
// for(int i=1;i<=n;i++) scanf("%d",&v[i]);
v[1]=b;
for(int i=2;i<=n;i++)
{
v[i]=(1LL*a*v[i-1]+b)%c;
if(maxim<v[i]) maxim=v[i];
}
radix();
for(int i=1;i<=n;i+=10) printf("%d ",v[i]);
}