Pagini recente » Cod sursa (job #1435063) | Cod sursa (job #449426) | Cod sursa (job #993541) | Istoria paginii runda/pre___oji___2018 | Cod sursa (job #1938799)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("divprim.in");
ofstream out("divprim.out");
int t,n,k;
int v[100005],mat[100005][10];
int main()
{
for(int i=2;i<=100000;++i)
if(v[i]==0){
++v[i];
for(int j=2;j*i<=100000;++j)
++v[j*i];
}
for(int i=2;i<=100000;++i)
for(int j=1;j<=7;++j){
if(v[i]==j)
mat[i][j]=i;
else
mat[i][j]=mat[i-1][j];
}
in>>t;
for(int i=1;i<=t;++i){
in>>n>>k;
out<<mat[n][k]<<"\n";
}
return 0;
}