思路:考虑转移方程 f ( n , 0 ) = f ( n − 1 , 9 ) ∗ 16 + f ( n − 1 , 19 ) ∗ 9 + f ( n − 1 , 29 ) ∗ 4 + f ( n − 1 , 39 ) ∗ 1 f(n,0)=f(n-1,9)*16+f(n-1,19)*9+f(n-1,29)*4+f(n-1,39)*1 f(n,0)=f(n−1,9)∗16+f(n−1,19)∗9+f(n−1,29)∗4+f(n−1,39)∗1,这是对于年龄为0岁的树而言,对于其他的<=44的树,其转移方程为 f ( n , i ) = f ( n − 1 , i − 1 ) f(n,i)=f(n-1,i-1) f(n,i)=f(n−1,i−1)。构造矩阵进行求解,矩阵f[i][j]表示从当前层的i年龄从上一层的j年龄的转化系数。
const int N = 46;
ll n, m;
void mul(ll c[][N], ll a[][N], ll b[][N])
{
ll tmp[N][N] = { 0 };
f(i, 0, N - 1)
f(j, 0, N - 1)
f(k, 0, N- 1)tmp[i][j] = (tmp[i][j] + a[i][k] * b[k][j]) % mod;
memcpy(c, tmp, sizeof tmp);
}
void jzksm(ll a[][N])
{
ll tmp[N][N] = { 0 };
f(i, 0, N- 1)tmp[i][i] = 1;
while (n)
{
if (n & 1)mul(tmp, tmp, a);
mul(a, a, a);
n >>= 1;
}
memcpy(a, tmp, sizeof tmp);
}
int main()
{
//freopen("in.txt", "r", stdin);
while (cin >> n)
{
ll f[N][N] = { 0 };
f[0][9] = 16;
f[0][19] = 9;
f[0][29] = 4;
f[0][39] = 1;
f(i, 1, 44)f[i][i - 1] = 1;
jzksm(f);
ll ans = 0;
f(i, 0, 44)
{
ans = (ans + f[i][0]) % mod;
}
cout << ans << endl;
}
return 0;
}