POJ 3233.Matrix Power Series

最新推荐文章于 2020-12-19 11:24:01 发布

Pegasi_Tio

最新推荐文章于 2020-12-19 11:24:01 发布

阅读量242

点赞数 1

分类专栏： POJ ACM

本文链接：https://blog.csdn.net/PegasiTIO/article/details/90083932

版权

ACM 同时被 2 个专栏收录

115 篇文章 0 订阅

订阅专栏

POJ

17 篇文章 0 订阅

订阅专栏

Description

Given a n × n matrix A and a positive integer k, find the sum S = A + A2 + A3 + … + Ak.

Input

The input contains exactly one test case. The first line of input contains three positive integers n (n ≤ 30), k (k ≤ 109) and m (m < 104). Then follow n lines each containing n nonnegative integers below 32,768, giving A’s elements in row-major order.

Output

Output the elements of S modulo m in the same way as A is given.

Sample Input

2 2 4
0 1
1 1

Sample Output

1 2
2 3

矩阵乘法

$[S_K,A_K]=[S_{K-1},A_{K-1}]*\left[\begin{array}{ccc}E&O\\A&A\end{array}\right]$

$S_K = f_1 * a^{k-1}=[S_{1},A_{1}]*\left[\begin{array}{ccc}E&O\\A&A\end{array}\right]^{k-1}$

其中E是单位矩阵，O是零矩阵

搞了半个小时，看哪也没错，最后终于发现把单位矩阵 $\left[\begin{array}{ccc}1&0\\0&1\end{array}\right]$ 写成了 $\left[\begin{array}{ccc}1&1\\1&1\end{array}\right]$ ,智障啊

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

const int maxn = 35;
int f[maxn][maxn * 2];
int a[maxn * 2][maxn * 2];
int n, k, mod;

void mul(int x, int y)
{
    int c[maxn][maxn * 2];
    memset(c, 0, sizeof(c));
    for (int i = 0; i < x; ++i)
        for (int j = 0; j < y; ++j)
            for (int k = 0; k < y; ++k)
                c[i][j] = (c[i][j] + (long long)f[i][k] * a[k][j]) % mod;
    memcpy(f, c, sizeof(c));
}

void mulself(int x, int y)
{
    int c[maxn * 2][maxn * 2];
    memset(c, 0, sizeof(c));
    for (int i = 0; i < x; ++i)
        for (int j = 0; j < y; ++j)
            for (int k = 0; k < y; ++k)
                c[i][j] = (c[i][j] + (long long)a[i][k] * a[k][j]) % mod;
    memcpy(a, c, sizeof(c));
}

int main()
{
    scanf("%d %d %d", &n, &k, &mod);
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
        {
            scanf("%d", &f[i][j]);
            a[i][i] = 1;
            a[i][j + n] = 0;
            f[i][j + n] = a[i + n][j] = a[i + n][j + n] = f[i][j];
        }
    for (k -= 1; k; k >>= 1)
    {
        if (k & 1)
            mul(n, n * 2);
        mulself(n * 2, n * 2);
    }
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            printf("%d%c", f[i][j], " \n"[j == n - 1]);
    return 0;
}