Run ID Author Problem Lang Verdict Time Memory Code Length Submit Time
63728 王一涵(吃土豆长大的马铃薯) 宝藏图 C++ Accepted 0 MS 256 KB 431 2025-04-03 17:03:01

Tests(1/1):


#include<iostream> using namespace std; int main(){ int n,m; cin>>n>>m; int map[n][m]; int treature=0,trap=0; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ cin>>map[i][j]; if(map[i][j]==1){ treature++; }else if(map[i][j]==-1){ trap++; } } } double treatureRate=(double)treature/(n*m); double trapRate=(double)trap/(n*m); cout<<treatureRate<<" "<<trapRate<<endl; return 0; }


Judgement Protocol: