Pagini recente » Cod sursa (job #928344) | Profil florinhaja | Cod sursa (job #2236166) | Cod sursa (job #2008107) | Cod sursa (job #2308305)
#include <fstream>
using namespace std;
ifstream in("radixsort.in");
ofstream out("radixsort.out");
int n,a,b,c,v[2][10000001],d[256],e[256];
int main()
{ in>>n>>a>>b>>c;
v[0][0]=b;
for(int i=1;i<n;i++)
v[0][i]=(a*v[0][i-1]+b)%c;
for(int i=0;i<4;i++)
{ for(int j=0;j<n;j++)
d[(v[i%2][j]>>(i*8))&255]++;
e[0]=0;
for(int j=1;j<256;j++)
e[j]=e[j-1]+d[j-1];
for(int j=0;j<n;j++)
v[(i+1)%2][e[(v[i%2][j]>>(i*8))&255]++]=v[i%2][j];
}
for(int i=0;i<n;i+=10)
out<<v[0][i]<<" ";
in.close();
out.close();
return 0;
}