Pagini recente » Cod sursa (job #1136368) | Cod sursa (job #733114) | Cod sursa (job #3294219) | Cod sursa (job #716795) | Cod sursa (job #3299289)
#include <fstream>
#include <vector>
using namespace std;
const int LIM_10 = 1e9;
const int B = 10;
void scrie(vector <int> &v, ofstream &out)
{
for (auto v_i: v)
{
out << v_i << " ";
}
out << "\n";
}
int main()
{
ifstream in("radixsort.in");
ofstream out("radixsort.out");
int n, a, b, c;
in >> n >> a >> b >> c;
vector <int> v(n);
vector <int> aux(n);
v[0] = b;
for (int i = 1; i < n; i++)
{
v[i] = ((long long)a * v[i-1] + b) % c;
}
vector <int> nr(B, 0);
vector <int> ultim(B);
long long p = 1;
//scrie(v, out);
while (nr[0] < n)
{
fill(nr.begin(), nr.end(), 0);
for (int i = 0; i < n; i++)
{
int cif = v[i] / p % B;
nr[cif]++;
}
ultim[0] = 0;
for (int cif = 1; cif < B; cif++)
{
ultim[cif] = ultim[cif-1] + nr[cif-1];
}
for (int i = 0; i < n; i++)
{
int cif = v[i] / p % B;
aux[ultim[cif]++] = v[i];
}
for (int i = 0; i < n; i++)
{
v[i] = aux[i];
}
//scrie(v, out);
p *= B;
}
int poz = 0;
while (poz < n)
{
out << v[poz] << " ";
poz += 10;;
}
in.close();
out.close();
return 0;
}