题目1001：A+B for Matrices

题目描述：

    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

---

下面是最简单的解法，不过程序本身复杂度不高，所以可以通过：

import java.util.Scanner;
 
public class Main{
    public static void main(String[] args){
        Scanner in=new Scanner(System.in);
        int M,N;
        M=in.nextInt();
        while(M!=0){
            N=in.nextInt();
            in.nextLine();
            int[][]a=new int[M][N];
            int[][]b=new int[M][N];
            for(int i=0;i<M;i++){
                for(int j=0;j<N;j++){
                    a[i][j]=in.nextInt();
                }
                in.nextLine();
            }
            for(int i=0;i<M;i++){
                for(int j=0;j<N;j++){
                    b[i][j]=in.nextInt()+a[i][j];
                }
                in.nextLine();
            }
            int cout=0;
            for(int i=0;i<M;i++){
                boolean bo=true;
                for(int j=0;j<N;j++){
                    if(b[i][j]!=0)
                        bo=false;
                }
                if(bo)
                    cout++;
            }
            for(int i=0;i<N;i++){
                boolean bo=true;
                for(int j=0;j<M;j++){
                    if(b[j][i]!=0)
                        bo=false;
                }
                if(bo)
                    cout++;
            }
            System.out.println(cout);
            M=in.nextInt();
        }
    }
}
/**************************************************************
    Problem: 1001
    User: 0000H
    Language: Java
    Result: Accepted
    Time:930 ms
    Memory:18872 kb
****************************************************************/