UVA 11149(B)——Power of Matrix （矩阵快速幂，倍增法）

题目链接：点击打开链接

题目大意;输入n, k求出来n行n列的矩阵的1次幂 + 2次幂 + ... + k次幂的和

解题思路：为了控制时间，首先想到的是用快速幂，但是还有n项，所以求和所需要很多时间，可以用倍增来解决这个问题

代码：

//UVA 11149矩阵快速幂，倍增
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

class Matrix
{
public:
    long long num[50][50];
    int n;
};

Matrix mul(Matrix a, Matrix b)
{
    Matrix xx;
    memset(xx.num, 0, sizeof(xx.num));
    xx.n = a.n;
    for(int i = 0; i < a.n; i++)
    {
        for(int j = 0; j < a.n; j++)
        {
            for(int k = 0; k < a.n; k++)
                xx.num[i][j] += (a.num[i][k] * b.num[k][j])%10;
        }
    }
    return xx;
}

Matrix Plus(Matrix a, Matrix b)
{
    Matrix x;
    x.n = a.n;
    memset(x.num, 0, sizeof(x.num));
    for(int i = 0; i < x.n; i++)
    {
        for(int j = 0; j < x.n; j++)
            x.num[i][j] = (a.num[i][j] + b.num[i][j])%10;
    }
    return x;
}

Matrix Pow(Matrix m,int k) //n行n列的矩阵的k次幂
{
    Matrix ans, base;
    memset(ans.num, 0, sizeof(ans.num));
    memset(base.num, 0, sizeof(base.num));
    ans.n = m.n; base.n = m.n;
    for(int i = 0; i < ans.n; i++)
    {
        for(int j = 0; j < ans.n; j++)
        {
            base.num[i][j] = m.num[i][j] % 10;
            if(i == j)
               ans.num[i][j] = 1;  //要初始化为单位矩阵啊！！！
            else
                ans.num[i][j] = 0;
        }
    }

    while(k != 0)
    {
        if(k & 1)
            ans = mul(ans, base);

        k >>= 1;
        base = mul(base, base);
    }
    return ans;
}


Matrix slove(Matrix m, int k)
{
    if(k == 1) return m;
    Matrix mm, sum;
    memset(mm.num, 0, sizeof(mm.num));
    memset(sum.num, 0, sizeof(sum.num));
    mm.n = m.n; sum.n = m.n;
    mm = slove(m, k / 2);
    sum = Plus(mm, mul(mm, Pow(m, k/2)));
    if(k&1) sum = Plus(sum, Pow(m, k));
    return sum;
}


int main()
{
    int n, k;
    while(scanf("%d", &n)&& n != 0)
    {
        scanf("%d", &k);
        Matrix x, xx;
        for(int i = 0; i < n; i++)
        {
            for(int j = 0; j < n; j++)
            {
                int xxx;
                cin >> xxx;
                x.num[i][j] = xxx % 10; //太大的话会溢出，所以取模
                xx.num[i][j] = 0;
            }
        }
        x.n = n;
        xx.n = n;
        xx = slove(x, k);
        for(int i = 0; i < n; i++)
        {
            for(int j = 0; j < n; j++)
            {
                if(j) cout << " ";
                cout << xx.num[i][j] ;
            }
            cout << endl;
        }
        cout << endl;
    }
    return 0;
}

快速幂：

//快速幂
#include<iostream>
#include<cstdio>
using namespace std;
int Pow(int x, int k) //求算x的k次幂
{
    int ans = 1, base = x;
    while(k != 0)
    {
        if(k&1) //如果该位不为0
           ans *= base; //那么就算进去

        base *= base; //base的累乘
        k >>= 1; //指数左移一位
    }
    return ans;
}

int main()
{
    int n, k;
    while(cin >> n >> k)
        cout << Pow(n, k) << endl;
    return 0;
}

倍增法：

//倍增法
//Matrix 为矩阵类里面含有矩阵数组

Matrix slove(Matrix a, int n) //求n次幂的和
{
    if(n == 1) //递归结束条件，也就是加到最后一项了 
        return a;
    Matrix temp = slove(a, n/2); //开始递归，相当一二分那样，一半一半的来
    Matrix sum = Plus(temp, mul(temp, Pow(a, n/2)));
    //如果不为偶数，最后还得加上一项
    if(n % 2 != 0) 
        sum = Plus(sum, Pow(a, n));
    return sum;
}