Pagini recente » Cod sursa (job #505311) | Cod sursa (job #452792) | Cod sursa (job #2442906) | Cod sursa (job #524570) | Cod sursa (job #2641729)
#include <fstream>
#include <vector>
std::ifstream fin("radixsort.in");
std::ofstream fout("radixsort.out");
const int bits = 8;
const int sz = (1 << bits);
const int mask = sz - 1;
std::vector <int> v;
int n, a, b, c;
void radix()
{
std::vector <int> aux(n);
for (int i = 0; i < 4; ++i)
{
std::vector <int> cnt(sz, 0);
for (auto it : v)
++cnt[(it >> (bits * i)) & mask];
for (int j = 1; j < sz; ++j)
cnt[j] += cnt[j - 1];
for (int j = n - 1; j >= 0; --j)
aux[--cnt[(v[j] >> (bits * i)) & mask]] = v[j];
v = aux;
}
}
int main()
{
fin >> n >> a >> b >> c;
v.reserve(n);
v.push_back(b);
for (int i = 1; i < n; ++i)
v.push_back((1LL * v.back() * a + b) % c);
radix();
for (int i = 0; i < n; i += 10)
fout << v[i] << " ";
fout.close();
return 0;
}