Cod sursa(job #190483)
| Utilizator | Data | 22 mai 2008 20:36:00 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.41 kb |
# include <stdio.h>
short a[20010];
long int i,j,n,k,t,q;
int main ()
{
freopen ("divprim.in","r",stdin);
freopen ("divprim.out","w",stdout);
scanf ("%li",&t);
for (i=2;i<=200000;i++)
if (a[i]==0)
for (j=i;j<=200000;j=j+i)
a[j]++;
for (q=0;q<t;q++)
{
scanf ("%li",&n);
scanf ("%li",&k);
for (i=n;i>=0;i--)
if (a[i]==k)
{
printf ("%i\n",i);
break;
}
if (i==-1)
printf ("0\n");
}
return 0;
}