Pagini recente » Cod sursa (job #2361995) | Cod sursa (job #103134) | Cod sursa (job #1441982) | Cod sursa (job #2660948) | Cod sursa (job #2608656)
/*
`-/oo+/- ``
.oyhhhhhhyo.`od
+hhhhyyoooos. h/
+hhyso++oosy- /s
.yoooossyyo:``-y`
..----.` ``.-/+:.`
`````..-::/.
`..```.-::///`
`-.....--::::/:
`.......--::////:
`...`....---:::://:
`......``..--:::::///:`
`---.......--:::::////+/`
----------::::::/::///++:
----:---:::::///////////:`
.----::::::////////////:-`
`----::::::::::/::::::::-
`.-----:::::::::::::::-
...----:::::::::/:-`
`.---::/+osss+:`
``.:://///-.
*/
#include <fstream>
using namespace std;
ifstream in ("radixsort.in");
ofstream out ("radixsort.out");
const int N = 1e7;
const int B = 10000;
const int NC = 10;
int v[5 + N];
int nr[5 + NC], poz[5 + B], aux[5 + N];
int main() {
int n, a, b, c, p;
in >> n >> a >> b >> c;
v[1] = b;
for(int i = 2; i <= n; i++)
v[i] = (1LL * a * v[i - 1] + b) % c;
p = 1;
for(int k = 1; k <= NC; k++) {
for(int j = 0; j < B; j++)
nr[j] = 0;
for(int i = 1; i <= n; i++)
nr[v[i] / p % 10]++;
poz[0] = 0;
for(int i = 1; i < B; i++)
poz[i] = poz[i - 1] + nr[i - 1];
for(int i = 1; i <= n; i++)
aux[++poz[v[i] / p % 10]] = v[i];
for(int i = 1; i <= n; i++)
v[i] = aux[i];
p *= 10;
}
for(int i = 1; i <= n; i += 10) {
out << v[i] << " ";
}
out << '\n';
return 0;
}