1001 of jiudu onlinejudge: A + B for Matrices

Description:

This time, you are supposed to find a + B where A and B are two matrices, and then count the number of zero rows and columns.

Input:

The input consists of several test cases, each starts with a pair of positive integers m and n (≤ 10) which are the number of rows and columns of the matrices, respectively. then 2 * m lines
Follow, each contains N integers in [-100,100], separated by a space. The first M lines correspond to the elements of a and the second M lines to that of B.

The input is terminated by a zero m and that case must not be processed.

Output:

For each test case you shoshould output in one line the total number of zero rows and columns of A + B.

Sample input:

2 21 11 1-1 -110 92 31 2 34 5 6-1 -2 -3-4 -5 -60

Sample output:

15

#include <iostream>#include<string.h>using namespace std;int main(){    int A[11][11];    int B[11][11];    int C[11][11];        int M,N;    int i,j;    while(cin>>M>>N,M!=0)    {     int k =0;    memset(A,0,sizeof(A));    memset(B,0,sizeof(B));          memset(C,0,sizeof(C));                for(i=0;i<M;i++)       for(j=0;j<N;j++)          cin>>A[i][j];               for(i=0;i<M;i++)       for(j=0;j<N;j++)          cin>>B[i][j];                for(i=0;i<M;i++)       for(j=0;j<N;j++)         C[i][j]=A[i][j]+B[i][j];               for(i=0;i<N;i++)  {     for(j=0;j<M;j++)     {         if(C[j][i] != 0)        break;                    }     if(j==M) k++;  }          for(j=0;j<M;j++)    {       for(i=0;i<N;i++)     {         if(C[j][i] != 0)        break;                    }     if(i==N) k++;  }                 cout<<k<<endl;                                        }                    // system("PAUSE");    return 0;}