Cod sursa(job #2136531)
Utilizator | Data | 19 februarie 2018 22:54:39 | |
---|---|---|---|
Problema | Radix Sort | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
int N, A, B, C, i, v[10000000];
std :: queue<int> b[256];
main()
{
std :: ifstream("radixsort.in") >> N >> A >> B >> C;
*v = B;
for(i = 1; i < N; v[i] = (1LL * v[i++ - 1] * A + B) % C);
for(A = 0; A < 4; ++A)
{
for(i = B = 0; i != N; b[v[i] >> A * 8 & 255].push(v[i++]);)
for(i = 0; i < 256; ++i)
for(; !b[i].empty(); v[B++] = b[i].front(), b[i].pop());
}
std :: ofstream o("radixsort.out");
for(i = 0; i < N; i += 10) o << v[i] << ' ';
}