Social Icons

Sunday, 16 February 2014

Program to find sum of diagonals of a square Matrix

#include<iostream.h>
#include<conio.h>

void main()
{
clrscr();
int a[5][5],d1sum=0,d2sum=0,m,i,j;
cout<<"\n Ente size of the Matrix : ";
cin>>m;
cout<<"\n Enter the Matrix row wise\n";

for(i=0;i<m;i++)
for(j=0;j<m;++j)
cin>>a[i][j];
for(i=0;i<m;++i)
for(j=0;j<m;++j)
{
if(i==j)
d1sum+=a[i][j];
if(i+j==(m-1))
d2sum+=a[i][j];
}

cout<<"\n Your matrix is ";

for(i=0;i<m;i++)
{
cout<<" \n ";
for(j=0;j<m;++j)
cout<<a[i][j]<<"  ";
}


cout<<"\n\tSum of 1st digonal is : "<<d1sum;
cout<<"\n\tSum of 2nd digonal is : "<<d2sum;
getch();
}


                                                     Output

No comments:

Post a Comment