题库练习 Idempotent functions
← 上一题 下一题 →

A9955 | Idempotent functions

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Some time ago Leonid have known about idempotent functions. Idempotent function defined on a set ${1,2,...,n}$ is such function ![](/uploads/luogu/CF542C/bd89689373264189cd84dae0d69467be68ca323b_f6e90e34634e.png), that for any ![](/uploads/acgo/image/ac28cb67c5081b9d_dc4f6b1e566e.jpeg) the formula $g(g(x))=g(x)$ holds.

Let's denote as $f^{(k)}(x)$ the function $f$ applied $k$ times to the value $x$ . More formally, $f^{(1)}(x)=f(x)$ , $f^{(k)}(x)=f(f^{(k-1)}(x))$ for each $k>1$ .

You are given some function ![](/uploads/acgo/image/ac58f2398d7db737_320f797058c9.jpeg). Your task is to find minimum positive integer $k$ such that function $f^{(k)}(x)$ is idempotent.

输入格式

In the first line of the input there is a single integer $n$ ( $1<=n<=200$ ) — the size of function $f$ domain.

In the second line follow $f(1),f(2),...,f(n)$ ( $1<=f(i)<=n$ for each $1<=i<=n$ ), the values of a function.

输出格式

Output minimum $k$ such that function $f^{(k)}(x)$ is idempotent.

输入输出样例

输入 #1
4
1 2 2 4
输出 #1
1
输入 #2
3
2 3 3
输出 #2
2
输入 #3
3
2 3 1
输出 #3
3
C++ 编辑器
输入
输出