C programming is a craft that takes years to perfect. A reasonably sharp person can learn the basics of C quite quickly. But it takes much longer to master the nuances of the language and to write enough programs, and enough different programs, to b
题目链接：点击查看
题目大意：首先给出一个 1 ~ n 的排列，用 p 数组表示，再给出给个点的颜色，用 c 数组表示
然后抛出Infinite Path的定义：对于某个 i ，p[ i ] , p[ p[ i ] ] , p[ p[ p[ i ] ] ] 无限嵌套下去，且每个位置的颜色相同，即 c[ i ] = c[ p[ i ] ] = c[ p[ p[ i ] ] ] = c[ p[ p[ p[ i ] ] ] ] 等等等等
下面重载一下排列的乘法运算，假如 a 和 b 是 1 ~ n 的
