Pagini recente » Cod sursa (job #497225) | Cod sursa (job #2219809) | Cod sursa (job #2987871) | Cod sursa (job #17403) | Cod sursa (job #2343040)
#pragma GCC optimize("03")
#include <bits/stdc++.h>
using namespace std;
ifstream in("radixsort.in");
ofstream out("radixsort.out");
int n;
int a, b, c, v[10000100], tp, idx[256], counter[256], aux[10000010];
vector <int> w[256];
int main() {
in >> n >> a >> b >> c;
v[1] = b;
for (int i = 2; i <= n; i++)
v[i] = (1LL * a * v[i - 1] + b) % c;
for (int os = 0; os < 4; os++) {
memset(counter, 0, sizeof counter);
for (int i = 1; i <= n; i++)
counter[(v[i] >> (8 * os)) & 255]++;
idx[0] = 0;
for (int i = 1; i < 256; i++)
idx[i] = idx[i - 1] + counter[i - 1];
for (int i = 1; i <= n; i++)
aux[++idx[(v[i] >> (8 * os)) & 255]] = v[i];
memcpy(v, aux, sizeof(v));
}
for (int i = 1; i <= n; i += 10)
out << v[i] << ' ';
return 0;
}