Cod sursa(job #1750905)
| Utilizator | Data | 31 august 2016 14:07:44 | |
|---|---|---|---|
| Problema | Radix Sort | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
#define NMAX 10000000
using namespace std;
int N, A, B, C, numbers[NMAX];
int main() {
freopen("radixsort.in", "r", stdin);
freopen("radixsort.out", "w", stdout);
scanf("%d%d%d%d", &N, &A, &B, &C);
numbers[0] = B;
for (int it = 1; it < N; ++it) {
numbers[it] = (A * numbers[it - 1] + B) % C;
}
sort(numbers, numbers + N);
for (int it = 0; it < N; it += 10) {
printf("%d ", numbers[it]);
}
return 0;
}
