A Simple Math Problem (矩阵快速幂、构造矩阵)

最新推荐文章于 2019-05-14 15:56:22 发布

zzcblogs

最新推荐文章于 2019-05-14 15:56:22 发布

阅读量330

点赞数

分类专栏：矩阵运算文章标签：矩阵快速幂

本文链接：https://blog.csdn.net/zzcblogs/article/details/72599579

版权

矩阵运算专栏收录该内容

7 篇文章 0 订阅

订阅专栏

A Simple Math Problem

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 89 Accepted Submission(s): 74

Problem Description

Lele now is thinking about a simple function f(x).

If x < 10 f(x) = x.
If x >= 10 f(x) = a0 * f(x-1) + a1 * f(x-2) + a2 * f(x-3) + …… + a9 * f(x-10);
And ai(0<=i<=9) can only be 0 or 1 .

Now, I will give a0 ~ a9 and two positive integers k and m ,and could you help Lele to caculate f(k)%m.

Input

The problem contains mutiple test cases.Please process to the end of file.
In each case, there will be two lines.
In the first line , there are two positive integers k and m. ( k<2*10^9 , m < 10^5 )
In the second line , there are ten integers represent a0 ~ a9.

Output

For each case, output f(k) % m in one line.

Sample Input

10 9999
1 1 1 1 1 1 1 1 1 1
20 500
1 0 1 0 1 0 1 0 1 0

Sample Output

45
104

突然盗图（侵删

#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <string.h>
#include <typeinfo>
using namespace std;
int mod;
int n;
struct Matrix {
    int a[12][12];
};

Matrix operator * (const Matrix& a, const Matrix& b) {
    Matrix c;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            c.a[i][j] = 0;
            for (int k = 0; k < n; ++k) {
                c.a[i][j] += a.a[i][k] * b.a[k][j];
            }
            c.a[i][j] %= mod;
        }
    }
    return c;
}

Matrix operator ^ (Matrix& a, int k) {
    Matrix c;
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j) {
            if (i == j)
                c.a[i][j] = 1;
            else
                c.a[i][j] = 0;
        }
    while (k) {
        if (k&1)
            c = a * c;
        k >>= 1;
        a = a * a;
    }
    return c;
}

int main() {
    int k;
    n = 10;
    while (cin >> k >> mod) {
        if (k <= 9) {
            cout << k % mod << endl;
            continue;
        }
        Matrix m;
        memset(m.a, 0, sizeof(m.a));
        for (int i = 0; i < n; ++i)
            cin >> m.a[0][i];
        for (int i = 1; i < n; ++i)
            m.a[i][i-1] = 1;
        m = m ^ (k - 9);
        int ans = 0;
        for (int i = 0; i < n; ++i) {
            ans += (m.a[0][i] * (9-i)) % mod;
        }
        cout << ans % mod << endl;
    }
}