Pagini recente » Cod sursa (job #13838) | Cod sursa (job #2176438) | Cod sursa (job #2230691) | Cod sursa (job #1835113) | Cod sursa (job #1402665)
#include <cstdio>
#include <vector>
using namespace std;
int N, A, B, C;
vector <int> V;
void citire()
{
scanf("%d %d %d %d", &N, &A, &B, &C);
V.push_back(B);
for (int i = 2; i <= N; ++i)
V.push_back((A * V.back() + B) % C);
}
void rezolvare()
{
int rez, mask = 255;
vector <int> :: iterator it;
vector <int> lista[260];
for (int bucata = 0; bucata <= 3; ++bucata)
{
for (it = V.begin(); it != V.end(); ++it)
{
rez = (mask & *it) >> (bucata * 8);
lista[rez].push_back(*it);
}
V.clear();
for (int i = 0; i <= 255; ++i)
{
for (it = lista[i].begin(); it != lista[i].end(); ++it)
{
V.push_back(*it);
}
lista[i].clear();
}
mask = mask << 8;
}
for (it = V.begin(); it != V.end(); it += 10)
printf("%d ", *it);
}
int main()
{
freopen("radixsort.in", "r", stdin);
freopen("radixsort.out", "w", stdout);
citire();
rezolvare();
return 0;
}