快速幂真的很快

#include <bits/stdc++.h>
#define int long long
using namespace std;

int quick_pow(int b,int p,int k)
{
	if(p == 0) return 1;
	int ans = quick_pow(b,p/2,k);
	ans = ans*ans%k;
	if(p%2!=0) ans = ans*b%k;
	return ans;
}

signed main()
{
	int b,p,k;
	cin >> b >> p >> k;
	printf("%lld",quick_pow(b,p,k));
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main(){
    int a,b,P;cin>>a>>b>>P;
    int res=1;
    while(b){
        if(b & 1) res=1ll*res*a%P;
        a=1ll*a*a%P;
        b>>=1;
    }
    cout<<res;
}