Pagini recente » Cod sursa (job #1709933) | Cod sursa (job #903814) | Cod sursa (job #234969) | Cod sursa (job #2956289) | Cod sursa (job #2451377)
#include <fstream>
#include <string.h>
using namespace std;
int N, A, B, C, v[10000001], aux[10000001], counter[256];
int main()
{
ios_base::sync_with_stdio(false);
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
fin >> N >> A >> B >> C;
v[0] = B % C;
for(int i = 1; i < N; i++) v[i] = ((1LL * A * v[i - 1] + B) % C);
for(int byte = 0; byte <= 3; byte++)
{
memset(counter, 0, sizeof counter);
for(int i = 0; i < N; i++) counter[(v[i] >> (byte * 8)) & 255] ++;
for(int i = 1; i <= 255; i++) counter[i] += counter[i - 1];
for(int i = N - 1; i >= 0; i--) aux[--counter[(v[i] >> (byte * 8)) & 255]] = v[i];
for(int i = 0; i < N; i++) v[i] = aux[i];
}
for(int i = 0; i < N; i += 10) fout << v[i] << " ";
}