确定周边元素:
如果是行下标是0或者是n-1
如果是列下标是0或者是n-1
这时肯定是周边元素。
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#define N 5
double fun(int w[][N])
{
int i, j, count = 0;
double sum = 0.0;
for (i = 0; i < N; i++)
{
for (j = 0; j < N; j++)
{
if (i == 0 || i == N - 1 || j == 0 || j == N - 1)
{
sum += w[i][j];
count++;
}
}
}
return sum / count;
}
void main()
{
int a[N][N] = { 0,1,2,7,9,1,9,7,4,5,2,3,8,3,1,4,5,6,8,2,5,9,1,4,1 };
int i, j;
double s;
printf("\n");
for (i = 0; i < N; i++)
{
for (j = 0; j < N; j++)
{
printf("%4d", a[i][j]);
}
printf("\n");
}
s = fun(a);
printf("%lf\n", s);
}