2014西安网络预选赛1009（矩阵快速幂）hdu5015

原创于 2014-09-14 21:59:50 发布 · 833 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

快速幂

当前文章被收录于：

快速幂

2 篇文章 0 人学习

订阅专栏查看详情

当前文章被以下社区和专栏收录：

233 Matrix

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

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

234
2799
72937

题意：RT

思路：矩阵快速幂

可以构造一个（n+2）*（n+2）

假设n=3，输入的序列为23 47 16

构造出的矩阵M（5*5）如下：再构造出一个(n+2)*1的矩阵A如下：

10 0 0 0 1 233

1 1 0 0 0 23

1 1 1 0 0 47

1 1 1 1 0 16

0 0 0 0 1 3

令矩阵B=(M^m)*A

那么答案为B的第n项

#include 
#include 
#include 
#include 
using namespace std;
#define maxn 15
#define MOD 10000007

typedef __int64 ll;
int M[maxn][maxn];
int ans[maxn][maxn];
int A[maxn][1];
int B[maxn][1];
int a[maxn];

int add(int a,int b)
{
    a+=b;
    if(a>=MOD)a-=MOD;
    return a;
}

void init(int n)
{
    memset(M,0,sizeof(M));
    for(int i=0;i

标签

#ACM #hdu