hdu 1757 A Simple Math Problem（矩阵快速幂）

A Simple Math Problem

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2780    Accepted Submission(s): 1649

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
  
  

 

图解：

这个图来自： http://www.cnblogs.com/wally/archive/2013/03/01/2938305.html

</pre><pre name="code" class="cpp">#include"iostream"
#include"stdio.h"
#include"string.h"
#include"algorithm"
#include"queue"
#include"vector"
using namespace std;
#define N 10
#define LL __int64
struct Mat
{
    LL mat[N][N];
};
int n=10,M;
int f[N];
Mat operator *(Mat a,Mat b)
{
    int i,j,k;
    Mat c;
    memset(c.mat,0,sizeof(c.mat));
    for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
        {
            c.mat[i][j]=0;
            for(k=0;k<n;k++)
            {
                c.mat[i][j]+=(a.mat[i][k]*b.mat[k][j])%M;
            }
            c.mat[i][j]%=M;
        }
    }
    return c;
}
int fun(Mat&a,int k)
{
    int i;
    Mat ans;
    memset(ans.mat,0,sizeof(ans.mat));
    for(i=0;i<n;i++)
        ans.mat[i][i]=1;
    while(k)
    {
        if(k&1)
            ans=ans*a;
        k>>=1;
        a=a*a;
    }
    LL s=0;
    for(i=0;i<n;i++)
    {
        s+=(ans.mat[0][i]*f[n-1-i])%M;
    }
    return s%M;
}
int main()
{
    int i,k;
    while(scanf("%d%d",&k,&M)!=-1)
    {
        Mat a;
        memset(a.mat,0,sizeof(a.mat));
        for(i=0;i<n;i++)
        {
            f[i]=i;
            scanf("%I64d",&a.mat[0][i]);
        }
        for(i=1;i<n;i++)          //第一行开始往下是单位矩阵
            a.mat[i][i-1]=1;
        printf("%d\n",fun(a,k-9));

    }
    return 0;
}