Pagini recente » Cod sursa (job #1937900) | Cod sursa (job #1944090) | Cod sursa (job #325866) | Cod sursa (job #267551) | Cod sursa (job #1402656)
#include <cstdio>
#include <vector>
#define NMAX 10000005
using namespace std;
int V[NMAX], N, A, B, C;
vector <int> lista[256];
void citire()
{
scanf("%d %d %d %d", &N, &A, &B, &C);
V[1] = B;
for (int i = 2; i <= N; ++i)
V[i] = (A * V[i - 1] + B) % C;
}
void rezolvare()
{
int rez, mask = 255, cnt;
vector <int> :: iterator it;
for (int bucata = 0; bucata <= 3; ++bucata)
{
for (int i = 1; i <= N; ++i)
{
rez = (mask & V[i]) >> (bucata * 8);
lista[rez].push_back(V[i]);
}
cnt = 0;
for (int i = 0; i <= 255; ++i)
{
for (it = lista[i].begin(); it != lista[i].end(); ++it)
{
V[++cnt] = *it;
}
lista[i].clear();
}
mask = mask << 8;
}
for (int i = 1; i <= N; i += 10)
printf("%d ", V[i]);
}
int main()
{
freopen("radixsort.in", "r", stdin);
freopen("radixsort.out", "w", stdout);
citire();
rezolvare();
return 0;
}