mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-11-30 15:56:27 +00:00
750. 数组的下方区域
https://www.acwing.com/problem/content/submission/code_detail/6863091/
This commit is contained in:
parent
a7cc8496ae
commit
75f30d7c61
17
AcWing/750/750.cpp
Normal file
17
AcWing/750/750.cpp
Normal file
@ -0,0 +1,17 @@
|
|||||||
|
#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;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
cout << fixed << setprecision(1) << sum / (op == 'S' ? 1 : 30) << endl;
|
||||||
|
return 0;
|
||||||
|
}
|
Loading…
Reference in New Issue
Block a user