Pagini recente » Cod sursa (job #1550345) | Cod sursa (job #2702862) | Cod sursa (job #3298467) | Cod sursa (job #1137094) | Cod sursa (job #59271)
Cod sursa(job #59271)
#include<fstream.h>
long long n, p;
int prim(long x,long y)
{
while (x!=y)
{
if (x>y) x=x-y;
else y-=x;
}
if (x==1) return 1;
return 0;
}
void calcul()
{
long long nr, contor=0;
ifstream in("frac.in");
in>>n>>p;
nr=0;
while (contor<p)
{
nr++;
if (n%2==0 && nr%2==0);
else if (prim(n,nr)) contor++;
}
ofstream out("frac.out");
out<<nr;
in.close();
out.close();
}
int main()
{
calcul();
return 0;
}