POJ 2260 Error Correction(類比)

//簡單題，純粹類比就能通過<br />#include<iostream><br />using namespace std;<br />bool check(int n,bool arr[100][100])<br />{<br />int sum;<br />for(int i = 0;i < n;++i)<br />{<br />sum = 0;<br />for(int j = 0;j < n;++j)<br />{<br />sum += arr[i][j];<br />}<br />if(sum % 2 != 0)<br />return false;<br />}<br />for(int i = 0;i < n;++i)<br />{<br />sum = 0;<br />for(int j = 0;j < n;++j)<br />{<br />sum += arr[j][i];<br />}<br />if(sum % 2 != 0)<br />return false;<br />}<br />return true;<br />}<br />int main()<br />{<br />bool matrix[100][100],end;<br />int n;<br />while(cin >> n)<br />{<br />if(n == 0)break;<br />for(int i = 0;i < n;++i)<br />for(int j = 0;j < n;++j)<br />cin >> matrix[i][j];<br />if(check(n,matrix))<br />cout << "OK/n";<br />else<br />{<br />end = false;<br />for(int i = 0;i < n;++i)<br />for(int j = 0;j < n;++j)<br />{<br />if(!matrix[i][j])<br />matrix[i][j] = 1;<br />elsematrix[i][j] = 0;<br />if(check(n,matrix) && !end)<br />{<br />cout << "Change bit (" << i+1 << ","<< j+1 <<")/n";<br />end = true;<br />break;<br />}<br />//記得改回來<br />if(!matrix[i][j])<br />matrix[i][j] = 1;<br />elsematrix[i][j] = 0;<br />}<br />if(!end)cout << "Corrupt/n";<br />}<br />}<br />return 0;<br />}<br />