辗转相除最小公倍数的递归求法

#include<iostream>
using namespace std;

int gcd(int a,int b)
{
return a%b?gcd(b,a%b):b;
}

int main()
{
cout<<gcd(3,12)<<endl;
}

 

转载于:https://www.cnblogs.com/Leozi/p/10835663.html