Pagini recente » Cod sursa (job #2060390) | Cod sursa (job #1155073) | Cod sursa (job #1384681) | Cod sursa (job #1689755) | Cod sursa (job #1863930)
#include <cstdio>
#include <vector>
#define MAXN 1000000
using namespace std;
char ciur[MAXN+1];
vector <int> v[8];
int n;
inline int result(int mod)
{
int maxim=0;
for(int i=0;i<v[mod].size();i++)
if(v[mod][i]<=n)
maxim=max(maxim,v[mod][i]);
return maxim;
}
int main()
{
FILE *fin,*fout;
fin=fopen("divprim.in","r");
fout=fopen("divprim.out","w");
int j,t,i;
for(i=2;i<=MAXN;i++)
if(!ciur[i])
for(j=i;j<=MAXN;j+=i)
ciur[j]++;
for(i=0;i<=MAXN;i++)
v[ciur[i]].push_back(i);
fscanf(fin,"%d",&t);
for(i=0;i<t;i++)
{
fscanf(fin,"%d%d",&n,&j);
fprintf(fout,"%d\n",result(j));
}
fclose(fin);
fclose(fout);
return 0;
}