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): 5659    Accepted Submission(s): 3459

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

#include <iostream>
#include <string.h>
using namespace std;
int m;
void fun(int x[10][10], int y[10][10]){
    int z[10][10];
    memset(z, 0, sizeof(z));
    for(int i = 0; i < 10; i++){
        for(int j = 0; j < 10; j++){
            for(int l = 0; l < 10; l++){
                z[i][j]=(x[i][l]*y[l][j]+ z[i][j]) % m;
            }
        }
    }
    for(int i = 0; i < 10; i++){
        for(int j = 0; j < 10; j++){
            x[i][j] = z[i][j];
        }
    }
    return;
}

int main()
{
    int k;
    int a[10][10], t[10][10];
    while(scanf("%d%d", &k, &m) != EOF){
        memset(a, 0, sizeof(a));
        for(int i = 0; i < 10; i++){
            scanf("%d", &a[i][0]);
            if(i < 9){
                a[i][i+1] = 1;
            }
        }
        if(k >= 10){
            memset(t, 0, sizeof(t));
            for(int i = 0; i < 10; i++){
                t[i][i] = 1;
            }
            k = k - 9;
            while(k){
                if(k & 1){
                    fun(t, a);
                }
                fun(a, a);
                k /= 2;
            }
            int res = 0;
            for(int i = 0; i < 10; i++){
                res = ((9 - i)*t[i][0] +res)%m;
            }
            printf("%d\n", res);
        }
        else{
            int res = k % m;
            printf("%d\n", res);
        }
    }
    return 0;
}