| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 20925 | 季洁 | 配方 | C++ | Accepted | 100 | 0 MS | 248 KB | 407 | 2021-06-21 17:03:02 |
#include<bits/stdc++.h> using namespace std; int main(){ int n,k,ans=1; cin>>n>>k; int a[n+1][k+1],f; for(int i=1;i<=n;i++){ for(int j=1;j<=k;j++){ cin>>a[i][j]; } } for(int j=1;j<=k;j++){ f=-1; for(int i=1;i<=n;i++){ if(f==-1&&a[i][j]) f=a[i][j]; if(f&&a[i][j]&&a[i][j]!=f){ cout<<-1; return 0; } } if(f==-1) ans*=2; } cout<<ans; return 0; }