CodeForces 678D Iterated Linear Function 矩阵快速幂
题意:由递推式g(n)=Ag(n-1)+B,g(0)=X;求g(n) % (1e9+7)。
思路:构造变换矩阵A为{
{A, B}, {0, 1}}; 初始矩阵B为{
{X, 0}, {1, 0}}; 那么A^N*B求出答案。
#include <cmath>
#include <queue>
#include <vector>
#include <cstdio>
#include <string>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <algorithm>
using namespace std;
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#define FIN freopen("input.txt","r",stdin)
#define FOUT freopen("output.txt","w",stdout)
typedef __int64 LL