十九、编程序,实现对矩阵的周边元素求和。输出结果

sum=0
for (i=1;i<=3:i++)
for(j=1;j<=3;j++)
sum=a(1,j)+a(i,1)+a(3,j)+a(i,3)
print sum;
就是这句了》》》》sum=a(1,j)+a(i,1)+a(3,j)+a(i,3)

//适应任何矩阵
#include<stdio.h>
#define H 3 //行
#define L 3 //列
int qiubian (int a[][])
{
int i,p=0,a[H][L];
for (i=0,i<L;i++){
p+=a[0][i];
p+=a[H-1][i];
}
for (i=0,i<H;i++){
p+=a[i][0];
p+=a[i][L-1];
}
p=p-a[0][0]-a[0][L-1]-a[H-1][0]-a[H-1][L-1];
return p;
}
main ()
{
int a[H][L],i ,j;
for (i=0;i<H;i++)
for (j=0; j<L;j++)
scanf ("%d",&a[i][j];
printf ("%d\n",qiubian(a[H][L]));
}