九度oj1001

来源：互联网发布：伏尼契手稿知乎编辑：程序博客网时间：2024/06/03 12:29

//PS:用单2*M x N 矩阵输入的话得到了runtime error,而采用2个MxN矩阵就AC了，看来CIN的时候要尽量避免时间复杂度的n过大,能把n切断一段一段cin的话会好一点

//#include<iostream>#include<cstring>using std::cin;using std::cout;using std::endl;int a[15][15],b[15][15],c[15][15];int A[15]; int main(){    int M,N,i,j,cc,crc,n;     while(cin >> M, M)    {        crc=0;        cin >> N;        n = N;        for(i = 0; i <= M-1; i++)          {            for(j = 0; j<= N-1; j++)                cin >> a[i][j];          }      for(i = 0; i <= M-1; i++)          {            for(j = 0; j<= N-1; j++)                cin >> b[i][j];          }         for(i = 0; i <= M-1; i++)          {            for(j = 0; j<= N-1; j++)                c[i][j] = a[i][j]+b[i][j];          }         for(i = 0; i <= M-1; i++)            {                cc = 0;                for(j = 0; j <= N-1; j++)                    {                        if(c[i][j]==0)                        cc++;                        else                        if(A[j]==0)                            n--,A[j]=1;                    }                 if(cc == N)                crc++;            }        memset(A,0,sizeof(A));        cout << (crc+n) << endl;    }    return 0;} /**************************************************************    Problem: 1001    User: true14fans    Language: C++    Result: Accepted    Time:0 ms    Memory:1520 kb****************************************************************/