Submission #3422011

---

Source Code Expand

#define  REP(i, s, e) for(register int i = s; i <= e ;i++)
#define DREP(i, s, e) for(register int i = s; i >= e ;i--)

#define DEBUG fprintf(stderr, "Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)

#include <bits/stdc++.h>

#define int long long 
using namespace std;
const int maxn = 2e5 + 10;
const int MOD = 1e9 + 7;

int power_pow(int a, int b)
{
	int base = a % MOD, ans = 1;
	while (b)
	{
		if (b & 1) ans = ans * base % MOD;
		base = base * base % MOD;
		b >>= 1;
	}
	return (ans + MOD) % MOD;
}

#define inv(x) power_pow(x, MOD - 2)

template <typename T> T read()
{
	T ans(0), p(1);
	char c = getchar();
	while (!isdigit(c))
	{
		if (c == '-') p = -1;
		c = getchar();
	}
	while (isdigit(c))
	{
		ans = ans * 10 + c - 48;
		c = getchar();
	}
	return ans * p;
}

int fac[maxn], Inv[maxn];
void init(int N)
{
	fac[0] = 1;
	Inv[0] = 1;
	REP(i, 1, N)
	{
		fac[i] = fac[i-1] * i % MOD;
		Inv[i] = inv(fac[i]);
	}
}

int C(int n, int m) {return (fac[n] * Inv[m] % MOD * Inv[n - m] % MOD + MOD) % MOD;}
int CC(int n, int m) {return C(n + m - 1, m);}

int m, n;

signed main()
{
#ifdef CraZYali
	freopen("D.in", "r", stdin);
	freopen("D.out", "w", stdout);
#endif
	init(2e5);
	cin >> n >> m;
	chkmax(n, -n);
	int ans = 1;
	for (register int i = 2; i * i <= n ; i++)
		if (n % i == 0)
		{
			register int cnt = 0;
			while (n % i == 0)
			{
				n /= i;
				cnt++;
			}
			ans = ans * CC(m, cnt) % MOD;
		}

	if (n > 1) ans = ans * CC(m, 1) % MOD;

	cout << (ans * power_pow(2, m - 1) % MOD + MOD) % MOD;
	return 0;
}

Submission Info

Judge Result