Pagini recente » Cod sursa (job #3357796) | Cod sursa (job #3357720) | Monitorul de evaluare | Atasamentele paginii Profil ianstefancazacu | Cod sursa (job #3357952)
#include <fstream>
using namespace std;
int v[10000005];
int temp[10000005];
int cnt[256];
int main() {
ifstream cin("radixsort.in");
ofstream cout("radixsort.out");
int n;
unsigned int a, b, c;
cin >> n >> a >> b >> c;
v[1] = b;
for (int i = 2; i <= n; ++i) {
v[i] = (1LL * a * v[i - 1] + b) % c;
}
for (int k = 0; k < 4; ++k) {
int shift = k * 8;
for (int i = 0; i < 256; ++i) {
cnt[i] = 0;
}
for (int i = 1; i <= n; ++i) {
cnt[(v[i] >> shift) & 255]++;
}
for (int i = 1; i < 256; ++i) {
cnt[i] += cnt[i - 1];
}
for (int i = n; i >= 1; --i) {
temp[cnt[(v[i] >> shift) & 255]--] = v[i];
}
for (int i = 1; i <= n; ++i) {
v[i] = temp[i];
}
}
for (int i = 1; i <= n; i += 10) {
cout << v[i] << " ";
}
return 0;
}