Cod sursa(job #2013344)
| Utilizator | Data | 21 august 2017 10:04:00 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 25 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include<fstream>
using namespace std;
ifstream fin("divprim.in");
ofstream fout("divprim.out");
int k,n,i,x,y,d,m,t,j,v[1000002];
int main(){
v[1]=0;
for(i=2; i<=1000000; i++){
if(v[i]==0){
for(j=i*2; j<=1000000; j=j+i){
v[j]++;
}
}
}
fin>>t;
for(j=1; j<=t; j++){
fin>>n>>k;
m=0;
for(i=n;i>0;i--){
if(v[i]==k){
m=i;
break;
}
}
fout<<m<<"\n";
}
}
