Pagini recente » Cod sursa (job #1325320) | Cod sursa (job #2519456) | Cod sursa (job #3146711) | Cod sursa (job #2294929) | Cod sursa (job #1094296)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
vector <int> R[2][256];
int x, bits = 255,n,a,b,c,t;
int main()
{
fin>>n>>a>>b>>c;
x = b;
R[0][bits&x].push_back (x);
for (int i=2; i<=n; ++i)
{
x = (a*x + b)%c;
R[0][bits&x].push_back (x);
}
for (int i=1,ok=0; i<=3; ok = 1-ok,++i)
{
for (int j=0; j<256; ++j)
{
for (int k=0; k < R[ok][j].size(); ++k)
{
int x = R[ok][j][k];
R[1-ok][(x>>(i*8))&bits].push_back (x);
}
R[ok][j].clear();
}
}
for (int j=0; j<256; ++j)
{
for (int k=0; k<R[1][j].size(); ++k)
{
++t;
if (t%10==1)
fout<<R[1][j][k]<<" ";
}
}
}