| Run ID | 作者 | 问题 | 语言 | 测评结果 | 时间 | 内存 | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 85105 | sh25_wangtaojie | 宝藏图 | C++ | 通过 | 0 MS | 252 KB | 770 | 2026-03-06 15:01:07 |
#include <iostream> #include <iomanip> using namespace std; int main() { int m, n; cin >> m >> n; int treasure_count = 0; int trap_count = 0; int total_cells = m * n; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { int cell_value; cin >> cell_value; if (cell_value == 1) { treasure_count++; } else if (cell_value == -1) { trap_count++; } } } double treasure_rate = (double)treasure_count / total_cells; double trap_rate = (double)trap_count / total_cells; cout << fixed << setprecision(6) << treasure_rate << " " << trap_rate << endl; return 0; }