
polya计数原理
coldfresh
那我们开始吧
展开
-
Color POJ - 2154 (Polya定理)(欧拉函数优化)
Beads of N colors are connected together into a circular necklace of N beads (N<=1000000000). Your job is to calculate how many different kinds of the necklace can be produced. You should know that the原创 2017-05-11 14:46:40 · 478 阅读 · 0 评论 -
Let it Bead (POJ - 2409) (polya计数原理)
题意: “Let it Bead” company is located upstairs at 700 Cannery Row in Monterey, CA. As you can deduce from the company name, their business is beads. Their PR department found out that customers are int原创 2017-05-10 16:26:54 · 439 阅读 · 0 评论 -
Different Circle Permutation HDU - 5868(burnside引理+递推+矩阵快速幂+欧拉函数)
You may not know this but it’s a fact that Xinghai Square is Asia’s largest city square. It is located in Dalian and, of course, a landmark of the city. It’s an ideal place for outing any time of the y原创 2017-09-07 13:58:35 · 458 阅读 · 0 评论 -
Invoker HDU - 3923(polya)
On of Vance’s favourite hero is Invoker, Kael. As many people knows Kael can control the elements and combine them to invoke a powerful skill. Vance like Kael very much so he changes the map to make Ka原创 2017-09-08 13:56:08 · 333 阅读 · 0 评论 -
Necklace UVA - 11255(polya计数)
传送门 题目大意是给你三种颜色并给定相应的数量,请问能组成多少种不同的环(选择,对称同构) Sample Input 2 3 2 1 2 2 2 Sample Output 6 11 颜色的个数类带有了限制,因为是对于环来说,所以其实还是比较好处理的 因为数量有了限制,所以不能单纯考虑置换的循环节的个数还要考虑循环节的数量。 先看旋转的情况,其实一直旋转后的置换的循环节的长度都原创 2017-09-08 16:40:10 · 336 阅读 · 0 评论