组合数学
文章平均质量分 68
Ritchie丶
这个作者很懒,什么都没留下…
展开
-
HDU2067卡特兰数
小兔的棋盘 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8819 Accepted Submission(s): 4595 Problem Description 小兔的叔叔从外面旅游回来给她带来了一个礼物,小兔高兴地跑原创 2016-05-24 10:18:26 · 246 阅读 · 0 评论 -
HDU1130 卡特兰数
How Many Trees? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3397 Accepted Submission(s): 1964 Problem Description A binary search tr原创 2016-05-24 10:17:35 · 306 阅读 · 0 评论 -
HDU 1023 Train Problem II (卡特兰数)
Train Problem II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7741 Accepted Submission(s): 4168 Problem Description As we all know th原创 2016-05-24 10:15:11 · 224 阅读 · 0 评论 -
HDU 1521 排列组合 指数型母函数
排列组合 Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u Submit Status Description 有n种物品,并且知道每种物品的数量。要求从中选出m件物品的排列数。例如有两种物品A,B,并且数量都是1,从中选2件物品,则排列有"原创 2016-05-24 10:12:53 · 274 阅读 · 0 评论 -
HDU 2082 母函数模板题
找单词 Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u Submit Status Description 假设有x1个字母A, x2个字母B,..... x26个字母Z,同时假设字母A的价值为1,字母B的价值为2,..... 字母Z的价值原创 2016-05-24 10:12:44 · 205 阅读 · 0 评论 -
HDU 1023 Traning Problem (2) 大数卡特兰数
Train Problem II Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u Submit Status Description As we all know the Train Problem I, the boss of the I原创 2016-05-24 10:12:49 · 201 阅读 · 0 评论 -
E sum
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=110042#problem/E 密码nefu #include #include using namespace std; const int MAXN = 1e5+5; const int MOD = 1e9+7; typedef long lo原创 2016-05-24 10:12:34 · 276 阅读 · 0 评论