九度oj 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

  

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68

#include<stdio.h>   typedef enum { false = 0, true = 1} bool ; int main() {      int a[15][15];      int m,n,temp,i,j;      bool flag;      while ( scanf ( "%d" ,&m),m)      {            scanf ( "%d" ,&n);          for (i=0;i<m;i++)              for (j=0;j<n;j++)                  scanf ( "%d" ,&a[i][j]);            for (i=0;i<m;i++)              for (j=0;j<n;j++)              {                  scanf ( "%d" ,&temp);                  a[i][j]+=temp;              }          temp=0;          for (i=0;i<m;i++)          {              flag= true ;              for (j=0;j<n;j++)                  if (a[i][j]!=0)                  {                   flag= false ;                   break ;                    }                                            if (flag== true )                  temp++;          }            for (j=0;j<n;j++)          {                        flag= true ;              for (i=0;i<m;i++)              {                  if (a[i][j]!=0)                  {                      flag= false ;                      break ;                  }                                    }               if (flag== true )                  temp++;            }          printf ( "%d\n" ,temp);        }      return 0; }   /**************************************************************      Problem: 1001      User: joesan      Language: C      Result: Accepted      Time:0 ms      Memory:912 kb ****************************************************************/