Cod sursa(job #1581900)
| Utilizator | Data | 27 ianuarie 2016 12:06:02 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <cstdio>
using namespace std;
int v[1000005],t,n,i,j,dr,k,ok,a[1000005][8];
int main()
{
freopen("divprim.in","r",stdin);
freopen("divprim.out","w",stdout);
for(i=2;i<=1000000;i++)
if(v[i]==0)
{
v[i]=1;
for(j=2*i;j<=1000000;j+=i)
v[j]++;
}
for(i=2;i<=1000000;i++)
{
for(j=1;j<=7;j++)
a[i][j]=a[i-1][j];
a[i][v[i]]=i;
}
scanf("%d",&t);
for(i=1;i<=t;i++)
{
scanf("%d%d",&n,&k);
printf("%d\n",a[n][k]);
}
return 0;
}
