和y总上课讲的找规律有点不同，把这个图旋转一下来看，那两层for循环颠倒顺序，先枚举列，再枚举行

#include <iostream>
#include <cstdio>

using namespace std;

double M[12][12];
char op[2];

int main()
{
    cin >> op;
    for (int i = 0; i < 12; i++)
        for (int j= 0; j < 12; j++)
            cin >> M[i][j];

    double sum = 0.0;
    int cnt = 0;
    for (int j = 6 + 1; j < 12; j++)
        for (int i = 12 - j; i < j; i++)
            sum += M[i][j], cnt++;

    if (op[0] == 'S') printf("%.1lf\n", sum);
    else printf("%.1lf\n", sum / cnt);

    return 0;
}