Ted's 游乐园

Permutations题目：http://poj.org/problem?id=2369题意：题解：置换群。求子循环节的长度，然后求其最小公倍数。代码：#include#includeusing namespace std;int ans[1005];bool visit[1005];int gcd(int x,int b){ int c; f

DescriptionA number is said to be made up of non-decreasing digits if all the digits to the left of any digit is lessthan or equal to that digit. For example, the four-digit number 1234 is compo

Super JosephusTime Limit: 1000 ms   Case Time Limit: 1000 ms   Memory Limit: 64 MBTotal Submission: 41   Submission Accepted: 7DescriptionJosephus问题的大概是N个人围成圆圈，顺时针编号分别为1到N，从第一个开始报数，第