-
题目描述:
-
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 n, m; while ((n = in.nextInt()) != 0) { m = in.nextInt(); int[][] a = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { a[i][j] = in.nextInt(); } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { a[i][j] += in.nextInt(); } } int result = 0; for (int i = 0; i < n; i++) { result++; for (int j = 0; j < m; j++) { if (a[i][j] != 0) { result--; break; } } } for (int j = 0; j < m; j++) { result++; for (int i = 0; i < n; i++) { if (a[i][j] != 0) { result--; break; } } } System.out.println(result); } } } /************************************************************** Problem: 1001 User: 兰陵笑笑生 Language: Java Result: Accepted Time:890 ms Memory:18804 kb ****************************************************************/