https://ac.nowcoder.com/acm/contest/903/B
题意：
总结：递归二分求幂，递归求等比数列！
#include<algorithm> #include<set> #include<queue> #include<cmath> #include<cstring> #include<iostream> #include<set> #include<vector> #include<queue> #include<cmath> #include<cstdio> #include<map> #include<stack> #include<string> #include<bits/stdc++.h> using namespace std; #define sfi(i) scanf("%d",&i) #define pri(i) printf("%d\n",i) #define sff(i) scanf("%lf",&i) #define ll long long #define ull unsigned long long #define mem(x,y) memset(x,y,sizeof(x)) #define INF 0x3f3f3f3f #define eps 1e-16 #define PI acos(-1) #define lowbit(x) ((x)&(-x)) #define zero(x) (((x)>0?(x):-(x))<eps) #define fl() printf("flag\n") #define MOD(x) ((x%mod)+mod)%mod #define endl '\n' #define pb push_back #define lson rt<<1,l,mid #define rson rt<<1|1,mid+1,r #define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0) const int maxn=1e6+9; const int mod=1e9+7; inline ll read() { ll f=1,x=0; char ss=getchar(); while(ss<'0'||ss>'9') { if(ss=='-')f=-1;ss=getchar(); } while(ss>='0'&&ss<='9') { x=x*10+ss-'0';ss=getchar(); } return f*x; } ll PowMod(ll a,ll n,ll m) { if(n==0) return 1; ll x = PowMod(a,n/2,m); ll ans = x*x%m; if(n%2==1) ans=ans*a%m; return ans; } ll PowSumMod(ll a,ll n,ll m) { if(n==1) return a%m; if(n%2==0) return (1+PowMod(a,n/2,m))*PowSumMod(a,n/2,m)%m; else return ((1+PowMod(a,(n-1)/2,m))*PowSumMod(a,(n-1)/2,m)%m + PowMod(a,n,m))%m; } int main() { FAST_IO; //freopen("input.txt","r",stdin); int t; cin>>t; while(t--) { ll n,q,p; cin>>q>>n>>p; cout<<PowSumMod(q,n,p)<<endl; } return 0; }
