AOJ A a^b%c

段学姐的题啊~~ 热泪盈眶的WA了我3次不明白为啥啊.....

很水的二分快速幂取模法。

#include<iostream>
using namespace std;int mod;int KK( int a,int b )
{if( b==1 )return a;if( b==0 )return 1;int ans;if( b%2==0 ){ans = KK( a,b/2 )%mod;ans = (ans*ans)%mod;}else{ans = KK( a,b-1 )%mod;ans = (ans*a)%mod;}return ans;
}int main(){int a,b;while( scanf( "%d %d %d",&a,&b,&mod)!=EOF ){printf( "%d\n",KK(a,b)%mod );}return 0;
}