Cod sursa(job #2269869)

Utilizator vladth11Vlad Haivas vladth11 Data 26 octombrie 2018 17:52:10
Problema Divizori Primi Scor 90
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 0.86 kb
#include <fstream>
#include <vector>

using namespace std;

ifstream cin("divprim.in");
ofstream cout("divprim.out");

const int N = 1000000;

vector <int> a[7];
int nr[N];

int caut(vector <int> v,int n){
    int r  = -1;
    int pas = 1 << 16;
    while(pas!=0){
        if(r+pas < v.size() && v[r+pas] <= n){
            r+=pas;
        }
        pas /= 2;
    }
    if(r == -1)
        return 0;
    return v[r];
}

int main()
{
    int t,k,i,div,j,n;
    ios_base::sync_with_stdio();
    cin.tie(NULL);
    for(i = 2;i < N;i++){
        if(nr[i] == 0){
            for(j=i;j<N;j+=i){
                nr[j]++;
            }
        }
    }
    for(i=1;i<N;i++){
        a[nr[i]].push_back(i);
    }

    cin >> t;
    while(t > 0){
        cin >> n >> k;
        cout << caut(a[k],n) << "\n";
        t--;
    }
    return 0;
}