LCM数对

$lcm(a,b)=\frac{a\ast b}{gcd(a,b)}$ <1>

我们设 n = $p_1^{e_1}\ast p_2^{e_2}\ast ...\ast p_n^{e_n}$, 又因为我们的 lcm(a, b) = n;
所以一定有 :
a = $p_1^{a_1}\ast p_2^{a_2}\ast ...\ast p_n^{a_n}$
b = $p_1^{b_1}\ast p_2^{b_2}\ast ...\ast p_n^{b_n}$
并且 $a_i\le e_i,b_i\le e_i$，但是$a_i和b_i$,没有特定的大小关系；
即由<1> 得到：

$$p_1^{e_1}\ast p_2^{e_2}\ast ...\ast p_n^{e_n}=\frac{p_1^{a_1+b_1}\ast p_2^{a_2+b_2}\ast ....\ast p_n^{a_n+b_n}}{p_1^{min(a_1+b_1)}\ast p_2^{min(a_2+b_2)}\ast ...\ast p_n^{min(a_n+b_n)}}$$
所以我们这儿就涉及到组合问题了，所以对每个n的因子$p_i$都有$2\ast (e_i+1)-1$种情况(我们确定a,b其中一个$p_i$的因子为$e_i次方所以另外一个就有e_i种选择了$减一是因为$a_i=b_i=e_i$的情况算了两遍)

#include<bits/stdc++.h>

#define IOS ios::sync_with_stdio(false);cin.tie(nullptr)
#define int long long 

using namespace std;

const int N = 2e5 + 10;

int h[N], idx, ans = 1;
bool f = 0, st[N];

vector<int> v;

int gcd(int a, int b)
{
	return b ? gcd(b, a % b) : a;
}

int lcm(int a, int b)
{
	return a * b / gcd(a, b);
}

struct node
{
	int u, v;
}e[N];

void add(int u, int v)
{
	e[++idx].v = v;
	e[idx].u = h[u];
	h[u] = idx;
}

void dfs(int u)
{
	if (st[u])
	{
		f = 1;
		int res = v.size();
		if (v[0] != u) { cout << -1 << endl; exit(0); }
		if (res % 2 == 0) res /= 2;
		ans = lcm(ans, res);
		return;
	}
	st[u] = 1;
	v.push_back(u);
	for (int i = h[u]; i; i = e[i].u)
	{
		int s = e[i].v;
		dfs(s);
	}
	v.pop_back();
}


signed main()
{
	IOS;
	int n, m;
	cin >> n;
	m = n;
	for (int i = 1; i <= n; i++)
	{
		int x;
		cin >> x;
		if (x == i) { m--; continue; }
		add(i, x);
	}
	if (m == 0) { cout << 1 << endl; return 0;}
	for (int i = 1; i <= n; i++)
	{
		if (!st[i]) dfs(i);
	}
	if (!f) ans = -1;
	cout << ans << endl;
	return 0;
}