Cod sursa(job #2590354)
Utilizator | Swan Katherine Katherine456719 | Data | 27 martie 2020 19:37:29 |
---|---|---|---|
Problema | Frac | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
#define nmax 1000005
using namespace std;
ifstream f("frac.in");
ofstream g ("frac.out");
bool v[nmax];
int b[nmax],k;
void ciur()
{
for(int i=2;i<=nmax-5;i++)
if(v[i]!=1)
for(int j=2*i;j<=nmax;j+=i)
v[j]=1;
for(int i=2;i<=nmax;i++)
if(v[i]==0)
b[++k]=i;
}
void div(int x)
{
for(int i=1;b[i]<=x and i<=k;i++)
if(x%b[i]==0)
v[b[i]]=1;
}
int main()
{
long long n,p;
f>>n>>p;
ciur();
div(n);
int i;
for(i=1;i<=nmax and p>0;i++)
if(v[i]==0)
p--;
g<<i-1;
return 0;
}