import java.util.Scanner;
public class Main {
//求N阶矩阵的M次幂
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
int[][] a = new int[N][N]; //a为原始矩阵,后边增加1次幂就用来覆盖一次
int[][] b = new int[N][N]; //这里b数组一直不变,用来和n-1次幂相乘
for(int i=0; i<N
蓝桥杯-N阶矩阵的M次幂。(JAVA)
最新推荐文章于 2022-11-17 19:50:26 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)