0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-23 20:28:48 +00:00

751. 数组的左方区域

https://www.acwing.com/problem/content/submission/code_detail/6943206/
This commit is contained in:
Baoshuo Ren 2021-08-06 18:50:53 +08:00
parent d8a111de8e
commit 70ab02ef3c
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

23
AcWing/751/751.cpp Normal file
View File

@ -0,0 +1,23 @@
#include <bits/stdc++.h>
using namespace std;
int main() {
char op;
cin >> op;
double x, sum = 0;
for (int i = 0; i < 12; i++) {
for (int j = 0; j < 12; j++) {
cin >> x;
if (i > j && i + j < 11) sum += x;
}
}
if (op == 'S')
printf("%.1lf", sum);
else
printf("%.1lf", sum / 30);
return 0;
}