<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>组合数学 on 绿豆沙の小窝</title><link>https://lvdousha26.github.io/tags/%E7%BB%84%E5%90%88%E6%95%B0%E5%AD%A6/</link><description>Recent content from 绿豆沙の小窝</description><generator>Hugo</generator><language>zh-CN</language><managingEditor>xxx@example.com (lvdousha)</managingEditor><webMaster>xxx@example.com (lvdousha)</webMaster><copyright>本博客所有文章除特别声明外，均采用 BY-NC-SA 许可协议。转载请注明出处！</copyright><lastBuildDate>Thu, 21 May 2026 17:00:00 +0800</lastBuildDate><atom:link href="https://lvdousha26.github.io/tags/%E7%BB%84%E5%90%88%E6%95%B0%E5%AD%A6/index.xml" rel="self" type="application/rss+xml"/><item><title>Codeforces Round 1098 (Div. 2) 题解</title><link>https://lvdousha26.github.io/post/cf-round-1098-solution/</link><pubDate>Thu, 21 May 2026 17:00:00 +0800</pubDate><author>xxx@example.com (lvdousha)</author><guid>https://lvdousha26.github.io/post/cf-round-1098-solution/</guid><description>
<![CDATA[<h1>Codeforces Round 1098 (Div. 2) 题解</h1><p>作者：lvdousha（xxx@example.com）</p>
        
          <p>这场是 WDOI 团队出的东方主题 round。6 道题（C、E 各有 easy/hard），整体难度梯度不错，适合 Div. 2 选手。</p>
        
        <hr><p>本文2026-05-21首发于<a href='https://lvdousha26.github.io/'>绿豆沙の小窝</a>，最后修改于2026-05-21</p>]]></description><category>算法竞赛</category></item></channel></rss>