Cod sursa(job #1402694)

Utilizator Alexghita96Ghita Alexandru Alexghita96 Data 26 martie 2015 18:49:52
Problema Radix Sort Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 1.13 kb
#include <cstdio>
#include <vector>

#define NMAX 10000005

using namespace std;

int N, A, B, C, V[NMAX];

void citire()
{
    long long x;
    scanf("%d %d %d %d", &N, &A, &B, &C);

    V[1] = B;

    for (int i = 2; i <= N; ++i)
    {
        x = (long long)A * (long long)V[i - 1] + (long long)B;
        V[i] = (int)(x % C);
    }
}

void rezolvare()
{
    int rez;
    vector <int> :: iterator it;
    vector <int> lista[256];

    for (int bucata = 0; bucata <= 3; ++bucata)
    {
        for (int i = 1; i <= N; ++i)
        {
            rez = (V[i] >> (bucata * 8)) & 255;
            lista[rez].push_back(V[i]);
        }
        V[0] = 0;
        for (int i = 0; i <= 255; ++i)
        {
            for (it = lista[i].begin(); it != lista[i].end(); ++it)
            {
                V[++V[0]] = *it;
            }
            lista[i].clear();
        }
    }

    for (int i = 1; i <= N; i += 10)
        printf("%d ", V[i]);
}

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

    citire();
    rezolvare();

    return 0;
}