Print the corner elements and their sum in a 2-D matrix
Given a 2-D matrix. The task is to print its corner elements and the sum of the corner elements.
Examples: That
Input: 2 7 5 5 5 8 2
2 4 4 8 8 3 5
6 9 3 4 5 4 3
7 1 3 7 4 2 8
6 9 6 5 6 8 9
8 6 9 9 8 3 6
Output: Corner elements: 2 8 2 6, Corner_Sum = 18
Input: 6 4 6 9
2 6 1 8
5 5 2 2
4 4 1 3
Output: Corner elements: 6 4 9 3, Corner_Sum = 22
Approach: The corner element’s index in a 2-D matrix are:
- left top corner: arr[0][0]
- right top corner: arr[0][m-1]
- left bottom corner: arr[n-1][0]
- right bottom corner: arr[n-1][m-1]
where ‘m’ is the number of columns and ‘n’ is the number of rows.
Below is the implementation of the above approach.
C++
// C++ program to print the corner // elements and their sum #include <iostream> using namespace std; const int n = 3; const int m = 3; // function to print corner elements // their sum void printCornerElements(int arr[][m]) { // print the corner elements cout << "left top corner: " << arr[0][0]; cout << "\nright top corner: " << arr[0][m - 1]; cout << "\nleft bottom corner: " << arr[n - 1][0]; cout << "\nright bottom corner: " << arr[n - 1][m - 1]; // print the sum of corner elements cout << "\n\nCorner elements Sum = " << arr[0][0] + arr[0][m - 1] + arr[n - 1][0] + arr[n - 1][m - 1]; } // Driver Code int main() { int arr[][3] = { { 1, 2, 4 }, { 5, 6, 8 }, { 8, 3, 1 } }; // Function to print the corner // elements and their sum printCornerElements(arr); } |
chevron_right
filter_none
Java
// Java program to print the // corner elements and their sum class GFG { static final int n = 3; static final int m = 3; // function to print corner // elements their sum static void printCornerElements(int arr[][]) { // print the corner elements System.out.println("left top corner: " + arr[0][0]); System.out.println("right top corner: " + arr[0][m - 1]); System.out.println("left bottom corner: " + arr[n - 1][0]); System.out.println("right bottom corner: " + arr[n - 1][m - 1]); // print the sum of corner elements System.out.print("\nCorner elements Sum = "); System.out.println(arr[0][0] + arr[0][m - 1] + arr[n - 1][0] + arr[n - 1][m - 1]); } // Driver Code public static void main(String args[]) { int arr[][] ={{1, 2, 4}, {5, 6, 8}, {8, 3, 1}}; // Function to print the corner // elements and their sum printCornerElements(arr); } } // This code is contributed // by Ankita_Saini |
chevron_right
filter_none
Python3
# Python3 program to print the corner # elements and their sum # function to print the # corner element and their sum . def printCornerElement(arr) : # no. of rows n = len(arr) # no. of columns m = len(arr[0]) # print the corner elements print("left top corner :",arr[0][0]) print("right top corner :",arr[0][m - 1]) print("left bottom corner :",arr[n - 1][0]) print("right bottom corner :",arr[n - 1][m - 1]) # sum of corner elements corner_sum = (arr[0][0] + arr[0][m - 1] + arr[n - 1][0] + arr[n - 1][m - 1]) print("\ncorner elements Sum :",corner_sum) # driver code if __name__ == "__main__" : # 2d array arr = [ [1,2,4], [5,6,8], [8,3,1], ] # function calling printCornerElement(arr) |
chevron_right
filter_none
C#
// C# program to print // the corner elements // and their sum using System; class GFG { static int n = 3; static int m = 3; // function to print corner // elements their sum static void printCornerElements(int[,] arr) { // print the corner elements Console.WriteLine("left top corner: " + arr[0, 0]); Console.WriteLine("right top corner: " + arr[0, m - 1]); Console.WriteLine("left bottom corner: " + arr[n - 1, 0]); Console.WriteLine("right bottom corner: " + arr[n - 1, m - 1]); // print the sum of corner elements Console.Write("\nCorner elements Sum = "); Console.Write(arr[0, 0] + arr[0, m - 1] + arr[n - 1, 0] + arr[n - 1, m - 1]); } // Driver Code public static void Main() { int[,] arr ={{1, 2, 4}, {5, 6, 8}, {8, 3, 1}}; // Function to print the corner // elements and their sum printCornerElements(arr); } } // This code is contributed // by Akanksha Rai(Abby_akku) |
chevron_right
filter_none
PHP
<?php // PHP program to print the corner // elements and their sum $n = 3; $m = 3; // function to print corner // elements their sum function printCornerElements(&$arr) { global $n, $m; // print the corner elements echo "left top corner: " . $arr[0][0]; echo "\nright top corner: " . $arr[0][$m - 1]; echo "\nleft bottom corner: " . $arr[$n - 1][0]; echo "\nright bottom corner: " . $arr[$n - 1][$m - 1]; // print the sum of corner elements echo "\n\nCorner elements Sum = ". ($arr[0][0] + $arr[0][$m - 1] + $arr[$n - 1][0] + $arr[$n - 1][$m - 1]); } // Driver Code $arr = array(array( 1, 2, 4 ), array( 5, 6, 8 ), array( 8, 3, 1 )); // Function to print the corner // elements and their sum printCornerElements($arr); // This code is contributed // by ChitraNayal ?> |
chevron_right
filter_none
Output:
left top corner: 1 right top corner: 4 left bottom corner: 8 right bottom corner: 1 Corner elements Sum = 14
Recommended Posts:
- Check if matrix A can be converted to B by changing parity of corner elements of any submatrix
- Program to print elements of a Matrix row-wise skipping alternate elements
- Print all the sub diagonal elements of the given square matrix
- Remove any corner X rows and columns from a matrix
- Print all the super diagonal elements of the given square matrix
- Minimum cost to reach from the top-left to the bottom-right corner of a matrix
- Print all elements in sorted order from row and column wise sorted matrix
- heapq in Python to print all elements in sorted order from row and column wise sorted matrix
- Minimum difference between adjacent elements of array which contain elements from each row of a matrix
- Find sum of all elements in a matrix except the elements in row and/or column of given cell?
- Move matrix elements in given direction and add elements with same value
- Program to swap upper diagonal elements with lower diagonal elements of matrix.
- Print the matrix diagonally downwards
- Print matrix in zag-zag fashion
- Print matrix in zig-zag fashion from the last column
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
