Pagini recente » Cod sursa (job #2221256) | Cod sursa (job #1387557) | Cod sursa (job #157544) | daupentrumata | Cod sursa (job #2138800)
#include <cstdio>
unsigned int N, A, B, C, v[0x989680], w[0x989680], p;
__attribute__((always_inline)) void 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];
}
__attribute__((always_inline)) void read(unsigned int &num)
{
static char inBuffer[0x40];
static unsigned int p = 0x0; num = 0x0;
fread(inBuffer, 0x1, 0x40, stdin);
while(inBuffer[p] < 0x30 | inBuffer[p] > 0x39)
{
++p;
}
while(inBuffer[p] > 0x2F & inBuffer[p] < 0x3A)
{
num = num * 0xA + inBuffer[p] - 0x30;
++p;
}
}
char outBuffer[0xA7D8C0];
__attribute__((always_inline)) void itoa(unsigned int x)
{
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 = x / 0xA;
}
p = p + digits; outBuffer[p++] = 0x20;
}
int main()
{
freopen("radixsort.in", "r", stdin);
freopen("radixsort.out", "w", stdout);
read(N); read(A); read(B); read(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 = i + 0xA)
{
itoa(v[i]);
}
fwrite(outBuffer, 0x1, p, stdout);
return 0x0;
}