王小二的博客

PermutationsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3205 Accepted: 1744DescriptionWe remind that the permutation of some final set is a one-to

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

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

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

题目链接 大神题解： 分别考虑旋转和翻转的情况，并计算等价类的个数sum1,sum2： 1.旋转： 置换有n种：不旋转(转0位)，转1位，…，转n-1位，若转i位，则有gcd(n,i)个等价类 证明之： (gcd:最大公约数，lcm:最小公倍数) 将珠子从0到n-1标号，对于旋转i位的置换，在以0号为起点，长度为t的一个循环节中，元素标号为：0,i%n