luogu P1226 取余运算||快速幂

题目传送门： https://www.luogu.org/problemnew/show/P1226

题意：求。

思路：

代码：

#include<cstdio>
#define LL long long
	LL x,k,p;
LL dg(LL x,LL k)
{
	if(!k) return 1%p;
	LL t=dg(x,k>>1)%p;
	return (k&1)?x*t%p*t%p:t*t%p;
}
int main()
{
	scanf("%lld %lld %lld",&x,&k,&p);
	printf("%lld^%lld mod %lld=%lld",x,k,p,dg(x,k));
}