Poj 1845 （唯一分解定理+快速幂+逆元）

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

题意：给定2个自然数a,b，求a^b的所有约数的和

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#define mod 9901
#define MAX 1001
using namespace std;
typedef long long ll;
int cnt;
vector<ll> prime;
vector<ll> times;
ll qpow(ll a,ll b)
{
    ll ans=1;
    while(b)
    {
        if(b&1) ans=(ans*a)%mod;
        b>>=1;
        a=(a*a)%mod;
    }
    return ans;
}
void divide(ll n) {
    for(ll i=2;i*i<=n;++i) {
        if(n%i==0) {
            prime.push_back(i);ll cnt=0;
            while(n%i==0) {n/=i;++cnt;}
            times.push_back(cnt);
        }
    }
    if(n>1) {prime.push_back(n);times.push_back(1);}
}
int main()
{
    ll a,b;
    scanf("%lld%lld",&a,&b);
    divide(a);
    ll ans=1;
    for(int i=0,end=prime.size();i<end;++i) {
        times[i]*=b;
        if((prime[i]-1)%mod==0) ans=ans*(times[i]+1)%mod;
        else ans=ans*((qpow(prime[i],times[i]+1)-1+mod)*qpow(prime[i]-1,mod-2)%mod)%mod;
    }
    printf("%lld\n",ans);
    return 0;
}