POJ 2369 - Permutations 【置换群】
来源:互联网 发布:乐清知临公立宿舍学校 编辑:程序博客网 时间:2024/06/05 02:04
Permutations
Time Limit: 1000MS Memory Limit: 65536KB
Description:
We remind that the permutation of some final set is a one-to-one mapping of the set onto itself. Less formally, that is a way to reorder elements of the set. For example, one can define a permutation of the set {1,2,3,4,5} as follows:
This record defines a permutation P as follows: P(1) = 4, P(2) = 1, P(3) = 5, etc.
What is the value of the expression P(P(1))? It’s clear, that P(P(1)) = P(4) = 2. And P(P(3)) = P(5) = 3. One can easily see that if P(n) is a permutation then P(P(n)) is a permutation as well. In our example (believe us)
It is natural to denote this permutation by P2(n) = P(P(n)). In a general form the defenition is as follows: P(n) = P1(n), Pk(n) = P(Pk-1(n)). Among the permutations there is a very important one — that moves nothing:
It is clear that for every k the following relation is satisfied: (EN)k = EN. The following less trivial statement is correct (we won't prove it here, you may prove it yourself incidentally): Let P(n) be some permutation of an N elements set. Then there exists a natural number k, that Pk = EN. The least natural k such that Pk = EN is called an order of the permutation P.
The problem that your program should solve is formulated now in a very simple manner: "Given a permutation find its order."
Input:
In the first line of the standard input an only natural number N (1 <= N <= 1000) is contained, that is a number of elements in the set that is rearranged by this permutation. In the second line there are N natural numbers of the range from 1 up to N, separated by a space, that define a permutation — the numbers P(1), P(2),…, P(N).
Output:
You should write an only natural number to the standard output, that is an order of the permutation. You may consider that an answer shouldn't exceed 10 9.
Sample Input
54 1 5 2 3
Sample Output
6
#include <stdio.h>#include <algorithm>#include <string.h>#include <math.h>#include <iostream>using namespace std;int mem[1005], mark[1005];int gcd(int a, int b){ return b == 0 ? a : gcd(b,a%b);}int lcm(int a, int b){ return a * b / gcd(a,b);}int main(){ int n; while(~scanf("%d",&n)) { memset(mark,0,sizeof(mark)); for(int i = 1; i <= n; i++) scanf("%d",&mem[i]); int ans = 1, flag; for(int i = 1; i <= n; i++) { int num = 0; flag = i; while(!mark[flag]) { num++; mark[flag] = 1; flag = mem[flag]; } if(num) ans = lcm(ans,num); } printf("%d\n",ans); } return 0;}
0 0
- poj 2369 Permutations(置换群)
- poj 2369 Permutations (置换群)
- POJ 2369 - Permutations 【置换群】
- POJ 2369 Permutations (置换群)
- POJ 2369 Permutations 置换群
- poj 2369 Permutations 【置换群】
- POJ 2369 Permutations (置换群)
- POJ 2369 Permutations 【置换群】
- POJ 2369 Permutations【置换群】
- POJ 2369 Permutations(置换)
- 【POJ 2369】Permutations(置换群)
- 【POJ】2369 - Permutations(置换群)
- poj 2369 Permutations (置换群入门)
- poj 2369 Permutations【简单置换群*详解】
- poj 2369 Permutations(置换)
- [ACM] poj 2369 Permutations (置换群循环节长度)
- poj 2369-Permutations置换及其应用
- poj 2369 Permutations 置换水题
- java web经验小结
- LeetCode OJ 之 Valid Anagram
- HDU 5327(2015多校4)-Olympiad(水题)
- verilog中的向量与数组
- 编程之美:第二章 数字之魅 2.19区间重合判断
- POJ 2369 - Permutations 【置换群】
- 07 JAVA IO流 练习
- C语言编程入门——数组(下)
- CFile、CStdioFile、FILE和其他文件操作(转+总结)
- mac下终端命令汇总(持续更新中)
- 【排序】二分插入排序模板
- 编程之美:第二章 数字之魅 2.20程序理解和时间分析
- Bootstrap组件之具有响应式特性的嵌入内容
- Bower