Pagini recente » Cod sursa (job #89008) | Cod sursa (job #1850978) | Cod sursa (job #1393660) | Cod sursa (job #875113) | Cod sursa (job #2644036)
#include <fstream>
using namespace std;
ifstream in("radixsort.in");
ofstream out("radixsort.out");
const int dim=1<<16;
int v[10000001],n,cnt[dim+1],aux[10000001];
void sorteaza(int p)
{
int i;
for(i=1; i<=n; i++)
cnt[(v[i]>>p)%dim]++;
for(i=1; i<dim; i++)
cnt[i]+=cnt[i-1];
for(i=n; i>=1; i--)
aux[cnt[(v[i]>>p)%dim]--]=v[i];
for(i=1; i<=n; i++)
v[i]=aux[i];
}
void radixsort()
{
for(int put=0; put<2; put++)
{
sorteaza(16*put);
for(int i=0; i<dim; i++)
cnt[i]=0;
}
}
int main()
{
int a,b,c,i;
in>>n>>a>>b>>c;
v[1]=b;
for(i=2; i<=n; i++)
v[i]=(1LL*a*v[i-1]+b)%c;
radixsort();
for(i=1; i<=n; i+=10)
out<<v[i]<<" ";
return 0;
}