<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[SDFZspli的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/SDFZspli</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; SDFZspli]]></copyright><item><title><![CDATA[莫比乌斯反演与其前置技能]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/80033483</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/80033483</guid><author>SDFZspli</author><pubDate>Sat, 21 Apr 2018 20:58:30 +0800</pubDate><description><![CDATA[质数·积性函数·筛法



质数

\\



定义

大于 1 的、只被 1 和它本身整除的正整数

\\



唯一分解定理

对于正整数 n，我们一定可以将其写为若干个质数的幂的乘积形式

即 
n=∏paiin=∏piai
n=\prod p_i^{a_i}
 
其中pipip_i是质数

同时该分解是唯一的

\\



积性函数

\\



数论函数

若有函数f(n)f(n) f(...]]></description><category></category></item><item><title><![CDATA[关于最小生成树的一些性质]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/78583734</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/78583734</guid><author>SDFZspli</author><pubDate>Mon, 20 Nov 2017 16:40:50 +0800</pubDate><description><![CDATA[。]]></description><category></category></item><item><title><![CDATA[poj 2104 K-th Number （主席树模板）]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/78564487</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/78564487</guid><author>SDFZspli</author><pubDate>Fri, 17 Nov 2017 19:02:47 +0800</pubDate><description><![CDATA[主席树模板]]></description><category></category></item><item><title><![CDATA[树状数组 区间修改 差分]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/78434383</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/78434383</guid><author>SDFZspli</author><pubDate>Fri, 03 Nov 2017 12:56:29 +0800</pubDate><description><![CDATA[模板]]></description><category></category></item><item><title><![CDATA[树状数组单点修改区间查询]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/78434333</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/78434333</guid><author>SDFZspli</author><pubDate>Fri, 03 Nov 2017 12:43:09 +0800</pubDate><description><![CDATA[树状数组单点修改区间查询]]></description><category></category></item><item><title><![CDATA[矩阵快速幂]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/78430762</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/78430762</guid><author>SDFZspli</author><pubDate>Fri, 03 Nov 2017 00:00:53 +0800</pubDate><description><![CDATA[模板]]></description><category></category></item><item><title><![CDATA[高精度 <加减乘除>]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/78429796</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/78429796</guid><author>SDFZspli</author><pubDate>Thu, 02 Nov 2017 21:49:14 +0800</pubDate><description><![CDATA[模板]]></description><category></category></item><item><title><![CDATA[（洛谷 最小费用最大流 模板）]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/78406175</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/78406175</guid><author>SDFZspli</author><pubDate>Tue, 31 Oct 2017 17:52:10 +0800</pubDate><description><![CDATA[模板]]></description><category></category></item><item><title><![CDATA[（poj 2248 Addition Chains）<DFS+剪枝>]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/77940318</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/77940318</guid><author>SDFZspli</author><pubDate>Tue, 12 Sep 2017 00:04:22 +0800</pubDate><description><![CDATA[只要预处理一个数组 
数组b[i]表示当前数列最大值为i时，还需要的最小长度]]></description><category></category></item><item><title><![CDATA[（noip 2013 华容道）<搜索>]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/77924293</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/77924293</guid><author>SDFZspli</author><pubDate>Sun, 10 Sep 2017 19:37:38 +0800</pubDate><description><![CDATA[状态表示bfs]]></description><category></category></item><item><title><![CDATA[（noip 模拟 flower 种花）<贪心+后悔>]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/77914553</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/77914553</guid><author>SDFZspli</author><pubDate>Sat, 09 Sep 2017 13:14:01 +0800</pubDate><description><![CDATA[后悔的正确姿势]]></description><category></category></item><item><title><![CDATA[（noip 2015 斗地主）<搜索+贪心>]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/77900785</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/77900785</guid><author>SDFZspli</author><pubDate>Sat, 09 Sep 2017 00:25:28 +0800</pubDate><description><![CDATA[传送门Solution有一个性质：如果把所有的串按某种方式打完，剩下的牌用贪心就可以完美解决 
对于剩下的牌，打出的顺序应该是：4+2，4+1，3+2，3+1，最后再把单牌，对牌这些无脑打出 
没有串的话，可以证明先出张数多的牌一定更优 
但是有串的话未必，比如单串最多能连10张，但是如果只打9张，剩下的一张也许可以和其它牌组成双串 
因此用dfs枚举所有出串的方式，对于每一种方式贪心地计算剩下的牌]]></description><category></category></item><item><title><![CDATA[（zoj 2412 Farm Irrigation）<SB并查集>]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/77883700</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/77883700</guid><author>SDFZspli</author><pubDate>Thu, 07 Sep 2017 16:44:26 +0800</pubDate><description><![CDATA[细节与代码粘贴技术]]></description><category></category></item><item><title><![CDATA[（poj 1020 Anniversary Cake）<DFS的巧妙剪枝>]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/77860328</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/77860328</guid><author>SDFZspli</author><pubDate>Wed, 06 Sep 2017 00:37:28 +0800</pubDate><description><![CDATA[巧妙剪枝]]></description><category></category></item><item><title><![CDATA[Ferguson博弈]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/77460982</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/77460982</guid><author>SDFZspli</author><pubDate>Mon, 21 Aug 2017 21:52:01 +0800</pubDate><description><![CDATA[博弈论，归纳法证明]]></description><category></category></item><item><title><![CDATA[（zoj 3882 Help Bob）<>]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/77460684</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/77460684</guid><author>SDFZspli</author><pubDate>Mon, 21 Aug 2017 21:23:41 +0800</pubDate><description><![CDATA[博弈论入门]]></description><category></category></item><item><title><![CDATA[<模板>计算SG函数-（hdu 1848 Fibonacci again and again）]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/77450869</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/77450869</guid><author>SDFZspli</author><pubDate>Mon, 21 Aug 2017 15:59:25 +0800</pubDate><description><![CDATA[SG 模板]]></description><category></category></item><item><title><![CDATA[（bzoj 1085 [SCOI2005]骑士精神）<A*>]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/77431900</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/77431900</guid><author>SDFZspli</author><pubDate>Sun, 20 Aug 2017 19:35:54 +0800</pubDate><description><![CDATA[A*]]></description><category></category></item><item><title><![CDATA[（poj 2449 Remmarguts' Date）<A*-K短路模板>]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/77422341</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/77422341</guid><author>SDFZspli</author><pubDate>Sun, 20 Aug 2017 07:45:15 +0800</pubDate><description><![CDATA[模板]]></description><category></category></item><item><title><![CDATA[（poj 3322 Bloxorz I）<爆搜？>]]></title><link>https://blog.youkuaiyun.com/SDFZspli/article/details/77413451</link><guid>https://blog.youkuaiyun.com/SDFZspli/article/details/77413451</guid><author>SDFZspli</author><pubDate>Sat, 19 Aug 2017 16:13:12 +0800</pubDate><description><![CDATA[bfs+可靠的状态表示]]></description><category></category></item></channel></rss>