importjava.util.Scanner;public classGaussianElimination{public static void Input(int n, double[][] A, double[] b, intlength){
Scanner in= newScanner(System.in);
System.out.println("输入方程组的系数矩阵A;");for (int i = 0; i < n; i++) {for (int j = 0; j < n; j++) {
A[i][j]=in.nextDouble();
}
}if(length == 1){
System.out.println("输入方程组矩阵b:");for (int i = 0; i < n; i++) {
b[i]=in.nextDouble();
}
}
}public static void Merge1(int n, double[][] A, double[] b){for (int i = 0; i < n; i++) {
A[i][n]=b[i];
}
Print(n, A,1);return;
}public static void Merge2(int n, double[][] A){for (int i = 0; i < n; i++) {for (int j = n; j < 2*n; j++) {
A[i][j]= 0;