_jobdu_1001

 1 /************************************************************************/
 2 /* 题目描述：
 3 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.
 4 输入：
 5 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.
 6 The input is terminated by a zero M and that case must NOT be processed.
 7 输出：
 8 For each test case you should output in one line the total number of zero rows and columns of A+B.
 9 样例输入：
10 2 2
11 1 1
12 1 1
13 -1 -1
14 10 9
15 2 3
16 1 2 3
17 4 5 6
18 -1 -2 -3
19 -4 -5 -6
20 0
21 样例输出：
22 1
23 5                                                                     */
24 /************************************************************************/
25 #include <iostream>
26 using namespace std;
27 //#define MAXCOL 10
28 //#define MAXINT 100
29 //#define MININT -100
30 
31 int main()
32 {
33     short arr[11][11];
34     short m, n;
35     while((cin>>m),m)
36     {
37         cin>>n;
38         short i,j,temp,count;
39         for(i=0;i<m;i++)
40             for(j=0;j<n;j++)
41                 cin>>arr[i][j];
42         for(i=0;i<m;i++)
43             for(j=0;j<n;j++)
44             {
45                 cin>>temp;
46                 arr[i][j]+=temp;
47             }
48         i = j = temp = count = 0;
49         for(i=0; i<m; i++)
50         {
51             temp = 0;
52             for(j=0; j<n; j++)
53                 temp += arr[i][j];
54             if(!temp)count++;
55         }
56         for(j=0; j<n; j++)
57         {
58             temp = 0;
59             for(i=0; i<m; i++)
60                 temp += arr[i][j];
61             if(!temp)count++;
62         }
63         cout<<count<<endl;
64     }
65 }