题解

#include<iostream>
using namespace std;
//编写函数求GCD和LCM
int GCD(int a,int b){
    for(int i=min(a,b);i>=1;i--) if(a%i==0&&b%i==0) return i;
}
int LCM(int a,int b){
    for(int i=max(a,b);i<=a*b;i++) if(i%a==0&&i%b==0) return i;
}
int main(){
	int a,b;
	cin>>a>>b;
	cout<<"GCD="<<GCD(a,b)<<endl;
	cout<<"LCM="<<LCM(a,b)<<endl; 
}

//Greatest Common Divisor(GCD最大公约数)
//Least Common Multiple(LCM最小公倍数)