思路: 矩阵乘法超时了。 打了个表发现很快就可以收敛了,于是暴力迭代直到误差小于1e-6(这题从头到尾都是乱来)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
int dim;
struct matrix
{
double a[105][105];
void init() {
for(int i = 0; i <= dim; i ++)
for(int j = 0; j <= dim; j ++)
a[i][j] = 0;
}
matrix operator * (const matrix &p) {
matrix c;
c.init();
for(int i = 1; i <= dim; i ++)
for(int j = 1; j <= dim; j ++)
for(int k = 1; k <= dim; k ++)
c.a[i][j] += a[i][k] * p.a[k][j];