九度oj-1001-Java

简介:

题目描述:

    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 -60

样例输出:

1

5

简单翻译一下

先输入矩阵行和列的数,再列出2个矩阵的数字,然后矩阵相加,算出行数都是零和列数都是零的总和。

Java

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
 
public class Main {
 
    public static void main(String[] args) {
        List<Integer> mList = new ArrayList<Integer>();
        Scanner cin = new Scanner(System.in);
        int rows;
        while ((rows = cin.nextInt()) != 0) {
            int columns;
            int totalTmp = 0;
            int total = 0;
            columns = cin.nextInt();
            int[][] arrays1 = new int[rows][columns];
            int[][] arrays2 = new int[rows][columns];
            for (int i = 0; i < rows; i++) {
                for (int j = 0; j < columns; j++) {
                    arrays1[i][j] = cin.nextInt();
                }
            }
            for (int i = 0; i < rows; i++) {
                for (int j = 0; j < columns; j++) {
                    arrays2[i][j] = cin.nextInt();
                    totalTmp = totalTmp | (arrays1[i][j] + arrays2[i][j]);
                }
                if (totalTmp == 0) {
                    total++;
                }
                totalTmp = 0;
            }
 
            for (int colum = 0; colum < columns; colum++) {
                for (int row = 0; row < rows; row++) {
                    totalTmp = totalTmp
                            | (arrays1[row][colum] + arrays2[row][colum]);
                }
                if (totalTmp == 0) {
                    total++;
                }
                totalTmp = 0;
            }
            mList.add(total);
        }
        for (int num : mList) {
            System.out.println(num + "");
        }
 
    }
}

我是天王盖地虎的分割线




本文转自我爱物联网博客园博客,原文链接:http://www.cnblogs.com/yydcdut/p/4803552.html,如需转载请自行联系原作者

相关文章
|
8月前
|
Java
Java练习题
Java练习题
40 0
|
4天前
|
Java
LeetCode题解-字符串转数字-Java
字符串转数字题解,Java版
21 0
|
4天前
|
算法 Java C++
整数拆分(c++,java)
整数拆分(c++,java)
19 0
|
5月前
|
Java
Java学习 10.Java-数组习题
Java学习 10.Java-数组习题
76 0
|
11月前
|
Java
Java解决鸡兔同笼问题
Java解决鸡兔同笼问题
231 0
|
11月前
|
机器学习/深度学习 Java
分解质因数(java)
分解质因数(java)
|
11月前
|
算法
java202303java学习笔记第二十五天-两道算法题1
java202303java学习笔记第二十五天-两道算法题1
58 0
|
12月前
java202303java学习笔记第三十四天获取并遍历
java202303java学习笔记第三十四天获取并遍历
38 0
java202302java学习笔记第十天-什么是方法2
java202302java学习笔记第十天-什么是方法2
38 0
java202302java学习笔记第十天-什么是方法2
java202302java学习笔记第五天-九九乘法表
java202302java学习笔记第五天-九九乘法表
36 0
java202302java学习笔记第五天-九九乘法表