HDU5171GTY's birthday gift——矩阵快速幂裸题

http://acm.split.hdu.edu.cn/showproblem.php?pid=5171php s(n)=s(n-1)+f(n-1)+f(n-2) f(n)=f(n-1)+f(n-2) s(k)=(a^k*b)%modios #include<iostream> #include<algorithm> #include<cstdio> #include<cstring> #defi

>>阅读原文<<