xiaohang3414的博客

Holion August will eat every thing he has found.         Now there are many foods,but he does not want to eat all of them at once,so he find a sequence. fn=⎧⎩⎨⎪⎪1,ab,abfcn−1fn−2,n=1n=2otherw

Problem DescriptionFunction Fx,ysatisfies:For given integers N and M,calculate Fm,1 modulo 1e9+7. InputThere is one integer T in the first line.The next T lines,each line

题目：点击打开链接题意：F(1)=a，F(2)=b，F(N)=2F(N-2)+F(N-1)+N^4给你N,a,b(N,a,b 求F(N)%2147493647分析：如果递推式是F(N)=2F(N-2)+F(N-1)就方便了许多，基本的矩阵快速幂但是多了n^4;这时，又产生了i^3,i^2,i这些新项