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.ArrayList;
import java.util.List;
import java.util.Scanner;
 
public class Main{
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
         
        int rows = 0, columns = 0;
        int result = 0;
        int count = 0;
         
        while( scanner.hasNext() ){
             
            rows = scanner.nextInt();
             
            if(rows <= 0) break;
             
            columns = scanner.nextInt();
             
             
             
            List<Integer> matriceA = new ArrayList<Integer>();
            List<Integer> matriceB = new ArrayList<Integer>();
            List<Integer> matriceC = new ArrayList<Integer>();
             
             
            for (int i = 0; i < rows; i++) {
                for (int j=0; j < columns; j++) {
                    matriceA.add(scanner.nextInt());
                }
            }
             
            for (int i = 0; i < rows; i++) {
                for (int j=0; j < columns; j++) {
                    matriceB.add(scanner.nextInt());
                }
            }
             
            for (int i = 0; i < rows*columns; i++) {
                matriceC.add( matriceA.get(i) + matriceB.get(i));
            }
             
             
            for (int i = 0; i < columns; i++) {
                result = matriceC.get(i);
                for (int j = 1; j < rows; j++) {
                    result = result + matriceC.get(i + j*columns);
                }
                if(result == 0){
                    count++;
                }
            }
             
             
            for (int i = 0; i < rows*columns; i=i+columns) {
                result = matriceC.get(i);
                for (int j = 1; j < columns; j++) {
                    result = result + matriceC.get(i + j);
                }
                if(result == 0){
                    count++;
                }
            }
             
            System.out.println(count);
            count = 0;
             
        }
        scanner.close();
    }
 
}
 
/**************************************************************
    Problem: 1001
    User: yihukurama
    Language: Java
    Result: Accepted
    Time:900 ms
    Memory:18848 kb
****************************************************************/