Cod sursa(job #1740944)
| Utilizator | Data | 12 august 2016 15:59:26 | |
|---|---|---|---|
| Problema | Radix Sort | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int a,b,c,n,i,j,v[10000010],u[10001000],f[256];
int main()
{
fin>>n>>a>>b>>c;
v[1]=b;
for(i=2;i<=n;i++)
v[i]=(1LL*a*v[i-1]+b)%c;
for(i=0;i<31;i+=8){
memset(f,0,sizeof(f));
for(j=1;j<=n;j++)
f[(v[j]>>i)&255]++;
for(j=1;j<=255;j++)
f[j]+=f[j-1];
for(j=n;j;j--)
u[f[(v[j]>>i)&255]--]=v[j];
for(j=n;j;j--)
v[j]=u[j];
}
for(j=1;j<=n;j+=10)
fout<<v[j]<<" ";
return 0;
}
