Cod sursa(job #2220566)

Utilizator inquisitorAnders inquisitor Data 12 iulie 2018 10:22:03
Problema Sortare prin comparare Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.69 kb
#include <cstdio>

#define floor_log10(N) (((N) > 999999999) + ((N) > 99999999) + ((N) > 9999999) + ((N) > 999999) + ((N) > 99999) + ((N) > 9999) + ((N) > 999) + ((N) > 99) + ((N) > 9))

int N, v[0x80000], w[0x80000];

__attribute__((always_inline)) void CountingSort(int A[], int B[], int digit)
{
    int frequence[0x800]{}, index[0x800], i = N; index[0x0] = ~0x0;

    while(i) ++frequence[A[--i] >> digit & 0x7FF];

    for(; i != 0x7FF; index[++i] = index[~-i] + frequence[~-i]);

    for(i = 0x0; i != N; ++i) B[++index[A[i] >> digit & 0x7FF]] = A[i];
}

__attribute__((always_inline)) void read(int &num)
{
    static char inBuffer[0x8000];

    static int p = 0x0; num = 0x0;

    while(inBuffer[p] < 0x30 | inBuffer[p] > 0x39)
    {
        ++p != 0x8000 || (fread(inBuffer, 0x1, 0x8000, stdin), p = 0x0);
    }

    while(inBuffer[p] > 0x2F & inBuffer[p] < 0x3A)
    {
        num = num * 0xA + inBuffer[p] - 0x30;

        ++p != 0x8000 || (fread(inBuffer, 0x1, 0x8000, stdin), p = 0x0);
    }
}

char outBuffer[0x4C4B40]; int p = ~0x0;

__attribute__((always_inline)) void itoa(int x)
{
    int digits = 2 + floor_log10(x);

    for(int i = digits, y; --i; x = y)
    {
        outBuffer[p + i] = x - 0xA * (y = x / 0xA) + 0x30;
    }

    outBuffer[p = p + digits] = 0x20;
}

int main()
{
    freopen("algsort.in", "r", stdin);
    freopen("algsort.out", "w", stdout);

    read(N);

    for(int i = 0x0; i != N; ++i)
    {
        read(v[i]);
    }

    CountingSort(v, w, 0x0);
    CountingSort(w, v, 0xB);
    CountingSort(v, w, 0x16);

    for(int i = 0x0; i != N; ++i)
    {
        itoa(w[i]);
    }

    puts(outBuffer);

    return 0x0;
}