![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
置换群【polya】
UCAS王小二
不念过去,不畏未来...
展开
-
poj 2369 Permutations【简单置换群*详解】
PermutationsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3205 Accepted: 1744DescriptionWe remind that the permutation of some final set is a one-to原创 2017-07-26 20:25:52 · 388 阅读 · 0 评论 -
poj 1026 Cipher【置换群*循环节】
Cipher Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 22118 Accepted: 6114 DescriptionBob and Alice started to use a brand-new encoding scheme. Surprisingly it is not a Publi原创 2017-07-27 19:45:29 · 432 阅读 · 0 评论 -
hdu 6038 Function【置换群进阶】
FunctionTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1389 Accepted Submission(s): 644Problem Description You are given a permutation原创 2017-07-28 10:19:51 · 504 阅读 · 0 评论 -
1166 Sorting LightOJ【置换群基础】
Given an array containing a permutation of 1 to n, you have to find the minimum number of swaps to sort the array in ascending order. A swap means, you can exchange any two elements of the array.For ex原创 2017-07-28 11:03:52 · 353 阅读 · 0 评论 -
UVA - 10294【polya】
题目链接 大神题解: 分别考虑旋转和翻转的情况,并计算等价类的个数sum1,sum2: 1.旋转: 置换有n种:不旋转(转0位),转1位,…,转n-1位,若转i位,则有gcd(n,i)个等价类 证明之: (gcd:最大公约数,lcm:最小公倍数) 将珠子从0到n-1标号,对于旋转i位的置换,在以0号为起点,长度为t的一个循环节中,元素标号为:0,i%n原创 2017-07-28 13:55:28 · 302 阅读 · 0 评论