Pagini recente » Cod sursa (job #1072298) | Cod sursa (job #1140680) | Cod sursa (job #2334174) | Cod sursa (job #2892439) | Cod sursa (job #1547882)
#include <fstream>
#include <string.h>
#define RADIX 0xFF
#define get_byte(x) ((x>>(byte * 8))&RADIX)
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
int v[10000002];
int N;
void countsort(int a[], int b[], int byte)
{
int counter[1<<8];
int index[1<<8];
memset(counter, 0, sizeof(counter));
for(int i = 0; i <= N; i ++)
counter[(a[i]>>(byte*8))&255]++;
index[0] = 0;
for(int i = 1; i < 1<<8; i ++)
index[i] = index[i-1] + counter[i-1];
for(int i = 0; i <= N; i ++)
b[index[get_byte(a[i])]++] = a[i];
}
void radixsort() {
int *temp = new int[N];
for (int i = 0; i < sizeof(v[0]); i ++) {
if(i % 2 == 0)
countsort(v, temp, i);
else
countsort(temp, v, i);
}
}
int main()
{
int A , B , C;
f>>N>>A>>B>>C;
v[1]=B;
for(int i=2;i<=N;i++)
{
v[i]=(A*v[i-1]+B)%C;
}
radixsort();
for (int i=1;i<=N;i+=10)
{
g<<v[i]<<" ";
}
return 0;
}