快速幂算法代码

#include <stdio.h>
long long PowMod(long long a,long long b,long long c)//快速幂
{
   long long answer = 1;
   a = a % c;
   while(b > 0)
   {
       if(b % 2 == 1)
         answer = (answer * a) % c;
       b /= 2;
       a = (a * a) % c;
   }
   return answer;
}
int main()
{
    long long a,b,c;
    while(scanf("%lld%lld%lld",&a,&b,&c)!=EOF)
    {

        printf("%lld\n",PowMod(a,b,c));
    }
    return 0;
}

参考此文（快速幂详解）