Pagini recente » Cod sursa (job #2022756) | Cod sursa (job #713099) | Cod sursa (job #983376) | Cod sursa (job #532483) | Cod sursa (job #2221245)
#include <cstdio>
__attribute__((always_inline)) void CountingSort(size_t N, size_t A[], size_t B[], size_t digit)
{
size_t frequence[0x800]{}, index[0x800]; index[0x0] = ~0x0;
for(size_t i = N; i; ++frequence[A[--i] >> digit & 0x7FF]);
for(size_t i = 0x0; i != 0x7FF; index[++i] = index[~-i] + frequence[~-i]);
for(size_t i = 0x0; i != N; ++i) B[++index[A[i] >> digit & 0x7FF]] = A[i];
}
#define SIZE 0x20000
__attribute__((always_inline)) void get_number(size_t &num)
{
static char inBuffer[SIZE];
static int p = ~-SIZE; num = 0x0;
while(inBuffer[p] < 0x30 || inBuffer[p] > 0x39)
{
++p != SIZE || (fread(inBuffer, 0x1, SIZE, stdin), p = 0x0);
}
while(inBuffer[p] > 0x2F && inBuffer[p] < 0x3A)
{
num = num * 0xA + inBuffer[p] - 0x30;
++p != SIZE || (fread(inBuffer, 0x1, SIZE, stdin), p = 0x0);
}
}
char outBuffer[0x4C4B40]; size_t p = ~0x0;
__attribute__((always_inline)) void put_number(size_t x)
{
size_t digits = x > 0x3B9AC9FF ? 0xB :
x > 0x5F5E0FF ? 0xA :
x > 0x98967F ? 0x9 :
x > 0xF423F ? 0x8 :
x > 0x1869F ? 0x7 :
x > 0x270F ? 0x6 :
x > 0x3E7 ? 0x5 :
x > 0x63 ? 0x4 :
x > 0x9 ? 0x3 : 0x2;
for(size_t i = digits; --i; x /= 0xA)
{
outBuffer[p + i] = x % 0xA + 0x30;
}
outBuffer[p = p + digits] = 0x20;
}
int main()
{
freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);
size_t N, v[0x80000], w[0x80000]; ///declara vectorii global daca iei (0xC00000FD)
get_number(N);
for(size_t i = N; --i;)
{
get_number(v[i]);
}
get_number(v[0x0]);
CountingSort(N, v, w, 0x0);
CountingSort(N, w, v, 0xB);
CountingSort(N, v, w, 0x16);
for(size_t i = 0x0; i != N; ++i)
{
put_number(w[i]);
}
fwrite(outBuffer, 0x1, p, stdout);
return 0x0;
}