Pagini recente » Cod sursa (job #2804450) | Cod sursa (job #2796750) | Cod sursa (job #2032854) | Cod sursa (job #1272220) | Cod sursa (job #1723120)
#include<fstream>
#include<cstring>
using namespace std;
ifstream in("radixsort.in");
ofstream out("radixsort.out");
const int nmax = 10000006;
int p, x[nmax], v[nmax], a, b, c, n, poz[260];
int cifra( int nr, int p ){
return( (nr>>p) & 255 );
}
int main(){
int player_unu=0;
in>>n>>a>>b>>c;
v[1] = b;
for(int i = 2; i<=n; i++)
{
v[i] = (a * 1LL * v[i - 1] + b) % c;
}
p = 0;
for(int t = 1; t<=4; t++)
{
memset(poz, 0, sizeof(poz));
for(int i = 1; i<=n; i++)
{
poz[cifra(v[i], p)]++;
}
for(int i = 1; i<=255; i++)
{
poz[i] += poz[i - 1];
}
for(int i = n; i>=1; i--)
{
x[ poz[cifra(v[i], p)]--] = v[i];
}
memcpy( v, x, sizeof( x ) );
p += 8;
}
for(int i = 1; i <= n; i += 10)
{
out << v[i] << " ";
}
return player_unu;
}