To Find HCF LCM in C

#include <stdio.h>
#include <conio.h>

void main() {
    int a, b, i, j, t, gcd, lcm;
    printf("Enter two integers\n");
    scanf("%d %d", &a, &b);
    i = a;
    j = b;
    while (j > 0) 
    {
        t = j;
        j = i % j;
        i = t;
    }
    gcd = i;
    lcm = (a*b)/gcd;
    printf("Greatest common divisor(GCD or HCF) of %d and %d is %d\n",a,b,gcd);
    printf("Least common multiple of %d and %d is %d\n",a,b,lcm);
    getch();
}

1. Start
2. Read inputs:
    - Prompt the user to enter two integers `a` and `b`.
    - Read the two values.
3. Initialize variables:
    - Set `i = a`
    - Set `j = b`
4. Compute GCD using the Euclidean algorithm:
    - While `j > 0` do:
    - Store the value of `j` in a temporary variable `t`.
    - Update `j` as `i` modulo `j` (`j = i % j`).
    - Update `i` with the value stored in `t`.
    - When the loop ends, `i` contains the GCD.
5. Calculate LCM:
    - Use the relationship:
      \[
      \text{LCM} = \frac{a \times b}{\text{GCD}}
      \]
6. Display results:
    - Print the GCD of `a` and `b`.
    - Print the LCM of `a` and `b`.
7. End