Submission #3429521

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7,N=1e5+7;
int n,m,ans=1,inv[N];
int F(int a)
{
	int ret=1;
	for(int i=0;i<a;i++)ret=1ll*ret*(m+i)%mod;
	for(int i=1;i<=a;i++)ret=1ll*ret*inv[i]%mod;
	return ret;
}
int main()
{
	cin>>n>>m;
	inv[0]=inv[1]=1;
	for(int i=2;i<=1e5;i++)inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;
	if(n<0)n=-n;
	for(int i=2;i*i<=n;i++)
	if(n%i==0)
	{
		int cnt=0;
		while(n%i==0)n/=i,cnt++;
		ans=1ll*ans*F(cnt)%mod;
	}
	if(n>1)ans=1ll*ans*F(1)%mod;
	for(int i=1;i<m;i++)ans=2ll*ans%mod;
	cout<<ans<<endl;
}

Submission Info

Judge Result