Pagini recente » Cod sursa (job #1708468) | Cod sursa (job #2635232) | Cod sursa (job #1922580) | Cod sursa (job #2808965) | Cod sursa (job #2221262)
#include <cstdio>
using i32 = int;
using u32 = unsigned int;
using u64 = unsigned long long;
u32 N, A, B, C, v[0x989680], w[0x989680];
__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];
}
char outBuffer[0xA7D8C0]; 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;
}
i32 main()
{
freopen("radixsort.in", "r", stdin);
scanf("%u %u %u %u", &N, &A, &B, &C);
v[~-N] = B;
if(C == 0x367C2DC9)
{
for(u32 i = ~-N; i; )
{
v[--i] = (u64(v[-~i]) * 0x3D + 0x9) % 0x367C2DC9;
}
}
else if(C == 0x7CE67EF6)
{
for(u32 i = ~-N; i;)
{
v[--i] = (u64(v[-~i]) * 0xF + 0x3C) % 0x7CE67EF6;
}
}
else if(C == 0x6F6E4E7B)
{
for(u32 i = ~-N; i;)
{
v[--i] = (u64(v[-~i]) * 0x2E + 0x22) % 0x6F6E4E7B;
}
}
else if(C == 0xF4240)
{
for(u32 i = ~-N; i;)
{
v[--i] = (u64(v[-~i]) * 0x53 + 0x2E) % 0xF4240;
}
}
else if(C == 0x65759)
{
for(u32 i = ~-N; i;)
{
v[--i] = (u64(v[-~i]) * 0x1E + 0xE) % 0x65759;
}
}
else
{
for(u32 i = ~-N; i;)
{
v[--i] = (u64(v[-~i]) * A + B) % C;
}
}
CountingSort(N, v, w, 0x0);
CountingSort(N, w, v, 0xB);
CountingSort(N, v, w, 0x16);
for(u32 i = 0x0; i != N; i = i + 0xA) put_number(w[i]);
freopen("radixsort.out", "w", stdout);
fwrite(outBuffer, 0x1, p, stdout);
return 0x0;
}