Pagini recente » Cod sursa (job #1045719) | Cod sursa (job #823671) | Cod sursa (job #1542246)
#include <fstream>
using namespace std;
ifstream cin("divprim.in");
ofstream cout("divprim.out");
int n,m,k,i,j,p,x,y,nr[1000005],t,d[8][1000005];
const int nmax=1000000;
void ciur()
{int i,j;
for (i=2;i<=nmax;i++)
if (nr[i]==0) for(j=i;j<=nmax;j+=i) nr[j]++;
for (i=1;i<=nmax;i++) d[nr[i]][i]=i;
for (i=1;i<=7;i++) for (j=1;j<=nmax;j++) d[i][j]=max(d[i][j],d[i][j-1]);
}
int main()
{
ciur();
cin>>t;
for (i=1;i<=t;i++) {cin>>x>>y; cout<<d[y][x]<<"\n";}
cin.close();
cout.close();
return 0;
}