wap in java to find hcf and lcm of 2 numbers

Here is a simple Java program to find the HCF (Highest Common Factor) and LCM (Lowest Common Multiple) of two numbers:

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.println("Enter the first number:");
        int num1 = scanner.nextInt();
        System.out.println("Enter the second number:");
        int num2 = scanner.nextInt();
        int hcf = hcf(num1, num2);
        System.out.println("HCF of " + num1 + " and " + num2 + " is " + hcf);
        int lcm = lcm(num1, num2, hcf);
        System.out.println("LCM of " + num1 + " and " + num2 + " is " + lcm);
    }

    public static int hcf(int num1, int num2) {
        if (num2 == 0) {
            return num1;
        }
        return hcf(num2, num1 % num2);
    }

    public static int lcm(int num1, int num2, int hcf) {
        return (num1 * num2) / hcf;
    }
}

Here's how it works:

1. The main method prompts the user to enter two numbers.
2. It then calls the hcf method, passing the two numbers as arguments. This method uses the Euclidean algorithm to find the HCF of the two numbers.
3. The HCF is then printed to the console.
4. The main method then calls the lcm method, passing the two numbers and the HCF as arguments. This method calculates the LCM by dividing the product of the two numbers by their HCF.
5. The LCM is then printed to the console.