A Simple Math Problem
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.
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.
10 9999 1 1 1 1 1 1 1 1 1 1 20 500 1 0 1 0 1 0 1 0 1 0
45 104
/* 0 0 0 0 0 0 0 0 0 a9
1 0 0 0 0 0 0 0 0 a8
0 1 0 0 0 0 0 0 0 a7
0 0 1 0 0 0 0 0 0 a6
(f0 f1 f2 f3 f4 f5 f6 f7 f8 f9) * 0 0 0 1 0 0 0 0 0 a5
0 0 0 0 1 0 0 0 0 a4
0 0 0 0 0 1 0 0 0 a3
0 0 0 0 0 0 1 0 0 a2
0 0 0 0 0 0 0 1 0 a1
0 0 0 0 0 0 0 0 1 a0
要构造一个后面的10*10的矩阵,记为a[][],那最后的结果就是 (f0 f1 f2...f8 f9) * a^(k-9) ,得到一个1*10的矩阵, 第一行的最后一个数就是所求
*/
#include<cstdio>
#include<cstring>
int k, m;
typedef struct matrix
{
int s[15][15];
};
matrix a,D;
int f[15];
void init()
{
//初始化a数组;
memset(a.s, 0, sizeof(a.s));
for(int i = 9; i >= 0; i--)
scanf("%d", &a.s[i][9]);
for(int i = 1; i <= 9; i++)
a.s[i][i-1] = 1;
memset(D.s, 0, sizeof(D.s));
for(int i = 0; i <= 9; i++)
D.s[i][i] = 1;
//初始化f数组
for(int i = 0; i <= 9; i++)
f[i] = i;
}
matrix mul(matrix A, matrix B)
{
matrix s;
for(int i = 0; i <= 9; i++)
for(int j = 0; j <= 9; j++)
{
s.s[i][j] = 0;
for(int k = 0; k <= 9; k++)
s.s[i][j] = (s.s[i][j] + A.s[i][k] * B.s[k][j]) % m;
}
return s;
}
matrix pow(matrix A, int k)
{
matrix s = D;
while(k)
{
if(k & 1)
s = mul(A,s);
k = k / 2;
A = mul(A,A);
}
return s;
}
int main ()
{
while(scanf("%d %d", &k, &m)!=EOF)
{
init(); //初始化
a = pow(a, k - 9);
long long ans = 0;
for(int i = 0 ; i <= 9; i++)
ans = (ans + f[i]*a.s[i][9]) % m;
printf("%lld\n", ans);
}
return 0;
}