Submission #3392523

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <cstdio>

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) {
	int i;
	ll  ans= 1;
	for(i= 0; i < c; i++) ans= ans * (M + i) % MOD;
	for(i= 1; i <= c; i++) ans= ans * inv(i) % MOD;
	return ans;
}
int main() {
	int i;
	ll  N, M;
	cin >> N >> M;
	if(N < 0) N= -N;
	ll ans= 1;
	ll p;
	for(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(i= 0; i < M - 1; i++) ans= ans * 2 % MOD;
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result