POJ 2260 Error Correction 類比題

#include <iostream><br />using namespace std;<br />int main(){<br />int n,rc[101][101];<br />int i,j,tempsr[101],tempsc[101],x[101],y[101];<br />while(cin>>n,n!=0){<br />for (i = 0;i < n;i++)<br />for (j = 0;j < n;j++)<br />cin>>rc[i][j];<br />//若行的奇數和的個數不等於列的奇數和的個數則Corrupt<br />//若均為0 則OK<br />//若相等 則可作變換,可以一一配對得到交點就是變換點<br />memset(tempsc,0,sizeof(tempsc));<br />memset(tempsr,0,sizeof(tempsr));<br />for (i = 0;i < n;i++)<br />for (j = 0;j < n;j++){<br />tempsr[i]+=rc[i][j];<br />tempsc[i]+=rc[j][i];<br />}<br />int a = 0,b = 0;<br />for (i = 0;i < n;i++)<br />{<br />if (tempsr[i] % 2 == 1)<br />x[a++] = i+1;<br />if (tempsc[i] % 2 == 1 )<br />y[b++] = i+1;<br />}<br />if (a != b)cout<<"Corrupt"<<endl;<br />if (!a && !b)<br />cout<<"OK"<<endl;<br />if (a == b)<br />for (i = 0;i < a;i++)<br />{<br />cout<<"Change bit ("<<x[i]<<","<<y[i]<<")"<<endl;<br />}<br />}<br />return 0;<br />}