<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sunzz3183的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sunzz3183</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sunzz3183]]></copyright><item><title><![CDATA[高斯消元学习笔记]]></title><link>https://blog.youkuaiyun.com/sunzz3183/article/details/130660087</link><guid>https://blog.youkuaiyun.com/sunzz3183/article/details/130660087</guid><author>sunzz3183</author><pubDate>Sat, 13 May 2023 17:34:08 +0800</pubDate><description><![CDATA[高斯消元是一种求解线性方程组的方法。线性方程组就是mmm个nnn元一次方程。]]></description><category></category></item><item><title><![CDATA[0/1分数规划学习笔记]]></title><link>https://blog.youkuaiyun.com/sunzz3183/article/details/130636084</link><guid>https://blog.youkuaiyun.com/sunzz3183/article/details/130636084</guid><author>sunzz3183</author><pubDate>Fri, 12 May 2023 10:03:03 +0800</pubDate><description><![CDATA[010/10/1分数规划是指，给定整数a1a2⋯anb1b2⋯bna1​a2​⋯an​b1​b2​⋯bn​∑i1nai×xi∑i1nbi×xi∑i1n​bi​×xi​∑i1n​ai​×xi​​。]]></description><category></category></item><item><title><![CDATA[欧拉函数及欧拉定理&逆元学习笔记]]></title><link>https://blog.youkuaiyun.com/sunzz3183/article/details/130174196</link><guid>https://blog.youkuaiyun.com/sunzz3183/article/details/130174196</guid><author>sunzz3183</author><pubDate>Sat, 15 Apr 2023 19:35:13 +0800</pubDate><description><![CDATA[φn∑i1ngcd⁡ni1φni1∑n​gcdni1根据容斥可得φnn∏i1k1−1piφnni1∏k​1−pi​1​所以可得以下代码i * i <= x;i ++) if(!return res;如果d∣a−bd|(a-b)d∣a−b则我们称a≡bmodda≡bmodd对于一个整数aaa和 质数ppp。]]></description><category></category></item><item><title><![CDATA[同余问题学习笔记]]></title><link>https://blog.youkuaiyun.com/sunzz3183/article/details/130174188</link><guid>https://blog.youkuaiyun.com/sunzz3183/article/details/130174188</guid><author>sunzz3183</author><pubDate>Sat, 15 Apr 2023 19:34:42 +0800</pubDate><description><![CDATA[其中 $t=0,\pm 1,\pm 2,\pm 3,\cdots $由扩展欧几里得可得，存在两个整数。于是就可以将这两个同余方程合并为。在欧几里得算法的最后一步，即。为同余式组的一个整数解，则得。是满足同余式组的唯一正整数解。为任意一组整数解，则有。，则一切整数解可以表示成。（建议配合代码食用）]]></description><category></category></item><item><title><![CDATA[组合数学学习笔记]]></title><link>https://blog.youkuaiyun.com/sunzz3183/article/details/130174182</link><guid>https://blog.youkuaiyun.com/sunzz3183/article/details/130174182</guid><author>sunzz3183</author><pubDate>Sat, 15 Apr 2023 19:34:14 +0800</pubDate><description><![CDATA[从nnn个元素中选mmm个元素的所有情况数（无顺序），记为CnmC_{n}^{m}Cnm​。]]></description><category></category></item><item><title><![CDATA[莫比乌斯函数及其反演学习笔记]]></title><link>https://blog.youkuaiyun.com/sunzz3183/article/details/130174168</link><guid>https://blog.youkuaiyun.com/sunzz3183/article/details/130174168</guid><author>sunzz3183</author><pubDate>Sat, 15 Apr 2023 19:33:18 +0800</pubDate><description><![CDATA[μx≡1x1−1kxp1⋅p2⋅⋯⋅pk0otherwise1&x=1μx≡⎩⎨⎧​1−1k0​x1xp1​⋅p2​⋅⋯⋅pk​otherwise​线性筛OnO(n)On求，然后直接求的话也会是OnO(n)On，可以使用整数分块和前缀和来使时间优化到OnOn​。提高。]]></description><category></category></item><item><title><![CDATA[整数分块学习笔记]]></title><link>https://blog.youkuaiyun.com/sunzz3183/article/details/130174136</link><guid>https://blog.youkuaiyun.com/sunzz3183/article/details/130174136</guid><author>sunzz3183</author><pubDate>Sat, 15 Apr 2023 19:31:55 +0800</pubDate><description><![CDATA[我们会浪费很多的时间。那么，有多少段相等呢？]]></description><category></category></item></channel></rss>