Cod sursa(job #1640069)
Utilizator | Data | 8 martie 2016 15:37:21 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
using namespace std;
int n, k, i, j, x, y, a[10][1000003], v[1000003];
int main()
{
ifstream fin("divprim.in");
ofstream fout("divprim.out");
fin>>n;
for(i=2;i<=1000000;i++){
if(v[i]==0){
for(j=i;j<=1000000;j+=i)
v[j]++;
}
}
for(i=1;i<=7;i++)
for(j=2;j<=1000000;j++){
if(v[j]==i)
a[i][j]=j;
else
a[i][j]=a[i][j-1];
}
for(i=1;i<=n;i++){
fin>>x>>y;
fout<<a[y][x]<<"\n";
}
return 0;
}