POJ - 1845 Sumdiv【快速幂】【分治】

【题目描述】
Consider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division of S by 9901).

【输入】
The only line contains the two natural numbers A and B, (0 <= A,B <= 50000000)separated by blanks.

【输出】
The only line of the output will contain S modulo 9901.

【样例输入】
2 3

【样例输出】
15

【样例说明】
2^3 = 8.
The natural divisors of 8 are: 1,2,4,8. Their sum is 15.
15 modulo 9901 is 15 (that should be output).

题目链接：https://vjudge.net/problem/POJ-1845

代码如下：

#include <iostream>
using namespace std;
typedef long long ll;
static const int M=9901;
int power(int a,int b)
{
    int ans=1%M;
    for(;b;b>>=1)
    {
        if(b&1) ans=(ll)ans*a%M;
        a=(ll)a*a%M;
    }
    return ans;
}
int sum(int p,int c)
{
    if(c==0) return 1;
    else if(c&1) return (1+power(p,(c+1)>>1))*sum(p,(c-1)>>1)%M;
    else return ((1+power(p,c>>1))*sum(p,(c>>1)-1)+power(p,c))%M;
}
int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(0),cout.tie(0);
    int a,b;
    cin>>a>>b;
    int ans=1;
    for(int i=2;i<=a;i++)
    {
        int c=0;
        while(a%i==0)
        {
            a/=i;
            c++;
        }
        ans=ans*sum(i,b*c)%M;
    }
    cout<<ans<<endl;
    return 0;
}