program of find the HCM and LCM


int main() {
int a, b, x, y, t, gcd, lcm;

printf(“Enter two integers\n”);
scanf(“%d%d”, &x, &y);

a = x;
b = y;

while (b != 0) {
t = b;
b = a % b;
a = t;

gcd = a;
lcm = (x*y)/gcd;

printf(“Greatest common divisor of %d and %d = %d\n”, x, y, gcd);
printf(“Least common multiple of %d and %d = %d\n”, x, y, lcm);

return 0;

Leave a comment

Your email address will not be published. Required fields are marked *