Pagini recente » Cod sursa (job #2067832) | Cod sursa (job #720084) | Cod sursa (job #543625) | Cod sursa (job #2901765) | Cod sursa (job #236049)
Cod sursa(job #236049)
#include <stdio.h>
long long n,p,k;
int euclid (int a,int b)
{
int r;
do
{
r=a%b;
a=b;
b=r;
}
while (r);
return a;
}
int main ()
{
freopen ("frac.in","r",stdin);
freopen ("frac.out","w",stdout);
long long i,dv;
scanf ("%lld%lld",&n,&p);
for (i=1; ; ++i)
{
dv=euclid (i,n);
if (dv==1)
++k;
if (k==p)
{
printf ("%lld",i);
break;
}
}
return 0;
}