Cod sursa(job #1909005)
Utilizator | Data | 7 martie 2017 11:21:25 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <cstdio>
using namespace std;
char divprim[1000001];
int mat[1000001][8];
void ciurdp()
{
int i,j;
for(i=2;i<=1000000;i++)
if(!divprim[i])
for(j=i;j<=1000000;j=j+i)
divprim[j]++;
}
int main()
{
freopen("divprim.in","r",stdin);
freopen("divprim.out","w",stdout);
int t,i,j,n,k;
scanf("%d",&t);
ciurdp();
for(i=2;i<=1000000;i++)
{
for(j=1;j<=7;j++)
mat[i][j]=mat[i-1][j];
mat[i][divprim[i]]=i;
}
for(i=1;i<=t;i++)
{
scanf("%d%d",&n,&k);
printf("%d\n",mat[n][k]);
}
return 0;
}