Cod sursa(job #2795483)
Utilizator | Data | 6 noiembrie 2021 14:12:53 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream cin("divprim.in");
ofstream cout("divprim.out");
int a[1000005][10],ciur[1000005],t,n,k,i,j,d;
int main()
{
ciur[1]=1;
for(i=2;i<=1000000;i++)
{
if(ciur[i]==0)
{
for(d=i;d<=1000000;d=d+i)
{
ciur[d]++;
}
}
}
for(i=2;i<=1000000;i++)
{
for(j=1;j<=7;j++)
{
a[i][j]=a[i-1][j];
}
a[i][ciur[i]]=i;
}
cin >>t;
for(i=1;i<=t;i++)
{
cin >>n>>k;
cout <<a[n][k]<<'\n';
}
return 0;
}