组队赛2： Apple Trees 矩阵构造+矩阵快速幂

题目

Apple Trees
In the beginning God created the heaven and the earth, the next five days God created the light, the water, the sky, the land, the trees and the living creatures, and on the sixth day he formed a man from the dust of the ground, called Adam. Afterwards, God took one of the man’s ribs and made a woman from the rib, called Eve. Adam and Eve lived in peace and harmony in the land, until God told them they should not take any apple from the only apple tree in Earth (at that moment, in year 0).

How they disobeyed God is a story from another day, now we are interested in how apple trees population increased over all those years. Apple trees are very interesting because their cycle of life is the following: first an apple fall into the ground and immediately a new apple tree blooms, from this moment we consider this as an apple tree, exactly ten years later the tree is full-grown and it starts to generate apples, from here every ten years the tree generates f(x) apples, where and x is the age of the tree, note that x will be always be a multiple of 10. Every apple generated from a tree will fall into the ground and generate a new tree, finally every apple tree dies exactly at the age of 45.

Now we want to know how many apple trees will be living on Earth after n years of the creation. At year 0 the apple tree created by God was not full-grown (this happened 10 years later).

Input
The input consists of only one integer n (0 ≤ n ≤ 1015) - the number of years after the creation of the Earth including Adam, Eve and the first apple tree.

Output
Print a single integer - the number of apple trees on Earth at the end of the n - th year after the creation of Earth, as this number can be very big print it modulo 109 + 7

题意

数每45年会死掉，每十年会生一次，生出来的树的个数有式子可以算。
问你好多年后，有多少树正好活着

思路

数据量很大，不能直接模拟。
这里用矩阵快速幂可以推出来。

式子就这样，很简单。
这个是每十年乘一次的。
每过十年，40岁的肯定死了，三十岁的数目到了四十岁这里，然后20到30这里，都往前走。右边的那个矩阵的前四列就是这个意思。
最后一列是修改零岁的树的个数，30岁的过十年会生f(40)的个数的零岁的树，依次下去20生f(30)………………
然后就看多少个十年，矩阵快速幂一下就好了。
当然这里是十年十年算的，而树的寿命只有45年，有可能给出的不到十年，而树死了。那就看一下年份的个位是不是已经>4，大的话肯定40岁的都死了，再减掉就行。

注：
取模之前记得加上模，不然会WA。

代码

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
typedef long long ll;
using namespace std; 
const ll size=5;//the max size of matrix
const ll mod=1e9+7;
ll n;
struct mat
{
	ll m[size][size];
	mat(){
		memset(m,0,sizeof(m));
	}
	void ans_init()
	{ 
		for(int i=0;i<size;i++)
			m[i][i]=1;
	}
	void base_init()
	{
		m[1][0]=1;m[2][1]=1;m[3][2]=1;m[4][3]=1;
		m[1][4]=1;m[2][4]=4;m[3][4]=9;m[4][4]=16;
	}
	mat operator *(const mat &c)//运算符重载 
	{
		mat res;
		for(int i=0;i<size;i++)
			for(int j=0;j<size;j++)
				for(int k=0;k<size;k++)
					res.m[i][j]=(res.m[i][j]+m[i][k]*c.m[k][j]+mod)%mod;//这里已经mod了，外面不用再加 
		return res;	//result
	}
}base;
mat matpow(ll n)//求n次方 
{
	mat ans;
	ans.ans_init();//单位矩阵 
	while(n){
		if(n&1) ans=ans*base;
		base=base*base;
		n>>=1;
	}
	return ans; 
}
int  main()
{
	scanf("%lld",&n);
	base.base_init();
	mat ans=matpow(n/10);
/*矩阵 
	for(int i=0;i<size;i++)
	{
		for(int j=0;j<size;j++)
			printf("%lld	",ans.m[i][j]);			
		printf("\n");
	}
*/
	ll sum=0;
	for(int i=0;i<size;i++)
		sum=(sum+ans.m[4][i])%mod;

	if(n%10>4)//如果40岁的树死了 
		sum=(sum-ans.m[4][0]+mod)%mod;
	printf("%lld\n",sum);
	return 0;
}