Cod sursa(job #1628334)
| Utilizator | Data | 3 martie 2016 23:08:28 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 75 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.68 kb |
#include<cstdio>
char ciur[1000005];
int v[1000005][12];
void ciurul(int n)
{
int i,j;
ciur[0]=ciur[1]=0;
i=1;
for(i=2; i*i<=n; i++)
{
if(ciur[i]==0)
for(j=i; j<=n; j+=i)
ciur[j]++;
}
}
int main()
{
freopen("divprim.in","r",stdin);
freopen("divprim.out","w",stdout);
int t,n,k,i,j;
ciurul(1000000);
for(i=2; i<=1000000; i++)
{
for(j=1; j<=7; j++)
v[i][j]=v[i-1][j];
v[i][ciur[i]]=i;
}
scanf("%d",&t);
for(i=1;i<=t;i++)
{
scanf("%d%d",&n,&k);
printf("%d\n",v[n][k]);
}
return 0;
}
