这道题用递归会不会更快（题解已发

#include <iostream>
using namespace std;
int a,b;
int f(int x,int y){
	if(x%y == 0) return y;
	return f(y,x%y);
}
int main(){
	cin >> a>>b;
	cout <<"GCD="<< f(a,b) <<endl;
	cout <<"LCM="<< a*b/f(a,b);
	return 0;
}



```cpp
#include<iostream>
using namespace std;
int GCD (int n, int m)
{
    int s, b;
    if(n > m)
    {
        s = m;
        b = n;
    }
    else
    {
        s = n;
        b = m;
    }
    for(int i = s; i > 0; i--)
    {
        if(n % i == 0 && m % i == 0)
            return i;
    }

}
int LCM(int n, int m)
{
    int s, b;
    if(n > m)
    {
        s = m;
        b = n;
    }
    else
    {
        s = n;
        b = m;
    }
    for(int i=b;;i++)
    {
        if(i % n == 0 && i % m == 0)
            return i;
    }
}
int main(){
	int a, b;
	cin >> a >> b;
	cout << "GCD="<< GCD(a,b) << endl;
	cout<<"LCM="<< LCM(a,b) << endl; 
}

```


全部评论 3