Pagini recente » Cod sursa (job #2113983) | Cod sursa (job #2864288) | Cod sursa (job #1842959) | Cod sursa (job #1572627) | Cod sursa (job #474373)
Cod sursa(job #474373)
#include<cstdio>
long long n,k,i,p;
long long nr,nr2,rest;
long long euclid ( long long a, long long b)
{
if (!b) return a;
return euclid( b , a%b);
}
int main()
{
freopen("frac.in","r",stdin);
freopen("frac.out","w",stdout);
scanf("%lld%lld", &n , &k);
nr++;
for (i=2;i<=n;i++)
{
if ( euclid ( i , n) ==1 )
nr++;
}
p= n * ( k/nr) ;
nr2=1;
rest=k%nr;
if (rest==1)
{
printf("%lld" , p + 1);
return 0;
}
for (i=2;i<=n;i++)
{
if ( euclid ( i , n) ==1 )
{
nr2++;
if (nr2==rest) printf("%lld" , p + i);
return 0;
}
}
return 0;
}