计算护盾防御力值低于平均值的数量的C++实现

```cpp #include <iostream> using namespace std; const int MAXN = 100; int a[MAXN][MAXN]; int main() { int n; cin >> n; int total = 0; // 输入护盾防御力值并计算总和 for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { cin >> a[i][j]; total += a[i][j]; } } double average = (double)total / (n * n); int count = 0; // 统计防御力值低于平均值的护盾数量 for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { if (a[i][j] < average) { count++; } } } cout << count << endl; return 0; } ``` ######[AI问答 | 261点数解答 | 2026-05-23 19:23:29]