AcWing 752. 数组的右方区域
原题链接
中等
作者:
citrus_7
,
2021-02-01 13:24:11
,
所有人可见
,
阅读 283
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
char c;
cin >> c;
double m[12][12];
for (int i = 0; i < 12; i ++ )
for (int j = 0; j < 12; j ++ )
cin >> m[i][j];
double s = 0;
int t = 0;
for (int i = 1; i < 6; i ++ )
for (int j = 12 - i; j < 12; j ++ , t ++ )
s += m[i][j];
for (int i = 6; i < 11; i ++ )
for (int j = i + 1; j < 12; j ++ , t ++ )
s += m[i][j];
if (c == 'S') printf("%.1lf", s);
else printf("%.1lf", s / t);
return 0;
}