Cod sursa(job #2667043)

Utilizator AndreiAlexandru2k3Ciucan Andrei Alexandru AndreiAlexandru2k3 Data 2 noiembrie 2020 19:46:48
Problema Divizori Primi Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 3.33 kb
#include <fstream>
#include <cmath>
using namespace std;

class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }

    InParser& operator >> (long long &n) {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};


InParser f("divprim.in");
OutParser g("divprim.out");

const int NMAX = 1000000;

int ciur[NMAX + 1], sol[NMAX + 1][8];
int N, T, K;

void Erathostene(int n)
{
    int i;
    for(i = 2; i <= n; i += 2)
        ciur[i] = 1;
    int rad_n = sqrt(n);
    for(i = 3; i <= rad_n; i += 2)
        if(!ciur[i])
            for(int j = i; j <= n; j += i)
                ciur[j]++;
    for(; i <= NMAX; i++)
        if(!ciur[i])
            for(int j = i; j <= NMAX; j += i)
                ciur[j]++;
}

void precalcul()
{
    Erathostene(NMAX);
    for(int i = 2; i <= NMAX; i++)
    {
        for(int j = 1; j <= 7; j++)
            sol[i][j] = sol[i - 1][j];
        sol[i][ciur[i]] = i;
    }
}

int main()
{
    precalcul();
    f >> T;
    while(T--)
    {
        f >> N >> K;
        g << sol[N][K] << '\n';
    }
    return 0;
}