小题解（递归

#include<bits/stdc++.h>
using namespace std;
int GCD(int n,int m){
    if(m==0){
        return n;
	}
    else{
        return GCD(m,n%m);
    }
}
int LCM(int n,int m){
    return n/GCD(n,m)*m;;
}
int main(){
	int a,b;
	cin>>a>>b;
	cout<<"GCD="<<GCD(a,b)<<endl;
	cout<<"LCM="<<LCM(a,b)<<endl; 
        return 0;
}