#include<iostream>usingnamespace std;typedeflonglong ll;constint mod =1e9+7;constint N =1e5+10;
ll f[N];
ll a, b, m, n;voidfb(){
f[1]=1;
f[2]=1;for(int i=3; i<=n; i++){
f[i]=(a * f[i-1]%(mod-1)+ b * f[i
A 广义肥波第一次参加牛客练习赛,快速幂签到是我没想到的#include<iostream>using namespace std;typedef long long ll;const int mod = 1e9+7;const int N = 1e5+10;ll f[N];ll a, b, m, n;void fb(){ f[1] = 1; f[2] = 1; for(int i=3; i<=n; i++) { f[i] = (a * f[i-1] %