Pagini recente » Borderou de evaluare (job #157435) | Cod sursa (job #1641603) | Cod sursa (job #1671677) | Borderou de evaluare (job #229780) | Cod sursa (job #2306555)
#include<fstream>
using namespace std;
int v[2][10000001],i,n,j,d[256],e[256];
long long a,b,c;
int main()
{
ifstream f("radixsort.in");
ofstream g("radixsort.out");
for(f>>n>>a>>b>>c,v[0][0]=b,i=1;i<n;i++)
v[0][i]=(a*v[0][i-1]+b)%c;
for(j=0;j<4;j++)
{
for(i=0;i<256;i++)
d[i]=0;
for(i=0;i<n;i++)
d[(v[j&1][i]>>(j*8))&255]++;
for(e[0]=0,i=1;i<256;i++)
e[i]=e[i-1]+d[i-1];
for(i=0;i<n;i++)
v[(j+1)&1][e[(v[j&1][i]>>(j*8))&255]++]=v[j&1][i];
}
for(i=0;i<n;i+=10)
g<<v[0][i]<<' ';
}