第一题1.doc

第一题： import java.util.Scanner; public class Reverse { /**输入10个数，将其倒序输出 * */ public static void main(String[] args) { // TODO Auto-generated method stub int i; final int SIZE=10; double numbers[]=new double[SIZE]; Scanner scan=new Scanner (System.in); System.out.println (请输入10个数); for (i=0;iSIZE;i++) { System.out.print(Enter the number + (i+1) + ); numbers[i]= scan.nextDouble(); } System.out.println(输入的数为); for(i=0;iSIZE;i++) System.out.println (numbers[i] + ); System.out.println (倒序的结果为); for(i = SIZE-1;i = 0;i--) { System.out.println (numbers[i] + );} } } 第二题： import java.util.Scanner; class Matrix { public static int[][] addmatrix(int[][] a,int[][] b) { int[][] result=new int[a.length][a[0].length]; for(int i=0;ia.length;i++) for(int j=0;ja[0].length;j++) result[i][j]=a[i][j]+b[i][j]; return result; } public static int[][] multiplymatrix(int[][] a,int[][] b) { int[][] result=new int[a.length][b[0].length]; for(int i=0;ia.length;i++) for(int j=0;jb[0].length;j++) { int m=0; for(int k=0;ka[0].length;k++) { m+=a[i][k]*b[k][j]; result[i][j]=m; } } return result; } public static void main(String[] args) { int[][] a=new int[2][2]; int[][] b=new int[2][2]; int[][] c=new int[2][2]; int[][] d=new int[2][2]; Scanner scan=new Scanner(System.in); System.out.println(please input eight numbers); for(int i=0;ia.length ;i++) { for(int j=0;ja[0].length ;j++) { a[i][j]=scan.nextInt(); System.out.print(a[i][j]+ ); } System.out.println( ); } System.out.println(Matrix b:); for(int i=0;ia.length ;i++) { for(int j=0;ja[0].length ;j++) { b[i][j]=scan.nextInt(); System.out.print(b[i][j]+ );