| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 21254 | 欧阳漌 | 配方 | C++ | Accepted | 100 | 0 MS | 260 KB | 411 | 2021-06-26 20:11:31 |
#include<bits/stdc++.h> using namespace std; int a[1005][20],b[20]; int i,j,n,k,flag=1,ans=1; int main(){ cin>>n>>k; for(i=1;i<=n&&flag;i++) { for(j=1;j<=k&&flag;j++){ cin>>a[i][j]; if(a[i][j]==0) continue; if(b[j]==0) b[j]=a[i][j]; else if(b[j]!=a[i][j]) flag=0; } } for(i=1;i<=k;i++){ if(b[i]==0) ans*=2; } if(flag) cout<<ans; else cout<<"-1"; return 0; }