<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>huxint 的博客</title><description>huxint 的个人博客，记录学到的东西和日常生活。</description><link>https://huxint.github.io/</link><language>zh-CN</language><item><title>Transformer：理解 Attention Is All You Need</title><link>https://huxint.github.io/posts/transformer/</link><guid isPermaLink="true">https://huxint.github.io/posts/transformer/</guid><description>把注意力、多头和位置编码理清楚，再看编码器与解码器怎样配合完成翻译。</description><pubDate>Sun, 06 Sep 2026 02:00:00 GMT</pubDate><category>机器学习</category><category>论文笔记</category></item><item><title>米勒–拉宾素性测试：从原理到 64 位实现</title><link>https://huxint.github.io/posts/miller-rabin/</link><guid isPermaLink="true">https://huxint.github.io/posts/miller-rabin/</guid><description>从费马小定理出发，多看几步平方的过程，就能筛掉一批伪装成素数的合数。</description><pubDate>Sun, 06 Sep 2026 01:00:00 GMT</pubDate><category>算法</category><category>数论</category><category>C++</category></item><item><title>SparseTable 模板教程</title><link>https://huxint.github.io/posts/sparse-table/</link><guid isPermaLink="true">https://huxint.github.io/posts/sparse-table/</guid><description>先把长度为二的幂的区间算好，查询时取两块合并，就能很快得到区间最值。</description><pubDate>Mon, 17 Feb 2025 14:29:00 GMT</pubDate><category>数据结构</category><category>模板</category><category>C++</category></item><item><title>P3216 题解：[HNOI2011] 数学作业</title><link>https://huxint.github.io/posts/p3216/</link><guid isPermaLink="true">https://huxint.github.io/posts/p3216/</guid><description>把拼接写成递推，位数相同的数放在一起，用矩阵快速幂整段处理。</description><pubDate>Mon, 11 Nov 2024 15:47:00 GMT</pubDate><category>题解</category><category>矩阵快速幂</category><category>C++</category></item><item><title>CF1114F 题解：Please, another Queries on Array?</title><link>https://huxint.github.io/posts/cf1114f/</link><guid isPermaLink="true">https://huxint.github.io/posts/cf1114f/</guid><description>欧拉函数只关心哪些质因子出现过，把它们压成位掩码，就能交给线段树维护。</description><pubDate>Mon, 28 Oct 2024 12:30:00 GMT</pubDate><category>题解</category><category>线段树</category><category>数论</category><category>C++</category></item><item><title>P1253 题解：[yLOI2018] 扶苏的问题</title><link>https://huxint.github.io/posts/p1253/</link><guid isPermaLink="true">https://huxint.github.io/posts/p1253/</guid><description>用矩阵把区间加和区间赋值写到一起，懒标记的合成顺序也就清楚了。</description><pubDate>Fri, 25 Oct 2024 09:54:00 GMT</pubDate><category>题解</category><category>线段树</category><category>C++</category></item><item><title>P6327 题解：区间加区间 sin 和</title><link>https://huxint.github.io/posts/p6327/</link><guid isPermaLink="true">https://huxint.github.io/posts/p6327/</guid><description>把正弦和、余弦和一起存下来，区间加就能用两角和公式处理。</description><pubDate>Fri, 25 Oct 2024 09:34:00 GMT</pubDate><category>题解</category><category>线段树</category><category>C++</category></item><item><title>Pollard–Rho 质因数分解模板</title><link>https://huxint.github.io/posts/pollard-rho/</link><guid isPermaLink="true">https://huxint.github.io/posts/pollard-rho/</guid><description>用 Pollard–Rho 找因子，配合 Miller–Rabin 完成分解，再顺便枚举因子、求欧拉函数。</description><pubDate>Wed, 28 Aug 2024 10:36:00 GMT</pubDate><category>算法</category><category>数论</category><category>模板</category><category>C++</category></item></channel></rss>