Pagini recente » Cod sursa (job #2916496) | Cod sursa (job #2963991) | Cod sursa (job #1703016) | Cod sursa (job #1562173) | Cod sursa (job #1863794)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("divprim.in");
ofstream fout("divprim.out");
const int N=10000001;
char c[N],v[N];
int main()
{
int i,n,j,s=0,m,t,k=1,mx=0;
fin>>t;
for(i=1; i<=t; i++)
{
mx=0;
s=0;
fin>>n>>m;
for(i=2; i<=n; i++)
{
if(c[i]==0)
{
for(j=i; j<=n; j+=i)
{
++c[j];
}
}
}
for(j=1; j<=n; j++)
{
if(c[j]==m)
{
v[++s]=j;
}
}
for(i=1; i<=s; i++)
{
if(mx<v[i])
{
mx=v[i];
}
}
cout<<mx<<'\n';
}
return 0;
}