Pagini recente » Cod sursa (job #2336048) | Cod sursa (job #1102890) | Cod sursa (job #2751954) | Cod sursa (job #962063) | Cod sursa (job #1335196)
#include <cstdio>
using namespace std;
int v[1000005];
int d[10][1000005];
void ciur(int n)
{
int i,j;
for(i=2; i<=n; ++i)
{
if(v[i]==0)
for(j=i; j<=n; j=j+i)
v[j]++;
}
}
int main()
{
freopen("divprim.in","r",stdin);
freopen("divprim.out","w",stdout);
int n,x,y,i,j;
ciur(1000005);
for(i=0; i<=7; i++)
{
for(j=0; j<=1000000; j++)
if(v[j]==i)
d[i][j]=j;
else
d[i][j]=d[i][j-1];
}
scanf("%d",&n);
for(i=1; i<=n; i++)
{
scanf("%d%d",&x,&y);
printf("%d\n",d[y][x]);
}
}