Count Subarray of size K in given Array with given LCM

// Java code to implement the approach

import java.io.*;

class GFG {

    // Function to calculate GCD
    static int gcd(int a, int b)
    {
        return b == 0 ? a : gcd(b, a % b);
    }

    // Calculate LCM between a and b
    static int LCM(int a, int b)
    {
        int prod = a * b;
        return prod / gcd(a, b);
    }

    // Function to calculate number of subarrays
    // where LCM is equal to k and
    // size of subarray is S
    static int subarrayEqualsLCMSize(int[] arr, int k,
                                     int S, int N)
    {
        // Initialize variable to store number of subarrays
        int count = 0;

        // Generating all subarrays
        for (int i = 0; i < N; i++) {
            int lcm = arr[i];
            for (int j = i; j < N; j++) {
                // Function call to calculate lcm
                lcm = LCM(lcm, arr[j]);

                // Check the conditions given
                if (lcm == k && j - i + 1 == S) {
                    count++;
                }

                // If LCM becomes larger than k,
                // break as LCM is never going to
                // decrease
                if (lcm > k) {
                    break;
                }
            }
        }

        // Return the count of subarrays
        return count;
    }

    public static void main(String[] args)
    {
        int[] arr = { 3, 2, 6, 8, 4 };
        int N = arr.length;
        int K = 6, S = 2;

        // Function call
        System.out.print(
            subarrayEqualsLCMSize(arr, K, S, N));
    }
}