Cod sursa(job #1942179)
| Utilizator | Data | 27 martie 2017 20:51:08 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <fstream>
using namespace std;
#define nmax 1000000
ifstream fin("divprim.in");
ofstream fout("divprim.out");
int a[8][nmax+5], c[nmax+5];
void buildMat()
{
int i, j;
for(i=2; i<=nmax; i++)
if(!c[i])
for(j=i; j<=nmax; j+=i)
c[j]++;
for(i=0; i<=7; i++)
for(j=2; j<=nmax; j++)
if(c[j]==i)
a[i][j]=j;
else a[i][j]=a[i][j-1];
}
int main()
{
int t, n, k;
buildMat();
fin>>t;
while(t)
{
t--;
fin>>n>>k;
fout<<a[k][n]<<'\n';
}
fin.close();
fout.close();
return 0;
}
