Cod sursa(job #1338580)
| Utilizator | Data | 10 februarie 2015 09:35:12 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 25 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <stdio.h>
short int ciur[1000001];
int main()
{
freopen ("divprim.in","r",stdin);
freopen ("divprim.out","w",stdout);
for(int i=2;i<=1000000;i++)
{
if(ciur[i]==0)
{
for(int j=2;j<=1000000/i;j++) ciur[i*j]++;
}
}
int t,n,k;
scanf("%d",&t);
for(int x=1;x<=t;x++)
{
scanf("%d%d",&n,&k);
ciur[0]=k;
for(int i=n;i>=0;i--)
{
if(ciur[i]==k)
{
printf("%d\n",i);
break;
}
}
}
}
