Pagini recente » Cod sursa (job #2750358) | Cod sursa (job #266861) | Cod sursa (job #434361) | Cod sursa (job #1452301) | Cod sursa (job #1402706)
#include <cstdio>
#include <vector>
#define NMAX 10000001
using namespace std;
int N, V[NMAX];
void citire()
{
int A, B, C;
long long x;
scanf("%d %d %d %d", &N, &A, &B, &C);
V[1] = B;
for (int i = 2; i <= N; ++i)
{
x = (long long)A * (long long)V[i - 1] + (long long)B;
V[i] = (int)(x % C);
}
}
void rezolvare(int bucata)
{
vector <int> lista[256];
for (int i = 1; i <= N; ++i)
{
int rez = (V[i] >> (bucata * 8)) & 255;
lista[rez].push_back(V[i]);
}
V[0] = 0;
for (int i = 0; i <= 255; ++i)
for (vector <int> :: iterator it = lista[i].begin(); it != lista[i].end(); ++it)
V[++V[0]] = *it;
}
void afisare()
{
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();
for (int i = 0; i <= 3; ++i)
rezolvare(i);
afisare();
return 0;
}