Polya定理
菜圾
Hi, it's your Accepted !
展开
-
POJ - 2409 - Let it Bead - (Polya定理)
Description "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 custom原创 2018-01-03 20:03:53 · 320 阅读 · 0 评论 -
HDU - 3923 - Invoker - (Polya定理,除法求逆元)
Problem Description 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 ch原创 2018-01-05 19:43:25 · 317 阅读 · 0 评论 -
Polya定理
涉及的概念有群,置换,置换群,循环,循环节数。 首先可以把群理解为可以满足一定条件和运算的集合。 置换:[1,n]到自身的1-1变换:[1,n]—>[1,n],p: i —> ai , (ai != aj, i != j),即a1...an是[1,n]的一个全排列。可以表示为: 循环:循环是用来表示置换的,一个循环(a1a2...am)表示固定的置换形式: 而且有定理:原创 2018-01-05 16:04:56 · 653 阅读 · 0 评论 -
POJ - 2154 Color - (Ploya定理,欧拉函数,1~n的gcd(n,i)之和)
Description 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 ...原创 2018-01-08 22:04:05 · 572 阅读 · 0 评论 -
POJ2154(Pólya定理与欧拉函数优化)
不错的Polya题目,有两篇博客给了两个不同的思路,但最终公式都相同代码也相同 题意:给出两个整数n和p,代表n个珠子,n种颜色,要求不同的项链数,翻转置换不考虑。结果模p. 题解: 基本知识:共有n种置换(都是旋转置换),每种置换循环节的个数为gcd(n , i) , 对应循环节长度为L=n / gcd(n , i)(旋转置换中的所有循环节的长度相同)其中i为转的位置数。 普...转载 2018-01-30 10:33:25 · 272 阅读 · 0 评论