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

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

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
  
  

 

矩阵快速幂模板题~

CODE：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
using namespace std;
typedef long long ll;
typedef vector<int> vec;
typedef vector<vec> mat;

int k,m;

void init(mat A)
{
    for(int i=0;i<10;i++)
        for(int j=0;j<10;j++)
            A[i][j]=0;
}
void print(mat A)
{
    for(int i=0;i<10;i++)
    {
        for(int j=0;j<10;j++)
            printf("%d ",A[i][j]);
        printf("\n");
    }
}
mat mul(mat &A,mat &B) //A*B
{
    mat C(A.size(), vec(B[0].size()));
    init(C);
    for(int i=0; i<A.size(); i++)
    {
        for(int k=0; k<B.size(); k++)
        {
            for(int j=0; j<B[0].size(); j++)
            {
                C[i][j]= (C[i][j] + A[i][k] * B[k][j]) % m;
            }
        }
    }
    return C;
}
mat pow(mat A) //A^k
{
    mat B(A.size(),vec(A.size()));
    init(B);
    for(int i=0; i<A.size(); i++)
        B[i][i]=1;
    while(k > 0)
    {
        if(k & 1) B = mul(B, A);
        A = mul(A, A);
        k >>= 1;
    }
    return B;
}

int main()
{
    //freopen("in.in","r",stdin);
    int f[10];

    for(int i=0;i<10;i++)
        f[i]=i;
    while(~scanf("%d%d",&k,&m))
    {
        mat A(10, vec(10));
        init(A);
        for(int i=9;i>=0;i--)
        {
            scanf("%d",&A[9][i]);
            f[i]=i;
        }
        for(int i=0,j=1;i<9,j<10;i++,j++)
            A[i][j]=1;

        A = pow(A);
        ll ans=0;
        for(int i=0; i<10; i++)
        {
            ans +=(ll) A[k/10][i] * f[i] % m;
        }
        printf("%lld\n",ans%m);
    }
    return 0;
}