Mai intai trebuie sa te autentifici.
Cod sursa(job #1993670)
Utilizator | Data | 23 iunie 2017 15:48:20 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.69 kb |
#include <fstream>
using namespace std;
ifstream fin("divprim.in");
ofstream fout("divprim.out");
int ciur[100002],a[8][100002];
int t,n,k;
void ciurare()
{
for (int i=2;i<=100000;i++)
if (!ciur[i])
{
for (int j=i;j<=100000;j+=i) ciur[j]++;
ciur[i]=1;
}
}
void calculare()
{
for (int i=1;i<=7;i++)
for (int j=1;j<=100000;j++)
{
if (ciur[j]==i)a[i][j]=j;
else a[i][j]=a[i][j-1];
}
}
int main()
{
ciurare(),calculare();
fin >> t;
for (int i=1;i<=t;i++)
{
fin >> n >> k;
fout << a[k][n] << "\n";
}
return 0;
}