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): 2485    Accepted Submission(s): 1446

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专场

 

水题，构造矩阵

#include <iostream>

using namespace std;
const int MAX = 10;
int Mod=500;
typedef  struct{
         int  m[MAX][MAX];
}  Matrix;
Matrix P={0,0,0,0,0,0,0,0,0,0,
          1,0,0,0,0,0,0,0,0,0,
          0,1,0,0,0,0,0,0,0,0,
          0,0,1,0,0,0,0,0,0,0,
          0,0,0,1,0,0,0,0,0,0,
          0,0,0,0,1,0,0,0,0,0,
          0,0,0,0,0,1,0,0,0,0,
          0,0,0,0,0,0,1,0,0,0,
          0,0,0,0,0,0,0,1,0,0,
          0,0,0,0,0,0,0,0,1,0
          };
Matrix I={1,0,0,0,0,0,0,0,0,0,
          0,1,0,0,0,0,0,0,0,0,
          0,0,1,0,0,0,0,0,0,0,
          0,0,0,1,0,0,0,0,0,0,
          0,0,0,0,1,0,0,0,0,0,
          0,0,0,0,0,1,0,0,0,0,
          0,0,0,0,0,0,1,0,0,0,
          0,0,0,0,0,0,0,1,0,0,
          0,0,0,0,0,0,0,0,1,0,
          0,0,0,0,0,0,0,0,0,1
          };


Matrix matrixmul(Matrix a,Matrix b)
{
       int i,j,k;
       Matrix c;
       for (i = 0 ; i < MAX; i++)
           for (j = 0; j < MAX;j++)
             {
                 c.m[i][j] = 0;
                 for (k = 0; k < MAX; k++)
                     c.m[i][j] += (a.m[i][k]*b.m[k][j])%Mod;
                 c.m[i][j] %= Mod;
             }
       return c;
}

Matrix quickpow(long long n)
{
      Matrix m = P, b = I;
              while (n >= 1)
       {
             if (n & 1)
                b = matrixmul(b,m);
             n = n >> 1;
             m = matrixmul(m,m);
       }
       return b;
}

int main()
{
    int a[10];
    int t,sum;
    Matrix tmp;
    while(cin>>t>>Mod)
    {
     sum=0;
     for(int i=0;i<=9;i++)
      {
        cin>>a[i];
        P.m[0][i]=a[i];
      }
      if (t<10) cout<<t%Mod<<endl;
      if (t>=10)
      {
       tmp=quickpow(t-9);
       for(int j=9;j>=0;j--)
       sum=(sum+tmp.m[0][9-j]*j)%Mod;
        cout<<sum<<endl;
      }



    }
    return 0;
}