﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-Vontroy-最新评论</title><link>http://www.cppblog.com/vontroy/commentsrss.aspx</link><description /><language>zh-cn</language><pubDate>Wed, 31 Aug 2016 02:16:18 GMT</pubDate><lastBuildDate>Wed, 31 Aug 2016 02:16:18 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 求两个或N个数的最大公约数(gcd)和最小公倍数(lcm)的较优算法[未登录]</title><link>http://www.cppblog.com/vontroy/archive/2011/01/23/128301.html#139174</link><dc:creator>路人甲</dc:creator><author>路人甲</author><pubDate>Sun, 23 Jan 2011 10:18:00 GMT</pubDate><guid>http://www.cppblog.com/vontroy/archive/2011/01/23/128301.html#139174</guid><description><![CDATA[初学ACM....算法谢啦~虽然暂时难以理解....研究下<img src ="http://www.cppblog.com/vontroy/aggbug/139174.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/vontroy/" target="_blank">路人甲</a> 2011-01-23 18:18 <a href="http://www.cppblog.com/vontroy/archive/2011/01/23/128301.html#139174#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>