using System;

using System.Collections.Generic;

public class Program

{

    public static void Main()

    {

        Console.WriteLine("Hello Ben...");

        Console.WriteLine(LCM(new int[]{2,4,3,6,11}));

    }

    private static int LCM(int[] args){

        HashSet<int> deDuped = new HashSet<int>(args);      // Must remove duplicates

        if(deDuped.Contains(0))

            deDuped.Remove(0);                              // Remove zero if it exists in the arrays

        deDuped.CopyTo(args);                               // Copy our de-duplicated set back to the array

        int retVal = args[0];                               

        int maxArrVal = args[0];    // Initialise the max to the first value in the array

        // If the array only has one element, return it

        if (args.Length==1) return retVal;

        int maxPossible = 1;        // The max possible is all array values multiplied together so let's start with 1

        /* Find the highest value in our array while simultaneously calculating the upper limit of our multiple */

        for(int i=0;i<args.Length;i++) 

        {

            maxArrVal = args[i]>maxArrVal?args[i]:maxArrVal;

            Console.WriteLine("MP: " + maxPossible.ToString());

            maxPossible *= args[i];

        }

        Console.WriteLine("Max: " + maxPossible.ToString());

        // The lowest common multiple is obviously a multiple of our highest value; let's keep adding that value and testing the modulo until all are 0

        int currentVal = maxArrVal;

        int cnt = 1;

        while (currentVal <= maxPossible)

        {

            int totalMod = 0;

            for (int i=0;i<args.Length;i++){

                totalMod += currentVal%args[i];

                Console.WriteLine("C: " + currentVal.ToString() + " - A: " + args[i].ToString() + " - M: " + (currentVal%args[i]).ToString());

                if(totalMod>0) break;

            }

            if (totalMod == 0) return currentVal;

            ++cnt;

            currentVal = maxArrVal * cnt;

        }

        Console.WriteLine("Returning MAX");

        return maxPossible;

    }

}