POJ 1845 Sumdiv

#include<cstdio>
using namespace std;
typedef long long ll;
const int M=9901;
ll p[100],k[100];
ll power(ll n,ll m){
	ll sq=1;
	while(m){
		if(m&1)sq=sq*n%M;
		m>>=1;
		n=n*n%M;
	}
	return sq;
}
ll sum(ll n,ll m){
	if(m==0)return 1;
	if(m&1)return sum(n,m/2)*(1+power(n%M,m/2+1))%M;
	return (sum(n,m/2-1)*(1+power(n%M,m/2+1))+power(n%M,m/2))%M;
}
int main(){
	ll a,b,i,l=0,ans=1;
	scanf("%lld%lld",&a,&b);
	for(i=2;i*i<=a;){
		if(a%i==0){
			p[++l]=i;
			while(a%i==0){
				k[l]++;
				a/=i;
			}
		}
		if(i==2)i++;
		else i+=2;
	}
	if(a!=1){
		p[++l]=a;
		k[l]=1;
	}
	for(i=1;i<=l;i++)
		ans=ans*sum(p[i],k[i]*b)%M;
	if(a!=0)printf("%lld\n",ans);
	else puts("0");
	return 0;
}