Cod sursa(job #240286)
Utilizator | Data | 7 ianuarie 2009 09:28:13 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<stdio.h>
int t,n,k,nrd[7];
void ciur()
{
int j=0;
for(int i=2;i<=n;++i)
if(nrd[i]==0)
for(j=i;j<=n;j+=i)
++nrd[j];
}
int main()
{
int nrmax=0;
freopen("divprim.in","r",stdin);
freopen("divprim.out","w",stdout);
scanf("%d",&t);
for(int r=1;r<=t;++r)
{
scanf("%d%d",&n,&k);
ciur();
for(int i=n;i>=1;--i)
{
if(nrd[i]==k && i>nrmax)
nrmax=i;
}
printf("%d\n",nrmax);
nrmax=0;
}
return 0;
}