Pagini recente » Cod sursa (job #1238867) | Cod sursa (job #2144757) | Cod sursa (job #1073156) | Cod sursa (job #1264502) | Cod sursa (job #2220559)
#include <cstdio>
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[5000000]; int p = 4999999;
__attribute__((always_inline)) void itoa(int x)
{
while(x)
{
outBuffer[--p] = x % 10 + 48;
x /= 10;
}
outBuffer[--p] = 32;
}
int main()
{
freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);
read(N);
for(int i = N; i;)
{
read(v[--i]);
}
CountingSort(v, w, 0);
CountingSort(w, v, 11);
CountingSort(v, w, 22);
for(int i = N; i;)
{
itoa(w[--i]);
}
puts(outBuffer + p + 1);
return 0x0;
}