递归求解等比为a的等比数列前n项和
对n要分奇偶讨论
#include <bits/stdc++.h>
#define int long long
using namespace std;
int mo;
int ksm(int a,int b,int p=mo)
{
int ans=1;
while(b)
{
if(b&1) ans = ans*a%p;
a=a*a%p; b >>= 1;
}
return ans;
}
int sum(int a,int n)
{
if(n==1) return a;
if(n%2) return (ksm(a,n)+(1+ksm(a,n/2))*sum(a,n/2))%mo;
else return (1+ksm(a,n/2))*sum(a,n/2)%mo;
}
signed main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int a,n;
cin>>a>>n>>mo;
int ans=sum(a,n);
cout<<ans<<endl;
return 0;
}