约数之和【数论】【扩欧】

>Link

ybtoj约数之和

---

>Description

求 $A^B$ 所有约数之和模 $9901$

---

>解题思路

可以把 $A$ 质因数分解为 $p_1^{k_1}\ast p_2^{k_2}\ast ...\ast p_n^{k_n}$
$A^B$ 就把这堆乘 $B$ 次
所有约数就是这些质因数一一组合，那么约数之和就等于 ${\prod }_{i=1}^n{\sum }_{j=0}^{k_i\ast B}{p}_i^j$
根据等比数列公式 $S=\frac{a_1\ast (1-p^n)}{1-p}$，可以把式子转换成 ${\prod }_{i=1}^n\frac{1-p_i^{k_i\ast B+1}}{1-p_i}$，加一是因为还有个 $p_i^0$
分子部分用快速幂求，分母部分用扩展欧几里得求逆元

---

>代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define LL long long
using namespace std;

const LL Mod = 9901;

void ex_gcd (LL a, LL b, LL &x, LL &y)
{
	if (!b) {x = 1, y = 0; return;}
	LL X, Y;
	ex_gcd (b, a % b, X, Y);
	x = Y;
	y = X - (a / b) * Y;
}
LL inv (LL a)
{
	LL inv_a, y;
	ex_gcd (a, Mod, inv_a, y);
	return (inv_a + Mod) % Mod;
}
LL power (LL a, LL b)
{
	LL ret = 1;
	for (a %= Mod; b; b >>= 1, a = a * a % Mod)
	  if (b & 1) ret = ret * a % Mod;
	return ret;
}

int main()
{
	LL a, b, ans,  cnt;
	scanf ("%lld%lld", &a, &b);
	ans = 1;
	for (LL i = 2; i <= a; i++)
	{
		if (!a) break;
		if (a % i) continue;
		cnt = 0;
		while (a % i == 0) a /= i, cnt++;
		ans = ans * (power (i, b * cnt + 1) - 1) % Mod;
		ans = ans * inv (i - 1) % Mod;
	}
	printf ("%lld", ans);
	return 0;
}