Submission #6427399

---

Source Code Expand

#include<iostream>
using namespace std;
typedef long long ll;
#define MOD 1000000007ll

ll inv(int x){
	for(ll y=1;;y+=MOD)
		if(y%x==0)return y/x;
}

ll func(int m,int c){
	ll ans=1;
	for(int i=0;i<c;++i)ans=ans*(m+i)%MOD;
	for(int i=1;i<=c;++i)ans=ans*inv(i)%MOD;
	return ans;
}

int main(){
	ll n,m,ans=1;;
	ios::sync_with_stdio(0);
	cin>>n>>m;
	if(n<=0)n*=-1;
	for(ll p=2;p*p<=n;++p)
		if(n%p==0){
			int cnt=0;
			while(n%p==0){
				n/=p;
				++cnt;
			}
			ans=ans*func(m,cnt)%MOD;
		}
	if(n>1)ans=ans*func(m,1)%MOD;
	for(int i=0;i<m-1;++i)ans=ans*2%MOD;
	cout<<ans<<"\n";
	return 0;
}

Submission Info

Judge Result