![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数论
文章平均质量分 72
ACM_Ted
正在加油的火箭。
展开
-
【置换群】 poj2369 Permutations
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原创 2012-08-30 01:07:35 · 1043 阅读 · 0 评论 -
【数论】Non-Decreasing Digit
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原创 2012-04-02 18:55:03 · 1151 阅读 · 1 评论 -
【数论】Super Josephus
Super JosephusTime Limit: 1000 ms Case Time Limit: 1000 ms Memory Limit: 64 MBTotal Submission: 41 Submission Accepted: 7DescriptionJosephus问题的大概是N个人围成圆圈,顺时针编号分别为1到N,从第一个开始报数,第原创 2012-04-08 23:02:36 · 500 阅读 · 0 评论