2 solutions
-
0
#include<bits/stdc++.h> using namespace std; const int N=110; int a[N][N]; int main() { int n; cin>>n; int m=n; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { cin>>a[i][j]; } } int rcnt=0,r=0; for(int i=1;i<=n;i++) { int cnt=0; for(int j=1;j<=m;j++) { if(a[i][j]==1) { cnt++; } } if(cnt%2!=0) { rcnt++; r=i; } } int ccnt=0,c=0; for(int j=1;j<=m;j++) { int cnt=0; for(int i=1;i<=n;i++) { if(a[i][j]==1) { cnt++; } } if(cnt%2!=0) { ccnt++; c=j; } } if(rcnt==0&&ccnt==0) { cout<<"OK"; } else if(rcnt==1&&ccnt==1) { cout<<r<<" "<<c<<endl; } else { cout<<"Corrupt"; } return 0; }
Information
- ID
- 528
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 3
- Tags
- (None)
- # Submissions
- 25
- Accepted
- 6
- Uploaded By