Cod sursa(job #2207741)

Utilizator toadehuPuscasu Razvan Stefan toadehu Data 26 mai 2018 16:50:22
Problema Divizori Primi Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.8 kb
#include <fstream>

using namespace std;

bool prim[1000002];

int v[1000002], nrd[8], m[8][1000002];

void ciur()
{
    for(int i = 3; i < 1000002; i += 2)
    {
        if(!prim[i])
        {
            v[i] = 1;
            for(int d =2 * i; d < 1000002; d += i)
            {
                prim[d] = true;
                v[d]++;
            }
        }
    }

    for(int i = 2; i < 1000002; i++)
    {
        if(!(i & 1))
            v[i]++;
        nrd[v[i]] = i;

        for(int d = 1; d < 8; d++)
            m[d][i] = nrd[d];
    }
}

int main()
{

    ifstream fin("divprim.in");
    ofstream fout("divprim.out");
    int t, n, k;
    fin >> t;
    ciur();
    while(t--)
    {
        fin >> n >> k;
        fout << m[k][n] << '\n';
    }
    return 0;
}