最少内存

就一个简单的快速幂

#include<cstdio>
using namespace std;
typedef long long ll;
int main(){
    ll a,b,p;
    scanf("%lld%lld%lld",&a,&b,&p);
    ll cheng=a,ans=1,t=b;
    while(t){
        if(t%2==1)ans*=cheng;
        ans%=p;
        cheng=cheng*cheng%p;
        t/=2;
    }
    printf("%lld^%lld mod %lld=%lld",a,b,p,ans);
    return 0;
}