Pagini recente » Cod sursa (job #1787730) | Cod sursa (job #106640) | Cod sursa (job #1117664) | Cod sursa (job #346508) | Cod sursa (job #1145946)
#include <cstdio>
#include <vector>
#define Nmax 10000005
using namespace std;
int N, A, B, C;
vector <int> V;
void Citire()
{
long long tz;
scanf("%d %d %d %d", &N, &A, &B, &C);
V.push_back(B);
for (int i = 1; i < N; ++i)
{
tz = 1LL * A * V[i - 1];
tz = (long long)(tz + B);
V.push_back(tz % C);
}
}
void Sortare(int g)
{
vector <int> L[260];
int nr, b = 8;
b = b * g;
for (int i = 0; i < N; ++i)
{
nr = (V[i] >> b) & 255;
L[nr].push_back(V[i]);
}
V.clear();
for (int i = 0; i <= 255; ++i)
{
for (vector <int> :: iterator it = L[i].begin(); it != L[i].end(); ++it)
V.push_back(*it);
}
}
void Afisare()
{
for (int i = 0; i < N; i += 10)
printf("%d ", V[i]);
}
int main()
{
freopen("radixsort.in", "r", stdin);
freopen("radixsort.out", "w", stdout);
Citire();
for (int i = 0; i <= 3; ++i)
Sortare(i);
Afisare();
return 0;
}