<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>泰勒展开 on 111qqz's blog</title><link>https://111qqz.com/en/tags/%E6%B3%B0%E5%8B%92%E5%B1%95%E5%BC%80/</link><description>Recent content in 泰勒展开 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Wed, 02 Mar 2016 13:41:51 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E6%B3%B0%E5%8B%92%E5%B1%95%E5%BC%80/index.xml" rel="self" type="application/rss+xml"/><item><title>codeforces 451E Devu and Flowers (指数型母函数)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-03-02-cf451e/</link><pubDate>Wed, 02 Mar 2016 13:41:51 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-03-02-cf451e/</guid><description>&lt;p&gt;&lt;a href="http://codeforces.com/problemset/problem/451/E" target="_blank" rel="noreferrer"&gt;http://codeforces.com/problemset/problem/451/E&lt;/a&gt;
题意;有n个花坛，要选s支花，每个花坛有f[i]支花，同一个花坛的花颜色相同，不同花坛的花颜色不同，问说可以有多少种组合。
思路：典型的母函数&amp;hellip;然而s有点大，根据泰勒展开什么的&amp;hellip;先转一下官方题解。&lt;/p&gt;</description></item><item><title>poj 3734 Blocks (指数型母函数，泰勒级数展开)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-02-28-poj-3734/</link><pubDate>Sun, 28 Feb 2016 06:37:08 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-02-28-poj-3734/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=3734" target="_blank" rel="noreferrer"&gt;http://poj.org/problem?id=3734&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意+思路同******&lt;a href="https://111qqz.com/en/post/acm-icpc/2016/2016-02-28-hdu2065/" &gt;hdu2065红色病毒解题报告&lt;/a&gt;&lt;/p&gt;</description></item><item><title>hdu 2065 "红色病毒"问题 (指数型母函数，泰勒级数展开)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-02-28-hdu2065/</link><pubDate>Sun, 28 Feb 2016 06:26:51 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-02-28-hdu2065/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=2065" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=2065&lt;/a&gt;
题意：a,b,c,d四种元素，a,c只能出现偶数次（包括0次），b,d没有限制，问n个（2^64）个元素有多少种不同的组合。
思路：指数型母函数。。。n大的没办法用之前的办法做。&lt;/p&gt;</description></item></channel></rss>