HDU 1757 A Simple Math Problem(矩阵快速幂)

A Simple Math Problem

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

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 
       
       

 

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>

using namespace std;

struct node
{
    int mp[15][15];
} init,res;

long long int k,mod;

void chu()
{
    for(int i=0;i<10;i++)
    {
        for(int j=0;j<10;j++)
        {
            if(i == j)
            {
                res.mp[i][j] = 1;
            }
            else
            {
                res.mp[i][j] = 0;
            }
        }
    }
    for(int i=0;i<10;i++)
    {
        for(int j=0;j<10;j++)
        {
            if(i-1 == j)
            {
                init.mp[i][j] = 1;
            }
            else
            {
                init.mp[i][j] = 0;
            }
        }
    }
}

struct node mult(struct node a,struct node b)
{
    struct node c;
    for(int i=0; i<10; i++)
    {
        for(int j=0; j<10; j++)
        {
            c.mp[i][j] = 0;
            for(int k=0; k<10; k++)
            {
                c.mp[i][j] += (a.mp[i][k] * b.mp[k][j])%mod;
                c.mp[i][j] %= mod;
            }
        }
    }
    return c;
} ;

struct node Cal(long long int kk)
{
    struct node tmp = res,x = init;
    while(kk)
    {
        if(kk%2 == 1)
        {
            tmp = mult(x,tmp);
        }
        x = mult(x,x);
        kk>>=1;
    }
    return tmp;
};

int main()
{
    while(~scanf("%lld%lld",&k,&mod))
    {
        chu();
        for(int i=0; i<10; i++)
        {
            scanf("%d",&init.mp[0][i]);
        }
        if(k<10)
        {
            printf("%d\n",k%mod);
            continue;
        }
        struct node tt;
        tt = Cal(k-9);
        int sum = 0;
        for(int i=0; i<10; i++)
        {
            sum += (tt.mp[0][i]*(9-i))%mod;
        }
        printf("%d\n",sum%mod);
    }
    return 0;
}