九度OJ之1001题 A+B for Matric

最近想练一下自己的上机能力，特来记录一下。。。。。。

题目描述：

    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<stdio.h>
#include<stdlib.h>
 
int main()
{
      int a[20][20];
      int row, line;
      int i, j;
      int count = 0;
      int temp;
      while(scanf("%d",&row), row)
      {
             scanf("%d",&line);
 
             for (i = 0; i < row; ++i)
                  for (j = 0; j < line; ++j)
                         scanf("%d",&(a[i][j]));
 
              for (i = 0; i < row; ++i)
                   for (j = 0; j < line; ++j)
                    {
                          scanf("%d", &temp);
                          a[i][j] += temp;
                          if (a[i][j] != 0)
                               a[i][j] = 1;
                    }
 
               for (i = 0; i < row; ++i)
               {
                    temp = 0;
                    for (j = 0; j < line; ++j)
                          temp += a[i][j];
                     if (temp == 0)
                         ++count;
                }
 
                for (j = 0; j < line; ++j)
               {
                    temp = 0;
                    for (i = 0;i < row; ++i)
                          temp += a[i][j];
                     if (temp == 0)
                         ++count;
                }
                 printf("%d\n",count);   
                 count = 0;
       }
}
/**************************************************************
    Problem: 1001
    User: tenyee
    Language: C
    Result: Accepted
    Time:0 ms
    Memory:912 kb
****************************************************************/