Pagini recente » Cod sursa (job #2915208) | Cod sursa (job #428384) | Cod sursa (job #2651313) | Cod sursa (job #3184606) | Cod sursa (job #961316)
Cod sursa(job #961316)
#include <fstream>
#define NMax 1000008
using namespace std;
int v[NMax],k,t,i,j,n;
int parcurgere(int n,int k)
{
for(i=0;i<=n+k;i++)
v[i]=0;
for(i=2;i<=n/2;i++)
if(v[i]==0)
for(j=2*i;j<=n;j=j+i)
v[j]++;
for(i=n;i>2;i--)
if(v[i]==k)
return i;
return 0;
}
int main()
{
ifstream f("divprim.in");
ofstream g("divprim.out");
f>>t;
for(int i=1;i<t;i++)
{
f>>n>>k;
g<<parcurgere(n,k)<<"\n";
}
f>>n>>k;
g<<parcurgere(n,k);
return 0;
}