快速幂

int PowerMod(int a, int b, int c){   int ans = 1;a = a % c;     while (b>0){           if (b % 2 == 1)   ans = (ans * a) % c;             b = b / 2;         a = (a * a) % c;        }   return ans;}#include <cstdio>#include <cstring>typedef __int64 LL;const int mod = 12312311223;LL solve(int a,int n){    LL res = 1;    LL temp = a;    for(;n;n=n/2)    {        if(n%2==1)            res=(res*temp)%mod;        temp = (temp%mod)*(temp%mod)%mod;    }    return res;}int main(){    int a,n;    while(scanf("%d%d",&a,&n)!=EOF)    {        printf("%I64d\n",solve(a,n));    }    return 0;}