7-2 矩阵运算 (20分)

#include<stdio.h>
int main()
{
int a[10][10]={0},n,c,i1,i2,j,sum=0;
scanf("%d",&n);
for(i1=0;i1<n;i1++)
{
for(i2=0;i2<n;i2++)
{
scanf("%d",&a[i1][i2]);
sum=sum+a[i1][i2];
}
}
for(i1=0;i1<n;i1++)
{
for(i2=0;i2<n;i2++)
{
if(i1+i2n-1)
{
sum=sum-a[i1][i2];
}
if(i1n-1)
sum=sum-a[i1][i2];
if(i2==n-1)
sum=sum-a[i1][i2];
}
}
sum=sum+a[0][n-1]+a[n-1][0]+a[n-1][n-1];
printf("%d",sum);
return 0;
}