poj 2369 Permutations 【置换群】
来源:互联网 发布:知之深爱之切全书内容 编辑:程序博客网 时间:2024/06/07 16:54
Permutations
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2844 Accepted: 1512
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."
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 109.
Sample Input
54 1 5 2 3
Sample Output
6
题意:给定n个元素的序列a[],一次变换后a[i] = a[a[i]],问经过多少次变换使得序列变回原来的样子。
思路:赤裸裸的置换群,求出所有群的周期,取最小公倍数就可以了。
AC代码:
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <cstdlib>#include <algorithm>#include <queue>#include <stack>#include <map>#include <set>#include <vector>#include <string>#define INF 0x3f3f3f3f#define eps 1e-8#define MAXN (1000+10)#define MAXM (200000+10)#define Ri(a) scanf("%d", &a)#define Rl(a) scanf("%lld", &a)#define Rf(a) scanf("%lf", &a)#define Rs(a) scanf("%s", a)#define Pi(a) printf("%d\n", (a))#define Pf(a) printf("%.2lf\n", (a))#define Pl(a) printf("%lld\n", (a))#define Ps(a) printf("%s\n", (a))#define W(a) while(a--)#define CLR(a, b) memset(a, (b), sizeof(a))#define MOD 1000000007#define LL long long#define lson o<<1, l, mid#define rson o<<1|1, mid+1, r#define ll o<<1#define rr o<<1|1#define PI acos(-1.0)using namespace std;int gcd(int a, int b){ return b == 0 ? a : gcd(b, a%b);}int lcm(int a, int b){ return a / gcd(a, b) * b;}int a[MAXN]; bool vis[MAXN];int main(){ int n; while(Ri(n) != EOF) { for(int i = 1; i <= n; i++) Ri(a[i]); int ans = 1; CLR(vis, false); for(int i = 1; i <= n; i++) { if(vis[i]) continue; vis[i] = true; int j = a[i]; int cnt = 1; while(i != j) { cnt++; j = a[j]; } ans = lcm(ans, cnt); } Pi(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 置换水题
- c++练习守护注册表服务程序
- NSSearchPathForDirectoriesInDomains和NSHomeDirectory
- 通过自定义theme来改变Activity之间切换动画
- python 学习
- UICollectionView执行performBatchUpdates 奔溃
- poj 2369 Permutations 【置换群】
- AFNetworking Post 请求
- CSS常用属性:
- Servlet 生命周期、工作原理
- android多线程断点续传下载
- 低功耗蓝牙4.0BLE编程-nrf51822开发(2)
- iOS开发的一些奇巧淫技
- python搭建虚拟环境
- HTML5调用手机摄像头