Pagini recente » Cod sursa (job #1409655) | Cod sursa (job #911150) | Cod sursa (job #2766340) | Cod sursa (job #470841) | Cod sursa (job #2055190)
#include <bits/stdc++.h>
using namespace std;
ifstream fi("radixsort.in");
ofstream fo("radixsort.out");
#define MAX 10000000
int v[MAX], w[MAX];
void radix(int n, int v[], int w[], int bit) {
int x[0x10000]; memset(x, 0, sizeof x);
for (int i = 0; i < n; i++) x[(v[i] >> bit) & 0xff]++;
for (int i = 0xffff; i > 0; i--) x[i] = x[i - 1]; x[0] = 0;
for (int i = 1; i < 0x10000; i++) x[i] += x[i - 1];
for (int i = 0; i < n; i++) w[x[(v[i] >> bit) & 0xff]++] = v[i];
}
int main() {
int n, a, b, c; fi >> n >> a >> b >> c;
v[0] = b;
for (int i = 1; i < n; i++) v[i] = (1LL * a * v[i - 1] + b) % c;
radix(n, v, w, 0);
radix(n, w, v, 16);
for (int i = 0; i < n; i += 10) fo << v[i] << ' ';
}