春思

题目大意

求a^b的约数和。

基础题

分解出a的质因数即可，然后算等比数列和可以倍增。

#include<cstdio>
#include<algorithm>
#include<cmath>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
typedef long long ll;
const int mo=9901;
ll i,j,k,l,t,n,m,ans;
ll a,b;
ll qsm(ll x,ll y){
    if (!y) return 1;
    ll t=qsm(x,y/2);
    t=t*t%mo;
    if (y%2) t=t*x%mo;
    return t;
}
ll work(ll x,ll y){
    if (y==0) return 1;
    if (y%2==1){
        ll t=work(x,y/2);
        t=(t+t*qsm(x,y/2+1)%mo)%mo;
        return t;
    }
    else{
        /*ll t=work(x,y/2-1);
        t=(t+t*qsm(x,y/2)%mo)%mo;
        t=(t+qsm(x,y))%mo;
        return t;*/
        return (work(x,y-1)+qsm(x,y))%mo;
    }
}
int main(){
    freopen("spring.in","r",stdin);freopen("spring.out","w",stdout);
    scanf("%lld%lld",&a,&b);
    t=floor(sqrt(a));
    ans=1;
    fo(i,2,t){
        if (a%i==0){
            k=0;
            while (a%i==0){
                k++;
                a/=i;
            }
            ans=ans*work(i%mo,(ll)k*b)%mo;
        }
    }
    if (a>1) ans=ans*work(a%mo,b)%mo;
    printf("%d\n",ans);
}