Pagini recente » Cod sursa (job #1025529) | Cod sursa (job #571480) | Cod sursa (job #1990275) | Cod sursa (job #1468093) | Cod sursa (job #2222500)
#include <bits/stdc++.h>
using namespace std;
long long cmmdc(long long a,long long b)
{
long long r;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int v[1000005];
int cnt;
int main()
{
freopen("frac.in","r",stdin);
freopen("frac.out","w",stdout);
long long n ,k;
scanf("%lld%lld",&n,&k);
long long r=n,t1=n;
long long d=2,e=0;
while(d*d<=r)
{
while(r%d==0)
{
e++;
r/=d;
}
if(e)t1*=(d-1),t1/=d;
d++;
e=0;
}
if(r>1)
t1*=(r-1),t1/=r;
k--;
long long sol=(k/t1)*n;
k%=t1;
k++;
int r1=0;
long long i;
for(i=1;i<=n;i++)
{
long long s=cmmdc(i,n);
if(s==1)
{
++r1;
if(k==r1)
{
sol+=i;
printf("%lld\n",sol);
return 0;
}
if(k+r1==t1)
{
sol+=n-i;
printf("%lld\n",sol);
return 0;
}
}
}
return 0;
}