| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 87215 | fanziyan | 宝藏图 | C++ | Accepted | 0 MS | 248 KB | 366 | 2026-04-12 14:27:34 |
#include <bits/stdc++.h> using namespace std; int main(){ int m,n,bz=0,xj=0; cin>>m>>n; int map[m][n]; for(int i=0;i<m;i++){ for(int j=0;j<n;j++){ cin>>map[i][j]; if(map[i][j]==1){ bz++; }else if(map[i][j]==-1){ xj++; } } } double bzl=bz*1.0/(m*n); double xjl=xj*1.0/(m*n); cout<<bzl<<" "<<xjl; return 0; }