<?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/categories/%E5%85%A5%E9%97%A8/</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/categories/%E5%85%A5%E9%97%A8/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>P1085 不高兴的津津</title>
      <link>https://www.cosefinch.com/posts/p1085-unhappy-jj/</link>
      <pubDate>Fri, 08 May 2026 09:35:00 +0800</pubDate>
      
      <guid>https://www.cosefinch.com/posts/p1085-unhappy-jj/</guid>
      <description>
        
          
            模拟津津一周的日程，统计每天总上课时长，找出超过8小时的最不高兴的一天
          
          
        
      </description>
    </item>
    
    <item>
      <title>P1047 校门外的树</title>
      <link>https://www.cosefinch.com/posts/p1047-trees-outside-school/</link>
      <pubDate>Tue, 05 May 2026 20:32:23 +0800</pubDate>
      
      <guid>https://www.cosefinch.com/posts/p1047-trees-outside-school/</guid>
      <description>
        
          
            校门外 0~L 的树中，移除 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>
    
    <item>
      <title>P7106 双生独白</title>
      <link>https://www.cosefinch.com/posts/p7106-dual-monologue/</link>
      <pubDate>Mon, 04 May 2026 09:32:51 +0800</pubDate>
      
      <guid>https://www.cosefinch.com/posts/p7106-dual-monologue/</guid>
      <description>
        
          
            给定十六进制颜色码（如 #EBA932），输出其反色。方法是对每两位十六进制数做「15 减法」，利用 ASCII 码偏移技巧在字符与数值间灵活转换。
          
          
        
      </description>
    </item>
    
  </channel>
</rss>