Pagini recente » Cod sursa (job #1909758) | Cod sursa (job #1437338) | Cod sursa (job #1251587) | Cod sursa (job #549669) | Cod sursa (job #2137782)
#include <cstdio>
# define itoa(n) \
unsigned int x = n; \
unsigned int digits = x > 0x3B9AC9FF ? 0xA : \
x > 0x5F5E0FF ? 0x9 : \
x > 0x98967F ? 0x8 : \
x > 0xF423F ? 0x7 : \
x > 0x1869F ? 0x6 : \
x > 0x270F ? 0x5 : \
x > 0x3E7 ? 0x4 : \
x > 0x63 ? 0x3 : \
x > 0x9 ? 0x2 : 0x1; \
\
for(unsigned int i = ~-digits; ~i; --i) \
{ \
outBuffer[p + i] = x % 0xA + 0x30; \
\
x /= 0xA; \
} \
\
p += digits; outBuffer[p++] = 0x20; \
unsigned int N, A, B, C, v[0x989680], w[0x989680], p;
void inline CountingSort(unsigned int A[], unsigned int B[], unsigned int digit)
{
unsigned int frequence[0x100]{}, index[0x100]; index[0x0] = 0x0;
for(unsigned int i = N; i; ++frequence[A[--i] >> digit & 0xFF]);
for(unsigned int i = 0x0; i != 0x100; index[++i] = index[~-i] + frequence[~-i]);
for(unsigned int i = 0x0; i != N; ++i) B[index[A[i] >> digit & 0xFF]++] = A[i];
}
char outBuffer[0xA7D8C0];
int main()
{
freopen("radixsort.in", "r", stdin);
freopen("radixsort.out", "w", stdout);
scanf("%d %d %d %d", &N, &A, &B, &C);
v[0x0] = B;
for(unsigned int i = 0x1; i != N; ++i)
{
unsigned long long j = 0x1ULL * v[~-i] * A + B;
v[i] = C > j ? j : j - j / C * C;
}
CountingSort(v, w, 0x0);
CountingSort(w, v, 0x8);
CountingSort(v, w, 0x10);
CountingSort(w, v, 0x18);
for(unsigned int i = 0x0; i != N; i += 0xA)
{
itoa(v[i]);
}
puts(outBuffer);
return 0;
}