Pagini recente » Cod sursa (job #2169085) | Cod sursa (job #292606) | Cod sursa (job #1820008) | Cod sursa (job #1536445) | Cod sursa (job #3204953)
#include <bits/stdc++.h>
#define N_MAX 10000001
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int v[N_MAX];
int n, a, b, c;
int maxim;
int main()
{
fin >> n >> a >> b >> c;
v[0] = b;
maxim = b;
for (int i = 1; i < n; i++)
{
v[i] = (1LL * v[i - 1] * a + b) % c;
maxim = max(maxim, v[i]);
}
for (int MOD = 1; maxim / MOD > 0; MOD *= 10)
{
int salvare[N_MAX];
int frecventa[10];
memset(frecventa, 0, sizeof(frecventa));
for (int i = 0; i < n; i++)
{
frecventa[(v[i] / MOD) % 10]++;
}
for (int i = 1; i <= 9; i++)
frecventa[i] += frecventa[i - 1];
for (int i = n - 1; i >= 0; i--)
{
salvare[frecventa[(v[i] / MOD) % 10] - 1] = v[i];
frecventa[(v[i] / MOD) % 10]--;
}
swap(salvare, v);
}
for (int i = 0; i < n; i += 10)
fout << v[i] << " ";
}