Pagini recente » Cod sursa (job #2564853) | Cod sursa (job #1711548) | Cod sursa (job #2126687) | Cod sursa (job #2634880) | Cod sursa (job #1067946)
#include <stdio.h>
#include <string.h>
using namespace std;
FILE*fin=fopen("divprim.in","r");
FILE*fout=fopen("divprim.out","w");
int c[1000010], a[1000010][10], i, j, t, n, k;
int main()
{
int i,j;
for(i=2; i<1000001; i++)
if(c[i]==0)
for(j=i; j<1000001; j+=i)
c[j]++;
for(i=2; i<1000001; i++)
{
for(j=0; j<8; j++)
a[i][j]=a[i-1][j];
a[i][ c[i] ]=i;
}
fscanf(fin,"%d",&t);
for(i=1; i<=t; i++)
{
fscanf(fin,"%d%d", &n, &k);
fprintf(fout,"%d\n", a[n][k]);
}
return 0;
}