<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>ybnybny's Blog · Source</title><link>https://ybnybny.github.io/</link><description>For Source of USTB</description><generator>Hugo</generator><language>zh-cn</language><managingEditor>u202642417@xs.ustb.edu.cn (ybnybny)</managingEditor><webMaster>u202642417@xs.ustb.edu.cn (ybnybny)</webMaster><lastBuildDate>Mon, 26 Oct 2026 21:30:00 +0800</lastBuildDate><atom:link href="https://ybnybny.github.io/source/index.xml" rel="self" type="application/rss+xml"/><item><title>排列 置换 与720种可能性</title><link>https://ybnybny.github.io/posts/algorithm/permutation/</link><pubDate>Mon, 26 Oct 2026 21:30:00 +0800</pubDate><guid>https://ybnybny.github.io/posts/algorithm/permutation/</guid><description>本文讲述了置换的基本概念及基础算法应用。Part 0 主要介绍一些基本概念与表示法，需要中学数学基础，适合一般科普阅读受众。Part 1 的思路以算法竞赛实战为导向，主要为我个人近期的学习练习总结，节奏偏快。</description></item></channel></rss>