hdu 2504

#include<stdio.h>#define MAXN 1000int c[MAXN],p[MAXN],n;int prime(){    int i,j;    memset(c,0,sizeof(c));    for(i = 2;i < MAXN;i++)    {        if(c[i] == 0)        {            for(j = 2*i;j < MAXN;j+=i)                c[j] = 1;        }    }    for(i = 2,j = 0;i < MAXN;i++)        if(c[i] == 0)        {            p[j++] = i;        }    n = j;}void main(){    int a,b,T,temp,i;    prime();    scanf("%d",&T);    while(T--)    {        scanf("%d%d",&a,&b);        temp = a/b;        for(i = 0;i < n;i++)        {            if(temp%p[i] != 0)                break;        }        printf("%d\n",b*p[i]);    }}