Pagini recente » Cod sursa (job #1872069) | Cod sursa (job #2669475) | Cod sursa (job #3132189) | Cod sursa (job #884477) | Cod sursa (job #686427)
Cod sursa(job #686427)
#include<fstream>
#include <bitset>
using namespace std;
ifstream cin("frac.in");
ofstream cout("frac.out");
#define INFINIT 1200000000
bitset <INFINIT> prime;
long long nr,n;
void fa(long long k)
{
long long i,nrr=nr*nr;
i=k;
while (i<nrr)
{
if (!prime[i]) {prime[i]=1;}
i=i+k;
}
}
int main()
{ long long i,d=2;
cin>>n>>nr;
while (n>1)
{
if (n%d==0) {fa(d);
while (n%d==0) n=n/d;
}
d++;
}
long long nr_frac=0;
i=0;
while(nr_frac<nr)
{i++;
if (prime[i]==0) nr_frac++;
}
cout<<i;
return 0;
}