<?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://YuzukiAtelier.com/tags/%E7%AE%97%E6%B3%95/</link>
    <description>Recent content in 算法 on 摇月的魔法工坊</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>zh-CN</language>
    <managingEditor>Anslate2020@outlook.com (摇月)</managingEditor>
    <webMaster>Anslate2020@outlook.com (摇月)</webMaster>
    <copyright>© 2026 Anslate&amp;摇月</copyright>
    <lastBuildDate>Tue, 10 Nov 2026 17:23:00 +0800</lastBuildDate><atom:link href="https://YuzukiAtelier.com/tags/%E7%AE%97%E6%B3%95/index.xml" rel="self" type="application/rss+xml" />
    
    <item>
      <title>炼金笔记：辗转相除法是怎么算出最大公因数的？</title>
      <link>https://YuzukiAtelier.com/articles/%E7%82%BC%E9%87%91%E7%AC%94%E8%AE%B0%E8%BE%97%E8%BD%AC%E7%9B%B8%E9%99%A4%E6%B3%95%E6%98%AF%E6%80%8E%E4%B9%88%E7%AE%97%E5%87%BA%E6%9C%80%E5%A4%A7%E5%85%AC%E5%9B%A0%E6%95%B0%E7%9A%84/</link>
      <pubDate>Tue, 10 Nov 2026 17:23:00 +0800</pubDate>
      <author>Anslate2020@outlook.com (摇月)</author>
      <guid>https://YuzukiAtelier.com/articles/%E7%82%BC%E9%87%91%E7%AC%94%E8%AE%B0%E8%BE%97%E8%BD%AC%E7%9B%B8%E9%99%A4%E6%B3%95%E6%98%AF%E6%80%8E%E4%B9%88%E7%AE%97%E5%87%BA%E6%9C%80%E5%A4%A7%E5%85%AC%E5%9B%A0%E6%95%B0%E7%9A%84/</guid>
      <description>在学习函数递归的时候，辗转相除法求最大公因数是绕不开的一个例子。但是博主至今都不知道这个算法的底层原理。为什么简单求几次余数，公因数就算出来了？于是写此笔记严肃学习。</description>
      
    </item>
    
  </channel>
</rss>
