Pagini recente » Cod sursa (job #586282) | Cod sursa (job #2239905) | Cod sursa (job #3162388) | Cod sursa (job #2537922) | Cod sursa (job #1494004)
# include <cstdio>
# define MAX (10000000 + 10)
using namespace std;
int n, i;
int v[MAX], aux[MAX], ap[1 << 8];
long long A, B, C;
void radixs (int p)
{
int mask = (1 << 8) - 1;
for (i = 1; i <= n; i++)
ap[( v[i] & (mask << p) ) >> p]++;
for (i = 1; i <= mask; i++)
ap[i] += ap[i-1];
for (i = mask; i >= 1; i--)
ap[i] = ap[i-1];
ap[0] = 0;
for (i = 1; i <= n; i++)
aux[++ap[( v[i] & (mask << p) ) >> p]] = v[i];
for (i = 1; i <= n; i++)
v[i] = aux[i];
}
int main ()
{
freopen("radixsort.in","r",stdin);
freopen("radixsort.out","w",stdout);
scanf("%d %lld %lld %lld\n", &n, &A, &B, &C);
v[1] = B;
for (i = 2; i <= n; i++)
v[i] = (A * v[i-1] + B) % C;
for (i = 0; i < 32; i += 8)
radixs(i);
for (i = 1; i <= n; i += 10)
printf("%d ", v[i]);
printf("\n");
return 0;
}