<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" 
  xmlns:content="http://purl.org/rss/1.0/modules/content/" 
  xmlns:dc="http://purl.org/dc/elements/1.1/" 
  xmlns:atom="http://www.w3.org/2005/Atom" 
  xmlns:sy="http://purl.org/rss/1.0/modules/syndication/" 
  xmlns:media="http://search.yahoo.com/mrss/">
  <channel>
    <title>ACM on - Qfrost -</title>
    <link>http://www.qfrost.com:80/categories/acm/</link>
    <description>Recent content in ACM on - Qfrost -</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    <copyright>©2026, All Rights Reserved</copyright>
    <lastBuildDate>Tue, 03 Sep 2019 16:00:00 +0000</lastBuildDate>
    
        <atom:link href="http://www.qfrost.com:80/categories/acm/index.xml" rel="self" type="application/rss+xml" />
    

      
      <item>
        <title>花式求解：三齿轮啮合(三个数求其最小公倍数)</title>
        <link>http://www.qfrost.com:80/posts/acm/%E4%B8%89%E4%B8%AA%E6%95%B0%E6%B1%82%E5%85%B6%E6%9C%80%E5%B0%8F%E5%85%AC%E5%80%8D%E6%95%B0/</link>
        <pubDate>Tue, 03 Sep 2019 16:00:00 +0000</pubDate>
        
        <atom:modified>Tue, 03 Sep 2019 16:00:00 +0000</atom:modified>
        <guid>http://www.qfrost.com:80/posts/acm/%E4%B8%89%E4%B8%AA%E6%95%B0%E6%B1%82%E5%85%B6%E6%9C%80%E5%B0%8F%E5%85%AC%E5%80%8D%E6%95%B0/</guid>
        <description>0x00 题目描述 在齿轮箱里三个齿轮互相衔接，某瞬间两对齿相遇，问各转多少圈后，这两对齿同时重逢。 输入： 输入数据有多组，每组数据一行，每行为3个数a</description>
        
        <dc:creator>Qfrost</dc:creator>
        
        
        
        
        
          
            
              <category>ACM</category>
            
          
        
        
      </item>
      

    
  </channel>
</rss>
