HDU 1757解题报告

A Simple Math Problem

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

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
  
  

 

Author

linle

 

Source

2007省赛集训队练习赛（6）_linle专场

 

Recommend

lcy   |   We have carefully selected several similar problems for you:   3117  2256  2254  2294  2971 

         这道题是比较水的矩阵快速幂，直接给出了线性递推式，直接构造。

        参考代码：

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<ctime>
#include<cstdlib>
#include<iomanip>
#include<utility>
#define pb push_back
#define mp make_pair
#define CLR(x) memset(x,0,sizeof(x))
#define _CLR(x) memset(x,-1,sizeof(x))
#define REP(i,n) for(int i=0;i<n;i++)
#define Debug(x) cout<<#x<<"="<<x<<" "<<endl
#define REP(i,l,r) for(int i=l;i<=r;i++)
#define rep(i,l,r) for(int i=l;i<r;i++)
#define RREP(i,l,r) for(int i=l;i>=r;i--)
#define rrep(i,l,r) for(int i=1;i>r;i--)
#define read(x) scanf("%d",&x)
#define put(x) printf("%d\n",x)
#define ll long long
#define lson l,m,rt<<1
#define rson m+1,r,rt<<11
using namespace std;
int k,m;
struct mat
{
    int d[15][15];
} A,B,E;

mat multi(mat a,mat b)
{
    mat ans;
    rep(i,0,10)
    {
        rep(j,0,10)
        {
            ans.d[i][j]=0;
            rep(k,0,10)
                ans.d[i][j]+=a.d[i][k]*b.d[k][j];
            ans.d[i][j]%=m;
        }
    }
    return ans;
}

mat quickmulti(mat a,int k)
{
    if(k==0) return E;
    if(k==1) return a;
    mat ans=E;
    while(k)
    {
        if(k&1)
        {
            k--;
            ans=multi(ans,a);
        }
        else
        {
            k>>=1;
            a=multi(a,a);
        }
    }
    return ans;
}

int main()
{
    CLR(E.d);
    rep(i,0,10)
    E.d[i][i]=1;
    while(~scanf("%d%d",&k,&m))
    {
        if(k<10)
        {
            printf("%d\n",k%m);
            continue;
        }
        CLR(A.d);CLR(B.d);
        rep(i,1,10)
            A.d[i][i-1]=1;
        rep(i,0,10)
            read(A.d[0][i]);
        rep(i,0,10)
            B.d[i][0]=9-i;
        mat m1=quickmulti(A,k-9);
        m1=multi(m1,B);
        printf("%d\n",m1.d[0][0]);
    }
}