nefu 计算幂 517 (快速幂&递归)

source

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#define ll long long
using namespace std;
ll a,b,k;
ll quick(ll a,ll b,ll k)
{
	if(b==1)
		return a%k;
	ll z=((a%k)*(a%k))%k;
	if(b&1)
	{
		z=(a*quick(z,b/2,k))%k;
		return z;
	}
	else
		return quick(z,b/2,k);
}
int main()
{
	while(scanf("%lld%lld%lld",&a,&b,&k)!=EOF)
	{
		printf("%lld\n",quick(a,b,k));
	}
	return 0;
}

Memory Limit : 65536K