https://111qqz.com/en/tags/lucas%E5%AE%9A%E7%90%86/Recent content in Lucas定理 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzThu, 03 Mar 2016 11:50:32 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-03-03-hdu3929/Thu, 03 Mar 2016 11:50:32 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-03-03-hdu3929/<p>题意：F(x) = (1+x)^a1 + (1+x)^a2 + … + (1+x)^am，求系数是奇数的项的个数。 思路：<a href="http://blog.csdn.net/qian99/article/details/22692443" target="_blank" rel="noreferrer">解题报告</a> 涉及到的由lucas定理得到的推论的证明<a href="http://blog.csdn.net/qian99/article/details/22691571" target="_blank" rel="noreferrer">lucas定理证明</a> 以及这篇理解里有递归形式的容斥定理的一般写法。。<a href="http://www.acmerblog.com/hdu-3929-big-coefficients-6931.html" target="_blank" rel="noreferrer">递归形式的容斥定理</a></p>https://111qqz.com/en/post/acm-icpc/2016/2016-03-02-cf451e/Wed, 02 Mar 2016 13:41:51 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-03-02-cf451e/<p><a href="http://codeforces.com/problemset/problem/451/E" target="_blank" rel="noreferrer">http://codeforces.com/problemset/problem/451/E</a> 题意;有n个花坛，要选s支花，每个花坛有f[i]支花，同一个花坛的花颜色相同，不同花坛的花颜色不同，问说可以有多少种组合。 思路：典型的母函数&hellip;然而s有点大，根据泰勒展开什么的&hellip;先转一下官方题解。</p>https://111qqz.com/en/post/acm-icpc/2015/2015-08-18-codeforces560e-geraldandgiantchessdplucase5ae9ae79086e6b182e5a4a7e7bb84e59088e695b0modppe4b8bae8b4a8e695b0/Tue, 18 Aug 2015 11:36:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-08-18-codeforces560e-geraldandgiantchessdplucase5ae9ae79086e6b182e5a4a7e7bb84e59088e695b0modppe4b8bae8b4a8e695b0/<p>dp方程想错了.果然还是欠练啊.</p> <p>如果我们不考虑坏点,那么从 (0,0)到(x,y)的方案数是c(x+y,x)或者c(x+y,y)</p>