Pagini recente » Cod sursa (job #1846415) | Cod sursa (job #1486092) | Cod sursa (job #1905596) | Cod sursa (job #1356556) | Cod sursa (job #2282754)
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b)
{
if (a==0) return b;
return gcd(b%a, a);
}
int main()
{
ifstream fin("frac.in"); ofstream fout("frac.out");
long long n,i,j=0,k,Euler,m,p,q,u[12];
fin>>n;Euler=n;k=n;
for(i=2;n>1;i++) {if((n/i)*i==n) {while((n/i)*i==n) n=n/i; u[j]=i;j++;}}
for(i=0;i<j;i++) Euler=(Euler/u[i])*(u[i]-1);
fin>>m;
p=m%Euler;q=m/Euler; i=0;j=1;
while((i<k)&&(j<=p)){
i++;
if(gcd(i,k)==1) j++;
}
fout<<(q*k+i);
return 0;
}