Pagini recente » Cod sursa (job #498765) | Cod sursa (job #2096367) | Cod sursa (job #1699446) | Cod sursa (job #1071504) | Cod sursa (job #474372)
Cod sursa(job #474372)
#include<cstdio>
int n,k,i,p;
int a[1<<12];
int euclid ( int a, int b)
{
if (!b) return a;
return euclid( b , a%b);
}
int main()
{
freopen("frac.in","r",stdin);
freopen("frac.out","w",stdout);
scanf("%d%d", &n , &k);
a[++a[0]]=1;
for (i=2;i<=n;i++)
{
if ( euclid ( i , n) ==1 )
a[++a[0]]=i;
}
p= n * ( k/a[0]) ;
printf("%d" , p + a[k%a[0]]);
return 0;
}