Pagini recente » Cod sursa (job #449252) | Cod sursa (job #730165) | Cod sursa (job #2109727) | Cod sursa (job #1158205) | Cod sursa (job #1912521)
#include <cstdio>
using namespace std;
const int NMAX=1000005;
int c[NMAX],nr[8][NMAX];
int main()
{
freopen("divprim.in","r",stdin);
freopen("divprim.out","w",stdout);
int t,n,k,i,j,ok;
for(i=2; i<=NMAX; i=i+2)
c[i]=1;
for(i=3; i<=NMAX; i=i+2)
if(!c[i])
for(j=i; j<=NMAX; j=j+i)
c[j]++;
scanf("%d",&t);
for(i=1; i<=7; i++)
for(j=1; j<=NMAX-2; j++)
{
if(c[j]==i)
nr[i][j]=j;
else
nr[i][j]=nr[i][j-1];
}
for(i=1; i<=t; i++)
{
scanf("%d%d",&n,&k);
printf("%d\n",nr[k][n]);
}
return 0;
}