LightOJ 1236 Pairs Forming LCM(唯一分解定理+素数筛)

Pairs Forming LCM

题解：考虑唯一分解定理：$a={p_1}^{n_1}\cdot {p_2}^{n_2}...{p_k}^{n_k}$，$b={p_1}^{m_1}\cdot {p_2}^{m_2}...{p_k}^{m_k}$
$$\{\begin{array}{l}lcm(a,b)={p_1}^{max(n_1,m_1)}\cdot {p_2}^{max(n_2,m_2)}...{p_k}^{max(n_k,m_k)}\\ \\ gcd(a,b)={p_1}^{min(n_1,m_1)}\cdot {p_2}^{min(n_2,m_2)}...{p_k}^{min(n_k,m_k)}\end{array}$$
所以我们考虑将$n$质因子分解$n={p_1}^{e_1}\cdot {p_2}^{e_2}...{p_k}^{e_k}$，有$e_i=max(n_i,m_i)$。

对于$i={p_1}^{n_1}\cdot {p_2}^{n_2}...{p_k}^{n_k}$时和$j={p_1}^{m_1}\cdot {p_2}^{m_2}...{p_k}^{m_k}$时的每一个质因子的指数我们都有$max(n_i,m_i)+1$种取法，再除去$i=x\cdot p^m$和$j=x\cdot p^n$的情况，因此总共就是$2(e_i+1)-1$种，然后又根据乘法原理有$\prod (2\cdot e_i+1)$，最后除去$i>j$和加上指数相等的情况，就有$ans=\frac{\prod 2\cdot e_i+1}{2}+1$。

代码

#include<bits/stdc++.h>
typedef long long LL;
using namespace std;
const int N = 1E7+10, M = N / log(N) + N/10;
int prime[M], k;
bool vis[N];
void init()
{
	for(int i = 2; i < N; ++i) {
		if(vis[i] == 0)
			prime[k++] = i;
		for(int j = 2; j * i < N; ++j) {
			if(vis[i * j] == 0) 
				vis[i * j] = 1;
		}
	}
}

LL solve(LL n)
{
	LL t = n, ans = 1;
	for(int i = 0; i < k && prime[i] <= sqrt(t); ++i) {
		int cnt = 0;
		while(n % prime[i] == 0) {
			cnt++;
			n /= prime[i];
		}
		ans *= (2 * cnt + 1);
	}
	if(n > 1) ans *= (2 * 1 + 1);
	return ans / 2 + 1;
}

int main()
{
#ifndef ONLINE_JUDGE
    freopen("input.in","r",stdin);
#endif
	init();
	int T, t = 1;
	cin >> T;
	while(T--) {
		LL n;
		cin >> n;
		LL ans = solve(n);
		cout << "Case "<< t++ << ": " << ans << endl;
	}
    return 0;
}