组合数学
组合数学
王江奎
这个作者很懒,什么都没留下…
展开
-
UVa12633-Super Rooks on Chessboard-容斥+FFT
题目大意就是给你一个R*C的棋盘,上面有超级兵,这种超级兵会攻击 同一行、同一列、同一主对角线的所有元素,现在给你N个超级兵的坐标,需要你求出有多少方块是不能被攻击到的(R,C,N<50000)遇到这种计数问题就要联想到容斥(组合数学太重要了),由容斥原理:被攻击的方块数=行被攻击的方块数+列被攻击的方块数+主对角线被攻击的方块数-同时被行、列攻击的方块数-同时被行、对角线攻击的方块...原创 2020-01-14 09:29:24 · 185 阅读 · 0 评论 -
HDU4609 3-idiots-FFT
King OMeGa catched three men who had been streaking in the street. Looking as idiots though, the three men insisted that it was a kind of performance art, and begged the king to free them. Out of hat...原创 2020-01-13 13:56:01 · 220 阅读 · 0 评论 -
POJ 3370 Halloween treats——鸽巢原理+思维
【题目描述】POJ 3370 Halloween treatsDescriptionEvery year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that day, no matter how many ...原创 2019-08-13 16:25:07 · 230 阅读 · 0 评论 -
HDU - 1796——容斥原理+二进制枚举
【题目描述】Now you get a number N, and a M-integers set, you should find out how many integers which are small than N, that they can divided exactly by any integers in the set. For example, N=12, and M-in...原创 2019-08-14 16:10:52 · 224 阅读 · 0 评论 -
HDU - 1028——母函数入门
【题目描述】“Well, it seems the first problem is too easy. I will let you know how foolish you are later.” feng5166 says.“The second problem is, given an positive integer N, we define an equation like thi...原创 2019-08-15 11:33:13 · 364 阅读 · 0 评论