C program to find HCF and LCM using recursion
This tutorial on finding HCF and LCM of a whole number using C language was helpful to understand the basic techniques and mathematical operations in C language.
|
1 |
#include <stdio.h>long gcd(long, long);int main() {long x, y, hcf, lcm;printf("Enter two integers\n");scanf("%ld%ld", &x, &y);hcf = gcd(x, y);lcm = (x*y)/hcf;printf("Greatest common divisor of %ld and %ld = %ld\n", x, y, hcf);printf("Least common multiple of %ld and %ld = %ld\n", x, y, lcm);return 0;}long gcd(long a, long b) {if (b == 0) {return a;}else {return gcd(b, a % b);}}</stdio.h> |
