九度OJ题目1001：A+B for Matrices

题目1001：A+B for Matrices

时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：15433

解决：6245

题目描述：

    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

来源：

2011年浙江大学计算机及软件工程研究生机试真题

答疑：

解题遇到问题?分享解题心得?讨论本题请访问： http://t.jobdu.com/thread-7724-1-1.html

#include <stdio.h>

int A[20][20];
int B[20][20];
int  main()
{
  int N,M;
  int i,j;
  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",&B[i][j]);
    for(i=0;i<M;++i)
      for(j=0;j<N;++j)
        A[i][j]+=B[i][j];
    int cnt=0;
    int tmp;
    for(i=0;i<M;++i)
    {
        tmp=0;
        for(j=0;j<N;++j)
            if(A[i][j])
            {
                tmp++;
                break;
            }
        if(tmp==0)
            cnt++;
    }
    for(i=0;i<N;++i)
    {
        tmp=0;
        for(j=0;j<M;++j)
            if(A[j][i])
            {
                tmp++;
                break;
            }
        if(tmp==0)
            cnt++;
    }

    printf("%d\n",cnt);
  }

  return 0;
}