how to print sum of each sand glass in a 6*6 matrix

Ans For Question 1:

// C# program to find maximum
// sum of hour glass in matrix
using System;
class GFG {
static int R = 5;
static int C = 5;
// Returns maximum sum of
// hour glass in ar[][]
static int findMaxSum(int [,]mat)
{
if (R < 3 || C < 3)
return -1;
// Here loop runs (R-2)*(C-2)
// times considering different
// top left cells of hour glasses.
int max_sum = int.MinValue;
for (int i = 0; i < R - 2; i++)
{
for (int j = 0; j < C - 2; j++)
{
// Considering mat[i][j] as top
// left cell of hour glass.
int sum = (mat[i, j] + mat[i, j + 1] +
mat[i, j + 2]) + (mat[i + 1, j + 1]) +
(mat[i + 2, j] + mat[i + 2, j + 1] +
mat[i + 2, j + 2]);
// If previous sum is less then
// current sum then update
// new sum in max_sum
max_sum = Math.Max(max_sum, sum);
}
}
return max_sum;
}
// Driver code
static public void Main(String[] args)
{
int [,]mat = {{1, 2, 3, 0, 0},
{0, 0, 0, 0, 0},
{2, 1, 4, 0, 0},
{0, 0, 0, 0, 0},
{1, 1, 0, 1, 0}};
int res = findMaxSum(mat);
if (res == -1)
Console.WriteLine("Not possible");
else
Console.WriteLine("Maximum sum of hour glass = "
+ res);
}
}
// This code is contributed by vt_m .

Ans For Question 2:

// C# program to find maximum
// sum of hour glass in matrix
using System;
class GFG {
static int R = 5;
static int C = 5;
// Returns maximum sum of
// hour glass in ar[][]
static int findMaxSum(int [,]mat)
{
if (R < 3 || C < 3)
return -1;
// Here loop runs (R-2)*(C-2)
// times considering different
// top left cells of hour glasses.
int max_sum = int.MinValue;
for (int i = 0; i < R - 2; i++)
{
for (int j = 0; j < C - 2; j++)
{
// Considering mat[i][j] as top
// left cell of hour glass.
int sum = (mat[i, j] + mat[i, j + 1] +
mat[i, j + 2]) + (mat[i + 1, j + 1]) +
(mat[i + 2, j] + mat[i + 2, j + 1] +
mat[i + 2, j + 2]);
// If previous sum is less then
// current sum then update
// new sum in max_sum
max_sum = Math.Max(max_sum, sum);
}
}
return max_sum;
}
// Driver code
static public void Main(String[] args)
{
int [,]mat = {{1, 2, 3, 0, 0},
{0, 0, 0, 0, 0},
{2, 1, 4, 0, 0},
{0, 0, 0, 0, 0},
{1, 1, 0, 1, 0}};
int res = findMaxSum(mat);
if (res == -1)
Console.WriteLine("Not possible");
else
Console.WriteLine("Maximum sum of hour glass = "
+ res);
}
}
// This code is contributed by vt_m .

2 Replies

Know the answer? Post it — somebody with the same question will find it here.

Sonu Gupta7y ago
This is a not a solution for my question. My question related to sand glass.
0
Gajendra Jangid7y ago
Ans For Question 1:
// C# program to find maximum
// sum of hour glass in matrix
using System;

class GFG {

static int R = 5;
static int C = 5;

// Returns maximum sum of
// hour glass in ar[][]
static int findMaxSum(int [,]mat)
{
    if (R < 3 || C < 3)
        return -1;

    // Here loop runs (R-2)*(C-2)
    // times considering different
    // top left cells of hour glasses.
    int max_sum = int.MinValue;
    for (int i = 0; i < R - 2; i++)
    {
        for (int j = 0; j < C - 2; j++)
        {
            // Considering mat[i][j] as top
            // left cell of hour glass.
            int sum = (mat[i, j] + mat[i, j + 1] +
                    mat[i, j + 2]) + (mat[i + 1, j + 1]) +
                    (mat[i + 2, j] + mat[i + 2, j + 1] +
                    mat[i + 2, j + 2]);

            // If previous sum is less then
            // current sum then update
            // new sum in max_sum
            max_sum = Math.Max(max_sum, sum);
        }
    }
    return max_sum;
}

    // Driver code
    static public void Main(String[] args)
    {
        int [,]mat = {{1, 2, 3, 0, 0},
                    {0, 0, 0, 0, 0},
                    {2, 1, 4, 0, 0},
                    {0, 0, 0, 0, 0},
                    {1, 1, 0, 1, 0}};
        int res = findMaxSum(mat);
        if (res == -1)
            Console.WriteLine("Not possible");
        else
            Console.WriteLine("Maximum sum of hour glass = "
                            + res);
    }

}

// This code is contributed by vt_m .
Ans For Question 2:
// C# program to find maximum
// sum of hour glass in matrix
using System;

class GFG {

static int R = 5;
static int C = 5;

// Returns maximum sum of
// hour glass in ar[][]
static int findMaxSum(int [,]mat)
{
    if (R < 3 || C < 3)
        return -1;

    // Here loop runs (R-2)*(C-2)
    // times considering different
    // top left cells of hour glasses.
    int max_sum = int.MinValue;
    for (int i = 0; i < R - 2; i++)
    {
        for (int j = 0; j < C - 2; j++)
        {
            // Considering mat[i][j] as top
            // left cell of hour glass.
            int sum = (mat[i, j] + mat[i, j + 1] +
                    mat[i, j + 2]) + (mat[i + 1, j + 1]) +
                    (mat[i + 2, j] + mat[i + 2, j + 1] +
                    mat[i + 2, j + 2]);

            // If previous sum is less then
            // current sum then update
            // new sum in max_sum
            max_sum = Math.Max(max_sum, sum);
        }
    }
    return max_sum;
}

    // Driver code
    static public void Main(String[] args)
    {
        int [,]mat = {{1, 2, 3, 0, 0},
                    {0, 0, 0, 0, 0},
                    {2, 1, 4, 0, 0},
                    {0, 0, 0, 0, 0},
                    {1, 1, 0, 1, 0}};
        int res = findMaxSum(mat);
        if (res == -1)
            Console.WriteLine("Not possible");
        else
            Console.WriteLine("Maximum sum of hour glass = "
                            + res);
    }

}

// This code is contributed by vt_m .
0