Pagini recente » Cod sursa (job #1682962) | Cod sursa (job #470615) | Cod sursa (job #1334616) | Cod sursa (job #2802802) | Cod sursa (job #1337956)
#include <stdio.h>
#include <stdlib.h>
int ciur[1000010],d[10][1000010];
int main()
{
FILE *fin=fopen("divprim.in", "r");
FILE *fout=fopen("divprim.out", "w");
int n,k,a, t, i, j;
for (i=2;i<=1000000;i++){
if (ciur[i]==0){
for (j=i;j<=1000000;j=j+i){
ciur[j]++;
}
}
}
for (i=1;i<=7;i++){
for (j=1;j<=1000000;j++){
if (ciur[j]==i){
d[i][j]=j;
}
else {
d[i][j]=d[i][j-1];
}
}
}
fscanf(fin, "%d", &t);
for(a=1;a<=t;a++){
fscanf(fin,"%d%d", &n, &k);
fprintf(fout,"%d\n", d[k][n]);
}
fclose(fin);
fclose(fout);
return 0;
}