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

Question

Q1. how to print sum of each sand glass in a 6*6 matrix Q2. how to print max sum from also sand glass in a 6*6 matrix

Sonu Gupta · Answer

This is a not a solution for my question. My question related to sand glass.

Gajendra Jangid · Answer

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 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 { for ( int j = 0; 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 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 { for ( int j = 0; 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 .