﻿<?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++博客-LonelyTree的心路历程-随笔分类-ACM--SOJ算法小结</title><link>http://www.cppblog.com/LonelyTree/category/7916.html</link><description>[MSN: LonelyTree@hotmail.com]     [EMAIL: lanshen3333@126.com]</description><language>zh-cn</language><lastBuildDate>Mon, 22 Sep 2008 16:06:00 GMT</lastBuildDate><pubDate>Mon, 22 Sep 2008 16:06:00 GMT</pubDate><ttl>60</ttl><item><title>开灯问题</title><link>http://www.cppblog.com/LonelyTree/archive/2008/09/22/62473.html</link><dc:creator>望尘追梦</dc:creator><author>望尘追梦</author><pubDate>Mon, 22 Sep 2008 05:19:00 GMT</pubDate><guid>http://www.cppblog.com/LonelyTree/archive/2008/09/22/62473.html</guid><wfw:comment>http://www.cppblog.com/LonelyTree/comments/62473.html</wfw:comment><comments>http://www.cppblog.com/LonelyTree/archive/2008/09/22/62473.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/LonelyTree/comments/commentRss/62473.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/LonelyTree/services/trackbacks/62473.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 开灯问题--乒乓开关巧妙解决&nbsp;&nbsp;<a href='http://www.cppblog.com/LonelyTree/archive/2008/09/22/62473.html'>阅读全文</a><img src ="http://www.cppblog.com/LonelyTree/aggbug/62473.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/LonelyTree/" target="_blank">望尘追梦</a> 2008-09-22 13:19 <a href="http://www.cppblog.com/LonelyTree/archive/2008/09/22/62473.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>寻找众数-数组下标的作用</title><link>http://www.cppblog.com/LonelyTree/archive/2008/09/21/62414.html</link><dc:creator>望尘追梦</dc:creator><author>望尘追梦</author><pubDate>Sun, 21 Sep 2008 13:25:00 GMT</pubDate><guid>http://www.cppblog.com/LonelyTree/archive/2008/09/21/62414.html</guid><wfw:comment>http://www.cppblog.com/LonelyTree/comments/62414.html</wfw:comment><comments>http://www.cppblog.com/LonelyTree/archive/2008/09/21/62414.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/LonelyTree/comments/commentRss/62414.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/LonelyTree/services/trackbacks/62414.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 寻找众数，活用下标做得，有点水！&nbsp;&nbsp;<a href='http://www.cppblog.com/LonelyTree/archive/2008/09/21/62414.html'>阅读全文</a><img src ="http://www.cppblog.com/LonelyTree/aggbug/62414.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/LonelyTree/" target="_blank">望尘追梦</a> 2008-09-21 21:25 <a href="http://www.cppblog.com/LonelyTree/archive/2008/09/21/62414.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>递归:整数的划分</title><link>http://www.cppblog.com/LonelyTree/archive/2008/09/21/62410.html</link><dc:creator>望尘追梦</dc:creator><author>望尘追梦</author><pubDate>Sun, 21 Sep 2008 12:29:00 GMT</pubDate><guid>http://www.cppblog.com/LonelyTree/archive/2008/09/21/62410.html</guid><wfw:comment>http://www.cppblog.com/LonelyTree/comments/62410.html</wfw:comment><comments>http://www.cppblog.com/LonelyTree/archive/2008/09/21/62410.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/LonelyTree/comments/commentRss/62410.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/LonelyTree/services/trackbacks/62410.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 对整数的划分！&nbsp;&nbsp;<a href='http://www.cppblog.com/LonelyTree/archive/2008/09/21/62410.html'>阅读全文</a><img src ="http://www.cppblog.com/LonelyTree/aggbug/62410.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/LonelyTree/" target="_blank">望尘追梦</a> 2008-09-21 20:29 <a href="http://www.cppblog.com/LonelyTree/archive/2008/09/21/62410.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>枚举：找矩阵的鞍点</title><link>http://www.cppblog.com/LonelyTree/archive/2008/09/21/62409.html</link><dc:creator>望尘追梦</dc:creator><author>望尘追梦</author><pubDate>Sun, 21 Sep 2008 11:48:00 GMT</pubDate><guid>http://www.cppblog.com/LonelyTree/archive/2008/09/21/62409.html</guid><wfw:comment>http://www.cppblog.com/LonelyTree/comments/62409.html</wfw:comment><comments>http://www.cppblog.com/LonelyTree/archive/2008/09/21/62409.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/LonelyTree/comments/commentRss/62409.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/LonelyTree/services/trackbacks/62409.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 求一个矩阵的鞍点！&nbsp;&nbsp;<a href='http://www.cppblog.com/LonelyTree/archive/2008/09/21/62409.html'>阅读全文</a><img src ="http://www.cppblog.com/LonelyTree/aggbug/62409.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/LonelyTree/" target="_blank">望尘追梦</a> 2008-09-21 19:48 <a href="http://www.cppblog.com/LonelyTree/archive/2008/09/21/62409.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>线性正反向遍历(SOJ--1962)</title><link>http://www.cppblog.com/LonelyTree/archive/2008/08/15/58984.html</link><dc:creator>望尘追梦</dc:creator><author>望尘追梦</author><pubDate>Fri, 15 Aug 2008 15:14:00 GMT</pubDate><guid>http://www.cppblog.com/LonelyTree/archive/2008/08/15/58984.html</guid><wfw:comment>http://www.cppblog.com/LonelyTree/comments/58984.html</wfw:comment><comments>http://www.cppblog.com/LonelyTree/archive/2008/08/15/58984.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/LonelyTree/comments/commentRss/58984.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/LonelyTree/services/trackbacks/58984.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 这个没什么特别的，对文章最后的问题思考一下！&nbsp;&nbsp;<a href='http://www.cppblog.com/LonelyTree/archive/2008/08/15/58984.html'>阅读全文</a><img src ="http://www.cppblog.com/LonelyTree/aggbug/58984.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/LonelyTree/" target="_blank">望尘追梦</a> 2008-08-15 23:14 <a href="http://www.cppblog.com/LonelyTree/archive/2008/08/15/58984.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>二分数值逼近（SOJ--2210)</title><link>http://www.cppblog.com/LonelyTree/archive/2008/08/15/58982.html</link><dc:creator>望尘追梦</dc:creator><author>望尘追梦</author><pubDate>Fri, 15 Aug 2008 14:49:00 GMT</pubDate><guid>http://www.cppblog.com/LonelyTree/archive/2008/08/15/58982.html</guid><wfw:comment>http://www.cppblog.com/LonelyTree/comments/58982.html</wfw:comment><comments>http://www.cppblog.com/LonelyTree/archive/2008/08/15/58982.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/LonelyTree/comments/commentRss/58982.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/LonelyTree/services/trackbacks/58982.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 二分数值逼近求值，尤其是方程不能显化的，而且编码起来相当的简单，希望对您有所帮助！&nbsp;&nbsp;<a href='http://www.cppblog.com/LonelyTree/archive/2008/08/15/58982.html'>阅读全文</a><img src ="http://www.cppblog.com/LonelyTree/aggbug/58982.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/LonelyTree/" target="_blank">望尘追梦</a> 2008-08-15 22:49 <a href="http://www.cppblog.com/LonelyTree/archive/2008/08/15/58982.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>