#include <iostream.h>
int main() {
int a, b, x, y, t, gcd, lcm;
cout<<"Enter two integers\n";
cin>>x>>y;
a = x;
b = y;
while (b != 0) {
t = b;
b = a % b;
a = t;
}
gcd = a;
lcm = (x*y)/gcd;
cout<<"Greatest common divisor of "<<x<<" and "<<y<<"="<<gcd;
cout<<"Least common multiple of "<<x<<" and "<<y<<"="<<lcm;
return 0;
}

Output:Enter two integers

15

33

Greatest common divisor of 15 and 33 =3

Least common multiple of 15 and 33 =165

need an explanation for this answer? contact us directly to get an explanation for this answer