Alternating Sum CodeForces - 964C

CodeForces - 964C

题意 : 给定一个公式，给你一个k个字符，表示前k个的加减规则(且以k为循环)，然后就是让你求这段长度中的值，结果对1e9+9取余。

思路 : 快速幂

!!!!!! :  费马小定理取逆元

            

#include<cstdio>
#include<cmath>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<sstream>
#include<map>
#include<stack>
#include<queue>
#include<set>
#include<string>
using namespace std;
typedef long long ll;
const int m = 1e9 + 9;
int flag[100001];
ll Quickpow(ll a,ll n){
    if(n==0) return 1;
    ll ans = Quickpow(a,n/2)%m;
    ans = ans * ans % m;
    if(n%2==1) ans = ans * a % m;
    return ans;
}
int main(){
    ll ans = 0;
    char ch;
    ll n,a,b,k;
    cin>>n>>a>>b>>k;
    getchar();
    for(int i = 1;i<=k;i++){
        scanf("%c",&ch);
        if(ch=='+') flag[i] = 1;
        else flag[i] = -1;
    }
    ll left = (n+1)%k;
    for(int i = 1;i<=k;i++){
        ll T = (n+1-left)/k;
        if(i<=left) T++;
        int t = i - 1;
        ll d = Quickpow(a,n-t)*Quickpow(b,t)%m;
        ll A = Quickpow(a, T*k)%m - Quickpow(b, T*k)%m;
        ll B = (Quickpow(a, T*k)%m - Quickpow(b,k)*Quickpow(a, (T-1)*k)%m)%m;
        while(A<0) A+=m;while(B<0) B+=m;
        ll C = A * (Quickpow(B, m-2))%m;
        d = flag[i]*d;
        while(d<0) d+=m;
        d%=m;
        if(B!=0) ans =(ans + d*C%m)%m;
        else ans = (ans + d*T%m)%m;
    }
    while(ans<0) ans+=m;
    printf("%lld",ans);
    return 0;
}