<?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://www.cosefinch.com/tags/%E6%95%B0%E5%AD%A6/</link>
    <description>Recent content in 数学 on 敲代码的朱雀</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>zh-cn</language>
    <lastBuildDate>Fri, 08 May 2026 10:29:28 +0800</lastBuildDate><atom:link href="https://www.cosefinch.com/tags/%E6%95%B0%E5%AD%A6/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>P1147 连续正整数和</title>
      <link>https://www.cosefinch.com/posts/p1147-consecutive-integer-sum/</link>
      <pubDate>Fri, 08 May 2026 10:29:28 +0800</pubDate>
      
      <guid>https://www.cosefinch.com/posts/p1147-consecutive-integer-sum/</guid>
      <description>
        
          
            枚举连续正整数序列的起点，累加直到和达到 M，输出所有合法序列
          
          
        
      </description>
    </item>
    
    <item>
      <title>P7285 修改数组</title>
      <link>https://www.cosefinch.com/posts/p7285-modify-array/</link>
      <pubDate>Mon, 04 May 2026 10:42:51 +0800</pubDate>
      
      <guid>https://www.cosefinch.com/posts/p7285-modify-array/</guid>
      <description>
        
          
            给定只含 0/1 的数组，可将任意 0 改为 1，求「最长连续 1 子段长度 - 修改个数」的最大值。观察发现：把所有 0 都改成 1 时，答案就是 n 减去 0 的个数。
          
          
        
      </description>
    </item>
    
  </channel>
</rss>