牛客网 KY191 矩阵幂

#include <iostream>
using namespace std;

struct Matrix {
	int matrix[10][10];
	int row, col;
	Matrix(int r, int c):row(r),col(c){}
};

Matrix Multiply(Matrix x, Matrix y) {
	Matrix answer(x.row, y.col);

	for (int i = 0; i < answer.row; ++i) {
		for (int j = 0; j < answer.col; ++j) {
			answer.matrix[i][j] = 0;
			for (int k = 0; k < x.col; ++k) {
				answer.matrix[i][j] += x.matrix[i][k] * y.matrix[k][j];
			}
		}
	}
	return answer;
}

void PrintMatrix(Matrix x) {
	for (int i = 0; i < x.row; ++i) {
		for (int j = 0; j < x.col; ++j) {
			if (j != 0) {
				printf(" ");
			}
			cout << x.matrix[i][j];
		}
		cout << endl;
	}
}

Matrix FastExponentiation(Matrix x, int k) {
	Matrix answer(x.row, x.col);
	for (int i = 0; i < answer.row; ++i) {
		for (int j = 0; j < answer.col; ++j) {
			if (i == j)
				answer.matrix[i][j] = 1;
			else
				answer.matrix[i][j] = 0;
		}
	}

	while (k) {
		if (k % 2 == 1)
			answer = Multiply(answer, x);
		k /= 2;
		x = Multiply(x, x);
	}

	return answer;

}


int main() {
	int n,k;
	while (cin >> n >> k) {

			Matrix x(n, n);
			for (int i = 0; i < x.row; ++i) {
				for (int j = 0; j < x.col; ++j) {
					cin >> x.matrix[i][j];
				}
			}

			Matrix answer = FastExponentiation(x, k);
			PrintMatrix(answer);
		}

}

参考：《王道机试指南》