摘要：
#include<cstdio>#include<cstdlib>#include<cstring>#include<iostream>#include<algorithm>using namespace std; const int maxn=3000005;long long oula[maxn 阅读全文
摘要：
//矩阵快速幂，本题二阶矩阵#include<cstdio>#include<cstring>#include<cstdlib>#include<iostream>#include<algorithm>using namespace std; const int mod = 1e9+7;struct 阅读全文