Pagini recente » Cod sursa (job #2227360) | Cod sursa (job #260898) | Cod sursa (job #2938336) | Cod sursa (job #9725) | Cod sursa (job #1938403)
#include <iostream>
#include <climits>
#include <fstream>
using namespace std;
ifstream f("divprim.in");
ofstream g("divprim.out");
int t,i,j,x,vx,mmax,ok,nr1;
struct
{
int k,nr;
} v[100001];
struct
{
int uno,div;
} prim[1000000];
int main()
{
mmax=INT_MIN;
f>>t;
for(i=1;i<=t;i++)
{
f>>v[i].nr>>v[i].k;
if(v[i].nr>mmax)
mmax=v[i].nr;
}
prim[1].uno=1;
for(i=2;i*i<=mmax;i++)
{
if(prim[i].uno==0)
for(j=2;j<=mmax/i;j++)
{
prim[i*j].uno=1;
prim[i*j].div++;
if(prim[j].uno==0&&j*j>mmax&&j%(i+1)!=0)
prim[i*j].div++;
}
}
for(i=1;i<=t;i++)
{
vx=0;
for(x=v[i].nr;x>=1&&ok!=1;x--)
{
if(prim[x].div==v[i].k)
{
ok=1;
vx=x;
}
}
ok=0;
g<<vx<<"\n";
}
return 0;
}