clover_hxy的博客

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

1488: [HNOI2009]图的同构Time Limit: 10 Sec  Memory Limit: 64 MBSubmit: 535  Solved: 344[Submit][Status][Discuss]Description求两两互不同构的含n个点的简单图有多少种。简单图是关联一对顶点的无向边不多于一条的不含自环的图。a图与b图被认为是同构的是指a图的

题目描述传送门题目大意： 用c种颜色给一个n*n的矩阵染色，问有多少种本质不同的方案。即旋转，翻转后相同的算同一种方案。题解不想写高精度，所以就直接找标算拍了拍小数据。。。。 先引入置换常用的两个引理： Burnside引理：记C(f)C(f)为在置换ff下保持不变的着色方案数，本质不同的着色方案数为所有置换f的C(f)C(f)值的平均数。 设置换群GG作用于有限集合XX上，则XX在GG作用

Leonardo's NotebookTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2158 Accepted: 956Description— I just bought Leonardo's secret notebook! Rare object

1025: [SCOI2009]游戏Time Limit: 1 Sec  Memory Limit: 162 MBSubmit: 2144  Solved: 1402[Submit][Status][Discuss]Description　　windy学会了一种游戏。对于1到N这N个数字，都有唯一且不同的1到N的数字与之对应。最开始windy把数字按顺序1，2，3，……

The shuffle ProblemTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 2115 Accepted: 702DescriptionAny case of shuffling of n cards can be described with a

Birthday ToyTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 747    Accepted Submission(s): 388Problem DescriptionAekdyCoin loves toy

Magic BraceletTime Limit: 2000MS Memory Limit: 131072KTotal Submissions: 5403 Accepted: 1752DescriptionGinny’s birthday is coming soon. Harry Potter is preparing

1998: [Hnoi2010]Fsk物品调度Time Limit: 10 Sec  Memory Limit: 259 MBSubmit: 444  Solved: 212[Submit][Status][Discuss]Description现在找工作不容易，Lostmonkey费了好大劲才得到fsk公司基层流水线操作员的职位。流水线上有n个位置，从0到n-1依次编号，

CipherTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21044 Accepted: 5769DescriptionBob and Alice started to use a brand-new encoding scheme. Surprisin

Cow SortingTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6768 Accepted: 2642DescriptionFarmer John's N (1 ≤ N ≤ 10,000) cows are lined up to be milked

1119: [POI2009]SLOTime Limit: 30 Sec  Memory Limit: 162 MBSubmit: 557  Solved: 268[Submit][Status][Discuss]Description对于一个1-N的排列(ai)，每次你可以交换两个数ax与ay(xInput第一行N。第二行N个数表示wi。第三行N个数表示a

CARDSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1776 Accepted: 916DescriptionAlice and Bob have a set of N cards labelled with numbers 1 ... N (so

1106 篝火晚会 2005年NOIP全国联赛提高组 时间限制: 1 s 空间限制: 128000 KB 题目等级 : 大师 Master题解 查看运行结果题目描述 Description佳佳刚进高中，在军训的时候，由于佳佳吃苦耐劳，很快得到了教官的赏

Necklace of BeadsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7571 Accepted: 3152DescriptionBeads of red, blue or green colors are connected together

ColorTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9261 Accepted: 3009DescriptionBeads of N colors are connected together into a circular necklace of

Let it BeadTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5387 Accepted: 3601Description"Let it Bead" company is located upstairs at 700 Cannery Row in

1004: [HNOI2008]CardsTime Limit: 10 Sec  Memory Limit: 162 MBSubmit: 2800  Solved: 1672[Submit][Status][Discuss]Description　　小春现在很清闲,面对书桌上的N张牌,他决定给每张染色,目前小春只有3种颜色:红色,蓝色,绿色.他询问Sun有多少种染色方案

1815: [Shoi2006]color 有色图Time Limit: 4 Sec  Memory Limit: 64 MBSubmit: 212  Solved: 102[Submit][Status][Discuss]DescriptionInput输入三个整数N,M,P 1Output即总数模P后的余数Sample Inputin