代码如下：

#include<iostream>
#include<cstdio> 
using namespace std;
long long z,d,p;
int  main(){
	cin>>z>>d>>p;
	int x,y,b=1;
	x=z,y=d;
	while(d>0){
		if(d%2!=0){
			b=b*x%p;
		}
		x=x*x%p;
		d/=2;
	}
	b%=p;
	printf("%d^%d mod %d=%d",z,y,p,b);
	return 0;
}