Pagini recente » Cod sursa (job #836576) | Cod sursa (job #2226410) | Cod sursa (job #2391787) | Cod sursa (job #1388027) | Cod sursa (job #811161)
Cod sursa(job #811161)
#include <cstdio>
#include <vector>
using namespace std;
//vector<int> div;
//vector< vector<int> > mat;
int div[1000005];
int mat[1000000][7];
void ciur()
{
long i,j;
for(i=2;i<=1000000;i+=2)
div[i]++;
for(i=3;i<=1000000;++i)
if(!div[i])
for(j=i;j<=1000000;j+=i)
div[j]++;
for(i=2;i<=1000000;++i)
{
for(j=0;j<=7;++j)
mat[i][j]=mat[i-1][j];
mat[i][div[i]]=i;
}
}
int main()
{
freopen("divprimi.in","r",stdin);
freopen("divprimi.out","w",stdout);
ciur();
long t,n,k;
scanf("%ld",&t);
long i;
for(i=1;i<=t;++i)
{
scanf("%ld%ld",&n,&k);
printf("%ld\n",mat[n][k]);
}
return 0;
}