AcWing 751. 数组的左方区域
原题链接
中等
作者:
havefunHJN
,
2021-06-11 23:57:38
,
所有人可见
,
阅读 171
C++ 代码
#include<cstdio>
const int n = 12;
int main(){
int counter = 0;
char f;
double sum = 0, m[n][n];
scanf("%c", &f);
for(int i = 0; i < n; i++){
for (int j = 0; j < n; j++) scanf("%lf", &m[i][j]);
}
for(int i = 0; i < n; i++){
if (i <= 5){
for (int j = 0; j <= i-1; j++) sum += m[i][j], counter++;
}
else if (i >= 6){
for (int j = 0; j <= n-2-i; j++) sum += m[i][j], counter++;
}
}
if(f == 'S') printf("%.1lf", sum);
else if (f == 'M') printf("%.1lf", sum / counter);
return 0;
}