组合数学 - 随笔分类 - 雄..

hdu 5072 计数+容斥原理

摘要：/*题意：给出n个数（n#include #include using namespace std;typedef __int64 LL;const int maxn=1000;int prime[maxn],flag[maxn],num;int numc[maxn*100+5],f[maxn*1... 阅读全文

posted @ 2014-11-28 02:55 雄.. 阅读(248) 评论(0) 推荐(0)

spoj 7001 Visible Lattice Points莫比乌斯反演

摘要：Visible Lattice PointsTime Limit:7000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusDescriptionConsider a N*N*N lattice. One corner is at (0... 阅读全文

posted @ 2014-07-18 22:10 雄.. 阅读(197) 评论(0) 推荐(0)

hud 4746 莫比乌斯反演

摘要：MophuesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 327670/327670 K (Java/Others)Total Submission(s): 579Accepted Submission(s): 235Problem Des... 阅读全文

posted @ 2014-07-16 21:54 雄.. 阅读(242) 评论(0) 推荐(0)

hdu 1695 容斥原理或莫比乌斯反演

摘要：GCDTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5310Accepted Submission(s): 1907Problem Descrip... 阅读全文

posted @ 2014-07-16 20:21 雄.. 阅读(275) 评论(0) 推荐(0)

摘要：PartitionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2362Accepted Submission(s): 937Problem DescriptionDefine f(n) as the number of ways to perform n in format of the sum of some positive integers. For instance, when n=4, we have4=1+1+1+14=1+1+ 阅读全文

posted @ 2014-04-01 19:09 雄.. 阅读(442) 评论(0) 推荐(0)

uva 10870 递推关系矩阵快速幂模

摘要：Recurrences Input:standard input Output:standard outputConsider recurrent functions of the following form:f(n) = a1f(n - 1) + a2f(n - 2) + a3f(n - 3) + ... + adf(n - d), for n > d. a1, a2, ..., ad- arbitrary constants.A famous example is the Fibonacci sequence, defined as: f(1) = 1, f(2) = 1, f(n 阅读全文

posted @ 2013-09-04 15:52 雄.. 阅读(221) 评论(0) 推荐(0)

polya burnside 专题

摘要：polya题目：uva 11077 Find the Permutationsuva 10294 Arif in DhakaLA 3641 Leonardo's Notebookuva 11077 Find the PermutationsHOJ 2084 The Colored CubesHOJ 2647 Megaminx POJ 1286 Necklace of BeadsPOJ 2409 Let it BeadTOJ 2795 The Queen's New NecklacesHDU 1812 Count the TetrisUVa 11255 NecklacePOJ 2 阅读全文

posted @ 2013-08-16 20:49 雄.. 阅读(478) 评论(1) 推荐(0)

随笔分类 - 组合数学