程序代码：

#include<cstdio>
__int64 quickpow(__int64 a,__int64 k,__int64 mod)
{
    __int64 temp=1;
    while(k>0){
        if(k&1)
            temp=(a%mod)*(temp%mod)%mod;  
        a=(a%mod)*(a%mod)%mod;      
        k/=2;
    }
    return temp;
}
int main()
{
    __int64 a,k,m;
    while(~scanf("%I64d%I64d%I64d",&a,&k,&m)){
        printf("%I64d\n",quickpow(a,k,m));
    }
    return 0;
}

程序代码：

#include<stdio.h>
long long AxBmodM(long long a, long long b, long long m)
{
    long long r;
    for(r = 0; b; b >>= 3, a = (a << 3) % m)
        if(b & 7) r = (r + a * (b & 7)) % m;
    return r;
}

long long quickPow(long long a, long long k, long long m)
{
    long long r;
    if(a == 0) return 0;
    if(k == 0) return 1;
    if(k == 1) return a % m;
    r = quickPow(a, k >> 1, m);
    r = AxBmodM(r, r, m);
    if(k & 1) r = AxBmodM(r, a, m);
    return r;
}

int main()
{
    long long a, k, m;
    while(scanf("%I64d%I64d%I64d", &a, &k, &m) != EOF)
        printf("%I64d\n", quickPow(a, k, m));
    return 0;
}

程序代码：

#include<cstdio>
__int64 quickpow(__int64 a,__int64 k,__int64 mod)
{
    __int64 aa,sum,temp=1;
    while(k){
        if(k&1)
            temp=a*temp%mod;
        if(a<1000000000) a=a*a%mod;
        else
        {
            aa=a;
            sum=0;
            while(aa){
                sum=(sum+a*(aa%10)%mod)%mod;
                aa/=10;
                a=a*2%mod;
                a=a*5%mod;
            }
            a=sum;            
        }
        k>>=1;
    }
    return temp;
}
int main()
{
    __int64 a,k,m;
    while(~scanf("%I64d%I64d%I64d",&a,&k,&m)){
        printf("%I64d\n",quickpow(a%m,k,m));
    }
    return 0;
}