Euclid算法-C语言实现:
int gcd(int m, int n)
{
int r;
r = m>n?m%n:n%m;
if(r>0)
{
m>n?gcd(n,r):gcd(m,r);
}
else
{
return m>n?n:m;
}
}
Euclid算法-C语言实现:
int gcd(int m, int n)
{
int r;
r = m>n?m%n:n%m;
if(r>0)
{
m>n?gcd(n,r):gcd(m,r);
}
else
{
return m>n?n:m;
}
}