# Geeksforgeeks Solution For " Diagonal sum "

GeeksforGeeks Solution For School Domain .Below You Can Find The Solution Of Basic ,Easy ,Medium ,Hard .You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers

Problem :- Given a square matrix of size M×M . Your task is to calculate the sum of its diagonals.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. First line of each test case contains a single integer M denoting the size of the square matrix. The next  line contains M*M space separated values of the matrix A.

Output:
For each test case in a new line print the sum of diagonals of the matrix.

Solution :-

#include <bits/stdc++.h>
using namespace std;
int main()
{
int T;
cin>>T;
while(T--)
{
int i,j,n,sum=0;
cin>>n;
int ar[n][n];
for(i=0;i<n;i++)
for(j=0;j<n;j++)
cin>>ar[i][j];

for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(i==j)
sum+=ar[i][j];
if((i+j)==(n-1))
sum+=ar[i][j];
}
}
cout<<sum<<endl;
}
return 0;

}

Output :-