快速幂模板。
#include<bits/stdc++.h> using namespace std; typedef long long ll; ll a,b,m,ans=1; int main(){ scanf("%lld%lld%lld",&a,&b,&m); while(b){ if(b%2) ans=ans*a%m; a=a*a%m; b/=2; } printf("%lld",ans); }
By signing up a HFOJ universal account, you can submit code and join discussions in all online judging services provided by us.
Using your HFOJ universal account