Pagini recente » Cod sursa (job #2517616) | Cod sursa (job #2400815) | Cod sursa (job #866058) | Cod sursa (job #312184) | Cod sursa (job #2278106)
#include <fstream>
using namespace std;
long long int n,p,a,nd,np,i,j,div,cnt;
bool prim[1000000],nr[1000000];
int main()
{
ifstream cin("frac.in");
ofstream cout("frac.out");
cin>>n>>p;
prim[1]=1;
for(i=2; i*i<=n; i++)
{
if(nr[i]==0)
if(n%i==0)
nr[i]=1;
}
if(n%2==1)
{
for(i=2; i*i<=1000000; i++)
{
if(prim[i]==0)
if((n%i==0||i%n==0)&&nr[i]==0)
prim[i]=1;
}
}
else
{
for(i=2; i*i<=1000000; i+=2)
prim[i]=1;
for(i=3; i*i<=100000000; i+=2)
{
if(prim[i]==0)
if((n%i==0||i%n==0)&&nr[i]==0)
prim[i]=1;
}
}
for(i=1; i<=1000000; i++)
{
if(prim[i]==0)
{
cnt++;
// cout<<i;
}
if(cnt==p)
cout<<i;
}
return 0;
}