Pagini recente » Cod sursa (job #1954923) | Cod sursa (job #850686) | Cod sursa (job #132262) | Cod sursa (job #2075153) | Cod sursa (job #2146481)
#include <cstdio>
#include <fstream>
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 CountingSort1(u32 A[], u32 B[])
{
u32 frequence[0x800]{}, index[0x800]; index[0x0] = ~0x0;
for(u32 i = N; i; ++frequence[A[--i] & 0x7FF]);
for(u32 i = 0x0; i != 0x7FF; index[++i] = index[~-i] + frequence[~-i]);
for(u32 i = 0x0; i != N; ++i) B[++index[A[i] & 0x7FF]] = A[i];
}
__attribute__((always_inline)) void CountingSort2(u32 A[], u32 B[])
{
u32 frequence[0x800]{}, index[0x800]; index[0x0] = ~0x0;
for(u32 i = N; i; ++frequence[A[--i] >> 0xB & 0x7FF]);
for(u32 i = 0x0; i != 0x7FF; index[++i] = index[~-i] + frequence[~-i]);
for(u32 i = 0x0; i != N; ++i) B[++index[A[i] >> 0xB & 0x7FF]] = A[i];
}
__attribute__((always_inline)) void CountingSort3(u32 A[], u32 B[])
{
u32 frequence[0x800]{}, index[0x800]; index[0x0] = ~0x0;
for(u32 i = N; i; ++frequence[A[--i] >> 0x16 & 0x7FF]);
for(u32 i = 0x0; i != 0x7FF; index[++i] = index[~-i] + frequence[~-i]);
for(u32 i = 0x0; i != N; ++i) B[++index[A[i] >> 0x16 & 0x7FF]] = A[i];
}
char outBuffer[0xA7D8C0]; i32 p = 0xA7D8C0;
__attribute__((always_inline)) void write(u32 x)
{
outBuffer[--p] = 0x20;
do
{
outBuffer[--p] = x % 0xA + 0x30;
x = x / 0xA;
}
while(x);
}
i32 main()
{
std :: ifstream("radixsort.in") >> 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;
}
}
CountingSort1(v, w); CountingSort2(w, v); CountingSort3(v, w);
for(u32 i = ~-N - ~-N % 0xA + 0xA; i; i = i - 0xA, write(w[i]));
std :: ofstream("radixsort.out").write(outBuffer + p, 0xA7D8BF - p);
return 0x0;
}