解题思路:
矩阵相乘
注意事项:
M可能为0
参考代码:
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int N = scanner.nextInt(); int M = scanner.nextInt(); long[][] arr = new long[N][N]; for (int i = 0; i < N; i++) { for(int j = 0; j < N; j++) { arr[i][j] = scanner.nextInt(); } } scanner.close(); // arrM 为arr 的M次幂结果 long[][] arrM = arr; if(M != 0) { // 1次幂以上 for (int i = 1; i < M; i++) { arrM = mul(arrM, arr, N); } } else { long[][] arr0 = new long[N][N]; for (int i = 0; i < N; i++) { // 0次幂 arr0[i][i] = 1; } arrM = arr0; } // 打印输出 for (int i = 0; i < N; i++) { for(int j = 0; j < N; j++) { if (j != N-1) { System.out.print(arrM[i][j] + " "); } else { System.out.println(arrM[i][j]); } } } } // 两个矩阵相乘 public static long[][] mul(long[][] a, long[][] b , int N){ long[][] mulAB = new long[N][N]; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { for (int k = 0; k < N; k++) { mulAB[i][j] += a[i][k] * b[k][j]; } } } return mulAB; } }
0.0分
1 人评分