Mai intai trebuie sa te autentifici.
Cod sursa(job #1292415)
Utilizator | Data | 14 decembrie 2014 12:29:19 | |
---|---|---|---|
Problema | Radix Sort | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
#define lmax 10000005
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
int i,j,a,b,c,n;
int v[lmax],aux[lmax],x[256];
int main()
{
f>>n>>a>>b>>c;
for (i=1;i<=n;i++)
{
long long val=(1LL*a*v[i-1]+b)%c;
v[i]=val;
}
for (i=0;i<=24;i+=8)
{
for (j=1;j<=255;j++)
x[j]=0;
for (j=1;j<=n;j++)
x[(v[j]>>i)&255]++;
for (j=2;j<=255;j++)
x[j]+=x[j-1];
for (j=n;j>=1;j--)
aux[x[(v[j]>>i)&255]--]=v[j];
for (j=1;j<=n;j++)
v[j]=aux[j];
}
for (i=1;i<=n;i+=10)
g<<v[i]<<" ";
f.close();
g.close();
}