_jobdu_1001

 /************************************************************************/
 /* 题目描述：
 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.
 输入：
 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.
 输出：
 For each test case you should output in one line the total number of zero rows and columns of A+B.
 样例输入：
 2 2
 1 1
 1 1
 -1 -1
 10 9
 2 3
 1 2 3
 4 5 6
 -1 -2 -3
 -4 -5 -6
 0
 样例输出：
 1
 5                                                                     */
 /************************************************************************/
 #include <iostream>
 using namespace std;
 //#define MAXCOL 10
 //#define MAXINT 100
 //#define MININT -100

 int main()
 {
     short arr[][];
     short m, n;
     while((cin>>m),m)
     {
         cin>>n;
         short i,j,temp,count;
         for(i=;i<m;i++)
             for(j=;j<n;j++)
                 cin>>arr[i][j];
         for(i=;i<m;i++)
             for(j=;j<n;j++)
             {
                 cin>>temp;
                 arr[i][j]+=temp;
             }
         i = j = temp = count = ;
         for(i=; i<m; i++)
         {
             temp = ;
             for(j=; j<n; j++)
                 temp += arr[i][j];
             if(!temp)count++;
         }
         for(j=; j<n; j++)
         {
             temp = ;
             for(i=; i<m; i++)
                 temp += arr[i][j];
             if(!temp)count++;
         }
         cout<<count<<endl;
     }
 }