HDU 5015解题报告

最新推荐文章于 2021-08-05 13:56:54 发布

jhljx

最新推荐文章于 2021-08-05 13:56:54 发布

阅读量395

点赞数

分类专栏：矩阵文章标签： acm algorithm 矩阵快速幂 hdu 矩阵

本文链接：https://blog.csdn.net/u012294939/article/details/43928391

版权

矩阵专栏收录该内容

21 篇文章 0 订阅

订阅专栏

233 Matrix

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1169 Accepted Submission(s): 687

Problem Description

In our daily life we often use 233 to express our feelings. Actually, we may say 2333, 23333, or 233333 ... in the same meaning. And here is the question: Suppose we have a matrix called 233 matrix. In the first line, it would be 233, 2333, 23333... (it means a _0,1 = 233,a _0,2 = 2333,a _0,3 = 23333...) Besides, in 233 matrix, we got a _i,j = a _i-1,j +a _i,j-1( i,j ≠ 0). Now you have known a _1,0,a _2,0,...,a _n,0, could you tell me a _n,m in the 233 matrix?

Input

There are multiple test cases. Please process till EOF.

For each case, the first line contains two postive integers n,m(n ≤ 10,m ≤ 10 ⁹). The second line contains n integers, a _1,0,a _2,0,...,a _n,0(0 ≤ a _i,0 < 2 ³¹).

Output

For each case, output a _n,m mod 10000007.

Sample Input

Sample Output

Source

2014 ACM/ICPC Asia Regional Xi'an Online

Recommend

hujie | We have carefully selected several similar problems for you: 5177 5176 5175 5174 5173

这道题是之前做过的这些题里稍微简单一点的矩阵构造，写出状态转移方程的题。只是要抓住数字23333的规律，23=2*10+3，即要抓出乘10+3的特点进行构造。

构造出以下矩阵即可：

参考代码：

#include<cstdio>
#include<iostream>
#include<cstring>

using namespace std;

const int mod=10000007;
int n,m;
struct mat
{
    long long d[12][12];
} A,B,E;

mat multi(mat &a,mat &b)
{
    mat ans;
    for(int i=0; i<12; i++)
    {
        for(int j=0; j<12; j++)
        {
            ans.d[i][j]=0;
            for(int k=0; k<12; k++)
                ans.d[i][j]+=a.d[i][k]*b.d[k][j];
            ans.d[i][j]%=mod;
        }
    }
    return ans;
}

mat quickmulti(int n)
{
    if(n==0) return E;
    if(n==1) return A;
    mat p=E,q=A;
    while(n)
    {
        if(n&1)
        {
            n--;
            p=multi(p,q);
        }
        else
        {
            n>>=1;
            q=multi(q,q);
        }
    }
    return p;
}

int main()
{
    for(int i=0; i<12; i++)
        for(int j=0; j<12; j++)
        {
            A.d[i][j]=B.d[i][j]=E.d[i][j]=0;
            if(i==j) E.d[i][j]=1;
        }
    for(int i=0; i<11; i++)
        A.d[i][0]=10,A.d[i][11]=1;
    A.d[11][11]=1;
    for(int i=1; i<=10; i++)
        for(int j=1; j<=i; j++)
            A.d[i][j]=1;
    B.d[0][0]=23,B.d[11][0]=3;
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=1; i<=n; i++)
            scanf("%d",&B.d[i][0]);
        mat c=quickmulti(m);
        c=multi(c,B);
        printf("%I64d\n",c.d[n][0]);
    }
}