Cod sursa(job #114725)
Utilizator | Andrei Popescu pandaemon | Data | 15 decembrie 2007 16:46:06 |
---|---|---|---|
Problema | Divizori Primi | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<stdio.h>
#define LMAX 1000005
long div[LMAX+1],k; long t,n,i,j,sol[LMAX+1][9];
void generare()
{for(i=2;i<=100000;i++)
if(div[i]==0)
for(j=i;j<=LMAX;j+=i) div[j]++;
for(i=2;i<=LMAX;++i)
{
for(j=1;j<=7;j++) sol[i-1][j]=i;
sol[i][div[i]]=i;}
}
main()
{freopen("divprim.in","r",stdin);
freopen("divprim.out","w",stdout);
generare();
scanf("%ld",&t);
for(i=1;i<=t;i++)
{scanf("%ld %d",&n,&k);
printf("%ld\n",sol[n][k]);}
}