77913

Run ID	作者	问题	语言	测评结果	Time	Memory	代码长度	提交时间
77913	荀逸萱	偶数个1	C++	Wrong Answer	1 MS	300 KB	917	2024-06-15 17:17:40

Tests(0/10):

Code:

#include<iostream> #include<list> #include<stack> #include<cstring> #include<queue> #include<algorithm> using namespace std; int main(){ /*int m,n,a[10][10],b[10][10]; int x; cin>>m>>n; for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ cin>>a[i][j]; } } for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ b[i][(j+m)%n]=a[i][j]; } } for(int i=0;i<n;i++){ cout<<b[i][0]; for(int j=1;j<n;j++){ cout<<" "<<b[i][j]; }cout<<endl; }*/ int n,a[101][101],s=0,x=0; cin>>n; for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ cin>>a[i][j]; } } for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ if(a[i][j]==1){ s++; } if(a[j][i]==1){ x++; } if(s%2==0&&x%2==0){ cout<<"OK"; return 0; } } }cout<<"Corrupt"; return 0; }

Run Info:

------Input------

50
0 0 0 0 1 0 1 1 1 0 0 0 1 0 1 0 1 0 0 0 1 1 1 1 0 1 1 1 1 0 0 1 0 0 1 1 1 1 1 1 1 1 0 1 1 0 0 1 1 0 
1 1 0 1 0 1 1 0 0 0 1 0 0 0 0 0 1 1 1 1 1 0 0 1 0 0 0 1 0 0 1 0 1 0 1 0 0 0 1 0 0 1 0 0 0 1 1 1 1 1 
1 1 0 1 0 0 1 0 0 1 1 0 0 1 0 1 0 1 0 0 0 0 0 1 1 1 1 0 1 0 0 0 0 0 1 1 0 1 1 1 0 0 0 0 0 0 1 0 0 0 
0 0 0 0 1 1 0 1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 0 1 0 1 0 1 0 0 1 1 1 1 1 0 0 1 0 0 0 0 1 0 1 1 0 1 1 1 
0 0 0 0 0 1 1 1 0 0 0 0 1 0 0 1 1 1 0 1 1 1 0 1 1 1 1 1 0 0 1 1 0 0 1 0 0 0 0 1 0 1 1 1 0 1 0
------Answer-----

Corrupt

------Your output-----

OK