7-5 编程练习题答案
来源:互联网 发布:网络相亲可信吗 编辑:程序博客网 时间:2024/05/17 02:31
import java.util.Scanner;public class Test{public static void main(String[] args){Scanner input = new Scanner(System.in);double[][] matrix1 = new double[3][3];double[][] matrix2 = new double[3][3];System.out.print("Enter matrix1: ");for(int i = 0; i < matrix1.length; i++)for(int j = 0; j < matrix1[i].length; j++)matrix1[i][j] = input.nextDouble();System.out.print("Enter matrix2: ");for(int i = 0; i < matrix2.length; i++)for(int j = 0; j < matrix2[i].length; j++)matrix2[i][j] = input.nextDouble();double[][] answers = caculate(matrix1, matrix2);System.out.println("The matrices are added as follows; ");System.out.println(matrix1[0][0] + " " + matrix1[0][1] + " " + matrix1[0][2] + " " + matrix2[0][0] + " " + matrix2[0][1] + " " + matrix2[0][2] + " " + answers[0][0] + " " + answers[0][1] + " " + answers[0][2]);System.out.println(matrix1[1][0] + " " + matrix1[1][1] + " " + matrix1[1][2] + " + " + matrix2[1][0] + " " + matrix2[1][1] + " " + matrix2[1][2] + " = " + answers[1][0] + " " + answers[1][1] + " " + answers[1][2]);System.out.println(matrix1[2][0] + " " + matrix1[2][1] + " " + matrix1[2][2] + " " + matrix2[2][0] + " " + matrix2[2][1] + " " + matrix2[2][2] + " " + answers[2][0] + " " + answers[2][1] + " " + answers[2][2]);/*System.out.printf("%.1f %.1f %.1f %.1f %.1f %.1f %.1f %.1f %.1f\n", matrix1[0][0], matrix1[0][1], matrix1[0][2], matrix2[0][0], matrix2[0][1], matrix2[0][2], answers[0][0], answers[0][1], answers[0][2]);System.out.printf("%.1f %.1f %.1f + %.1f %.1f %.1f = %.1f %.1f %.1f\n", matrix1[1][0], matrix1[1][1], matrix1[1][2], matrix2[1][0], matrix2[1][1], matrix2[1][2], answers[1][0], answers[1][1], answers[1][2]);System.out.printf("%.1f %.1f %.1f %.1f %.1f %.1f %.1f %.1f %.1f\n", matrix1[2][0], matrix1[2][1], matrix1[2][2], matrix2[2][0], matrix2[2][1], matrix2[2][2], answers[2][0], answers[2][1], answers[2][2]);*/}public static double[][] caculate(double[][] matrix1, double[][] matrix2){double[][] answers = new double[matrix1.length][matrix1[0].length];for(int i = 0; i < answers.length; i++)for(int j = 0; j < answers[i].length; j++)answers[i][j] = matrix1[i][j] + matrix2[i][j];return answers;}}
0 0
- 7-5 编程练习题答案
- 7-7 编程练习题答案
- 6-7 编程练习题答案
- 7-1 编程练习题答案
- 7-2 编程练习题答案
- 7-3 编程练习题答案
- 7-4 编程练习题答案
- 7-6 编程练习题答案
- 7-8 编程练习题答案
- 6-5 编程练习题答案
- 6-4 编程练习题答案
- 6-3 编程练习题答案
- 6-2 编程练习题答案
- 6-1 编程练习题答案
- 6-6 编程练习题答案
- 6-8 编程练习题答案
- 6-9 编程练习题答案
- 6-10 编程练习题答案
- 7-3 编程练习题答案
- html5开发手机打电话发短信功能,html5的高级开发,html5开发大全,html手机电话短信功能详解
- 用tinyxml 库创建并读写xml代码截取
- 7-4 编程练习题答案
- 关于递归
- 7-5 编程练习题答案
- 7-6 编程练习题答案
- 7-7 编程练习题答案
- cocos2d之触屏事件处理机制(2.x和3.x的变化)
- 7-8 编程练习题答案
- 《软件调试的艺术》笔记--调试多线程程序
- Epoll与Select比较
- BZOJ1257 [CQOI2007]余数之和sum
- ubuntu下tft服务器和nfs服务器的搭建