ProAnswers.org

C program to find HC and LCM

C program to find hcf and lcm

HCF is also known as greatest common divisor(GCD) or greatest common factor(gcf).

#include

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

printf(“Enter two integers
“);
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
", x, y, gcd);
printf("Least common multiple of %d and %d = %d
", x, y, lcm);

return 0;
}

using recursion

#include

long gcd(long, long);

int main() {
long x, y, hcf, lcm;

printf(“Enter two integers
“);
scanf(”%ld%ld”, &x, &y);

hcf = gcd(x, y);
lcm = (x*y)/hcf;

printf("Greatest common divisor of %ld and %ld = %ld
", x, y, hcf);
printf("Least common multiple of %ld and %ld = %ld
", x, y, lcm);

return 0;
}

long gcd(long a, long b) {
if (b == 0) {
return a;
}
else {
return gcd(b, a % b);
}
}

using function

#include

long gcd(long, long);

int main() {
long x, y, hcf, lcm;

printf(“Enter two integers
“);
scanf(”%ld%ld”, &x, &y);

hcf = gcd(x, y);
lcm = (x*y)/hcf;

printf("Greatest common divisor of %ld and %ld = %ld
", x, y, hcf);
printf("Least common multiple of %ld and %ld = %ld
", x, y, lcm);

return 0;
}

long gcd(long x, long y) {
if (x == 0) {
return y;
}

while (y != 0) {
if (x > y) {
x = x - y;
}
else {
y = y - x;
}
}

return x;
}