using System;

using System.Linq;

using System.Collections.Generic;

public class Program

{

    public static void Main()

    {

        Console.WriteLine("Hello World");

            int[] ribbons = new int[] {5, 2, 7, 4, 9};

            int numberofRibbons = 5;

        //expected output is 4

        int l1 = cutTheRibbons(ribbons, numberofRibbons);

        int[] ribbons1 = new int[] {1, 2, 3, 4, 9};

            int numberofRibbons1 = 6;

        //expected output is 2

        int l2 = cutTheRibbons(ribbons1, numberofRibbons1);

    }

    static int cutTheRibbons(int[] a, int k) {

        int shortest =0;

        int longest =a.Max();

        Array.Reverse(a);

        Console.WriteLine("Max value of Array is {0}", a.Max()); 

        int length = (shortest + longest) /2;

        Console.WriteLine("length {0}",length); 

        for (int x = 1; x <= a.Length; x++)

        {

            Console.WriteLine(a[x - 1].ToString());

            Console.WriteLine(a[x-1]%k<=0);

            /*if (a[x-1]%k=k){              

                length = 

            } else {

            }*/

        }

        return length;

    }

    static int[] sortArrays(int[] arr)

    {

        // Finding the length of array 'arr'

        int length = arr.Length;

        // Sorting using a single loop

        for (int j = 0; j < length - 1; j++)

        {

            // Checking the condition for two

            // simultaneous elements of the array

            if (arr[j] > arr[j + 1])

            {

                // Swapping the elements.

                int temp = arr[j];

                arr[j] = arr[j + 1];

                arr[j + 1] = temp;

                // updating the value of j = -1

                // so after getting updated for j++

                // in the loop it becomes 0 and

                // the loop begins from the start.

                j = -1;

            }

        }

        return arr;

    }

}