using System;

​

public class Program

{

    public static void Main()

    {

        // Get the size of the array from the user

        Console.Write("Enter the size of the array: ");

        int n = int.Parse(Console.ReadLine());

        // Initialize the array of size N x N with random numbers

        int[, ] array = new int[n, n];

        Random rand = new Random();

        for (int i = 0; i < n; i++)

        {

            for (int j = 0; j < n; j++)

            {

                array[i, j] = rand.Next(1, 100);

            }

        }

​

        // Print the array

        Console.WriteLine("The array is:");

        PrintArray(array);

        // Calculate the average of the array members

        double average = CalculateAverage(array);

        Console.WriteLine("The average of the array members is: {0}", average);

        // Find the most common number in the array

        int mostCommon = FindMostCommon(array);

        Console.WriteLine("The most common number in the array is: {0}", mostCommon);

        // Calculate the sum of the main diagonal

        int mainDiagonalSum = MainDiagonal(array);

        Console.WriteLine("The sum of the main diagonal is: {0}", mainDiagonalSum);

        // Calculate the sum of the secondary diagonal

        int secondaryDiagonalSum = SecondaryDiagonal(array);

        Console.WriteLine("The sum of the secondary diagonal is: {0}", secondaryDiagonalSum);

        // Calculate the sum of the biggest row

        int rowmax = RowMax(array);

        Console.WriteLine("The greatest sum of all rows is row number: {0}", rowmax);

        // Calculate the sum of the smallest column

        int colmin = ColMin(array);

        Console.WriteLine("The smallest sum of all cols is col number: {0}", colmin);

        Console.ReadLine();

    }

​

    // Prints the contents of a two-dimensional array

    public static void PrintArray(int[, ] array)

    {

        int n = array.GetLength(0);

        for (int i = 0; i < n; i++)

        {

            for (int j = 0; j < n; j++)

            {

                Console.Write("{0,4}", array[i, j]);

            }

​

            Console.WriteLine();

        }

    }

​

    // Calculates the average of the elements in a two-dimensional array

    public static double CalculateAverage(int[, ] array)

    {

        int n = array.GetLength(0);

        int sum = 0;

        for (int i = 0; i < n; i++)

        {

            for (int j = 0; j < n; j++)

            {

                sum += array[i, j];

            }

        }

​

        return sum / (n * n);

    }

​

    // Finds the most common element in a two-dimensional array

    public static int FindMostCommon(int[, ] array)

    {

        int n = array.GetLength(0);

        int[] counts = new int[100]; // keep track of how many times each number appears

        int maxCount = 0;

        int mostCommon = 0;

        for (int i = 0; i < n; i++)

        {

            for (int j = 0; j < n; j++)

            {

                int num = array[i, j];

                counts[num]++;

                if (counts[num] > maxCount)

                {

                    maxCount = counts[num];

                    mostCommon = num;

                }

            }

        }

​

        return mostCommon;

    }

​

    // Calculates the sum of the main diagonal 

    public static int MainDiagonal(int[, ] array)

    {

        int n = array.GetLength(0);

        int sum = 0;

        for (int i = 0; i < n; i++)

        {

            sum += array[i, i];

        }

​

        return sum;

    }

​

    // Calculates the sum of the secondary diagonal 

    public static int SecondaryDiagonal(int[, ] array)

    {

        int n = array.GetLength(0);

        int sum = 0;

        for (int i = 0; i < n; i++)

        {

            sum += array[i, n - i - 1];

        }

​

        return sum;

    }

​

    public static int RowMax(int[, ] array)

    {

        int k = array.GetLength(1);

        int n = array.GetLength(0);

        int sum = 0;

        int max = 0;

        int index = 0;

        for (int i = 0; i < n; i++)

        {

            for (int j = 0; j < k; j++)

            {

                sum += array[i, j];

                if (sum > max)

                {

                    max = sum;

                    index = i;

                }

            }

        }

​

        return index;

    }

    //This part of the code is trying to find the column that has the smallest sum of all the columns

    public static int ColMin(int[, ] array)

    {

        int k = array.GetLength(1);

        int n = array.GetLength(0);

        int min = 999;

        int index = 0;

        for (int j = 0; j < k; j++)

        {

            int sum = 0;

            for (int i = 0; i < n; i++)

            {

                sum += array[i, j];

            }

​

            if (sum < min)

            {

                min = sum;

                index = j;

            }

        }

​

        return index;

    }

}