最大公约数和最小公倍数题解

#include <bits/stdc++.h>
using namespace std;
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) {
	return a * b / gcd(a,b);
}
int main() {
	int a,b;
	cin >> a >> b;
	cout << "GCD=" << gcd(a, b) << endl;
	cout << "LCM=" << lcm(a, b) << endl;
}