﻿<?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++博客-Yuan-随笔分类-搜索</title><link>http://www.cppblog.com/Yuan/category/16262.html</link><description /><language>zh-cn</language><lastBuildDate>Sat, 28 May 2011 15:43:16 GMT</lastBuildDate><pubDate>Sat, 28 May 2011 15:43:16 GMT</pubDate><ttl>60</ttl><item><title>CF 83C 枚举字母再BFS  或  PQ搜，启发</title><link>http://www.cppblog.com/Yuan/archive/2011/05/27/147360.html</link><dc:creator>_Yuan</dc:creator><author>_Yuan</author><pubDate>Fri, 27 May 2011 05:42:00 GMT</pubDate><guid>http://www.cppblog.com/Yuan/archive/2011/05/27/147360.html</guid><wfw:comment>http://www.cppblog.com/Yuan/comments/147360.html</wfw:comment><comments>http://www.cppblog.com/Yuan/archive/2011/05/27/147360.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Yuan/comments/commentRss/147360.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Yuan/services/trackbacks/147360.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-->/**//*&nbsp;&nbsp;&nbsp;&nbsp;求S到Ｔ的字典序最小最短路径，其中路径最多只能包含ｋ个不同的字符&nbsp;&nbsp;&nbsp;&nbsp;n,m&lt;=50&nbsp;...&nbsp;&nbsp;<a href='http://www.cppblog.com/Yuan/archive/2011/05/27/147360.html'>阅读全文</a><img src ="http://www.cppblog.com/Yuan/aggbug/147360.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Yuan/" target="_blank">_Yuan</a> 2011-05-27 13:42 <a href="http://www.cppblog.com/Yuan/archive/2011/05/27/147360.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>CodeForces 60C 枚举 暴搜</title><link>http://www.cppblog.com/Yuan/archive/2011/02/20/140341.html</link><dc:creator>_Yuan</dc:creator><author>_Yuan</author><pubDate>Sun, 20 Feb 2011 14:19:00 GMT</pubDate><guid>http://www.cppblog.com/Yuan/archive/2011/02/20/140341.html</guid><wfw:comment>http://www.cppblog.com/Yuan/comments/140341.html</wfw:comment><comments>http://www.cppblog.com/Yuan/archive/2011/02/20/140341.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Yuan/comments/commentRss/140341.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Yuan/services/trackbacks/140341.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: /**//*&nbsp;&nbsp;&nbsp;&nbsp;一个图&nbsp;&nbsp;&nbsp;&nbsp;每条边上有两个值(gcd,lcm)&nbsp;其值是该边两个顶点u,v上值的gcd和lcm&nbsp;&nbsp;&nbsp;&nbsp;现给出一些边，问有没存在顶点的值满足边的限制&nbsp;&nbsp;&nbsp;&nbsp;n&nbsp;&lt;=&nbsp;100&nbsp;,...&nbsp;&nbsp;<a href='http://www.cppblog.com/Yuan/archive/2011/02/20/140341.html'>阅读全文</a><img src ="http://www.cppblog.com/Yuan/aggbug/140341.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Yuan/" target="_blank">_Yuan</a> 2011-02-20 22:19 <a href="http://www.cppblog.com/Yuan/archive/2011/02/20/140341.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>