Pagini recente » Cod sursa (job #260103) | Cod sursa (job #1847203) | Cod sursa (job #178610) | Cod sursa (job #90528) | Cod sursa (job #2666038)
#include<fstream>
using namespace std;
int v[1000000]={};
int main(){
ifstream in("divprim.in");
ofstream out("divprim.out");
long long int t,n,k;
for(long long int i=2;i<=1000000;i++){
if(v[i]==0){
for(long long int j=i;j<=1000000;j+=i){
v[j]++;
}
}
}
in>>t;
for(long long int j=1;j<=t;j++){
in>>n>>k;
long long int p=0;
for(long long int i=n;i>0;i--){
if(v[i]==k){
p=1;
out<<i<<'\n';
break;
}
}
if(p==0){
out<<"0"<<'\n';
}
}
}