快速幂取模算法

http://acm.nefu.edu.cn/problemShow.php?problem_id=601
ab 对mod 取模
long long f(long long a,long long b,long long mod)
{
int s=1;
while(b>0)
{
if(b%2==1)
{
s=sa%mod;
b=b-1;
}
a=a*a%mod;
b=b/2;
}
return s;