#include<bits/stdc++.h>
using namespace std;
int n;
vector<int> num;
vector<int> cop;
vector<int> turn;
vector<long long> l;
long long gcd(long long a, long long b)
{
if (a % b == 0)
return b;
return gcd(b, a % b);
}
long long lcm(long long a, long long b)
{
return a * b / gcd(a, b);
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++)
{
int k;
cin >> k;
num.push_back(k);
}
turn = num;
//run(num, 1);
for (int i = 1; i <= n; i++)
{
l.push_back(1);
while (turn[i - 1] != i)
{
turn[i - 1] = num[turn[i - 1] - 1];
l[i - 1]++;
}
}
for (int i = 1; i < n; i++)
l[i] = lcm(l[i - 1], l[i]);
cout << l[n - 1];
return 0;
}
timus 1024
于 2022-01-18 14:11:28 首次发布