﻿<?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++博客-coreBugZJ-随笔分类-课内作业</title><link>http://www.cppblog.com/coreBugZJ/category/16342.html</link><description>________成功的一万个小时________QQ 466577437</description><language>zh-cn</language><lastBuildDate>Mon, 29 Apr 2013 18:54:30 GMT</lastBuildDate><pubDate>Mon, 29 Apr 2013 18:54:30 GMT</pubDate><ttl>60</ttl><item><title>A* 算法求解八数码问题，POJ 1077 Eight</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/05/177657.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Tue, 05 Jun 2012 07:06:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/05/177657.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177657.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/05/177657.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177657.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177657.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 经典不解释。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/05/177657.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177657.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-05 15:06 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/05/177657.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>k-means 算法实现人口聚类</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/05/177656.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Tue, 05 Jun 2012 07:04:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/05/177656.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177656.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/05/177656.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177656.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177656.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 经典算法，第一次尝试聚类。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/05/177656.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177656.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-05 15:04 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/05/177656.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>ID3 算法实现决策树</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/05/177654.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Tue, 05 Jun 2012 07:02:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/05/177654.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177654.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/05/177654.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177654.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177654.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 经典算法，被我实现的极其恶心。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/05/177654.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177654.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-05 15:02 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/05/177654.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 1067 取石子游戏</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177481.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Mon, 04 Jun 2012 08:05:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177481.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177481.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177481.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177481.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177481.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 博弈论的问题，需要证明一些结论。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177481.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177481.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-04 16:05 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177481.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 2068 Nim</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177480.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Mon, 04 Jun 2012 08:03:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177480.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177480.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177480.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177480.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177480.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 博弈DP ，记忆化搜索。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177480.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177480.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-04 16:03 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177480.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 2975 Nim</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177479.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Mon, 04 Jun 2012 08:01:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177479.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177479.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177479.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177479.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177479.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 经典 Nim 博弈。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177479.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177479.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-04 16:01 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177479.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 3696 The Luckiest number</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177110.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Fri, 01 Jun 2012 13:32:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177110.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177110.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177110.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177110.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177110.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 给一个数N(1<=N<=2000000000);问是否存在N的倍数M，且M的各个位全部由8组成，如果存在多个取最小的 M 并输出M由几个8组成。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177110.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177110.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-01 21:32 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177110.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 3604 Professor Ben</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177109.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Fri, 01 Jun 2012 13:30:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177109.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177109.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177109.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177109.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177109.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 求整数的所有的因子的因子数的立方和。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177109.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177109.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-01 21:30 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177109.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 1117 剩余定理</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177108.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Fri, 01 Jun 2012 13:27:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177108.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177108.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177108.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177108.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177108.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 求正整数中满足：X mod a[0] = b[0], X mod a[1] = b[1], X mod a[2] = b[2], …, X mod a[i] = b[i], … 的最小解。a[i]是一些两两互质的正整数。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177108.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177108.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-01 21:27 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177108.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 1056 线性同余方程</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177107.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Fri, 01 Jun 2012 13:26:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177107.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177107.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177107.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177107.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177107.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 形如ax≡b(mod m) 的方程，称为线性同余方程。编写程序求解线性同余方程（基于欧几里德算法）。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177107.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177107.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-01 21:26 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177107.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>马虎浏览完一遍 SICP ，设计一个玩具Lisp方言，用C++实现一个玩具解释器，勿笑   版本 2.0</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177084.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Fri, 01 Jun 2012 08:33:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177084.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177084.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177084.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177084.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177084.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 主要增加了图形和事件驱动，以及其它一些特性。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177084.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177084.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-01 16:33 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177084.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 1603 Risk</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/05/14/174864.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Mon, 14 May 2012 08:13:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/05/14/174864.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/174864.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/05/14/174864.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/174864.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/174864.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 图论 最短路径&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/05/14/174864.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/174864.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-05-14 16:13 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/05/14/174864.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 1848 你是ACM吗？</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/05/14/174863.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Mon, 14 May 2012 08:12:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/05/14/174863.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/174863.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/05/14/174863.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/174863.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/174863.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 图论 最短路径&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/05/14/174863.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/174863.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-05-14 16:12 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/05/14/174863.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 1028 路由器</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/05/14/174862.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Mon, 14 May 2012 08:08:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/05/14/174862.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/174862.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/05/14/174862.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/174862.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/174862.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 图论 最短路径&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/05/14/174862.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/174862.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-05-14 16:08 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/05/14/174862.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 1708 Connected Gheeves</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/05/13/174792.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Sun, 13 May 2012 14:54:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/05/13/174792.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/174792.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/05/13/174792.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/174792.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/174792.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 计算几何 二分 + 求面积&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/05/13/174792.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/174792.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-05-13 22:54 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/05/13/174792.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 1189 Wall   POJ 1113 Wall</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/05/13/174791.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Sun, 13 May 2012 14:52:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/05/13/174791.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/174791.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/05/13/174791.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/174791.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/174791.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 计算几何 凸包&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/05/13/174791.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/174791.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-05-13 22:52 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/05/13/174791.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 1127 多边形面积（计算几何）</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/05/13/174790.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Sun, 13 May 2012 14:51:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/05/13/174790.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/174790.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/05/13/174790.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/174790.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/174790.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 多边形面积（计算几何）&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/05/13/174790.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/174790.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-05-13 22:51 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/05/13/174790.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 3277 City Horizon</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172389.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Sun, 22 Apr 2012 14:52:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172389.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/172389.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172389.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/172389.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/172389.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 线段树+离散化。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172389.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/172389.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-04-22 22:52 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172389.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 2528 Mayor's posters</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172388.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Sun, 22 Apr 2012 14:50:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172388.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/172388.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172388.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/172388.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/172388.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 线段树+离散化。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172388.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/172388.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-04-22 22:50 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172388.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 2458 Frequent values</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172387.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Sun, 22 Apr 2012 14:48:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172387.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/172387.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172387.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/172387.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/172387.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 线段树，及 RMQ ST 。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172387.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/172387.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-04-22 22:48 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172387.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 2525 Light Switching</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172386.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Sun, 22 Apr 2012 14:46:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172386.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/172386.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172386.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/172386.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/172386.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 线段树。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172386.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/172386.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-04-22 22:46 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/04/22/172386.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 1148 质数阵</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/04/21/172263.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Sat, 21 Apr 2012 08:59:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/04/21/172263.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/172263.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/04/21/172263.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/172263.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/172263.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 深度优先搜索，优化剪枝。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/04/21/172263.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/172263.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-04-21 16:59 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/04/21/172263.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 1780 Escape</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/04/21/172259.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Sat, 21 Apr 2012 08:40:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/04/21/172259.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/172259.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/04/21/172259.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/172259.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/172259.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 搜索题，本来是简单题，但我犯了错误。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/04/21/172259.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/172259.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-04-21 16:40 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/04/21/172259.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>ACM搜索题经典 Sticks</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/04/21/172218.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Sat, 21 Apr 2012 02:47:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/04/21/172218.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/172218.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/04/21/172218.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/172218.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/172218.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: EOJ  1981 Sticks<br>POJ  1011 Sticks<br>HDOJ 1455 Sticks<br>UVA  307  Sticks 。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/04/21/172218.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/172218.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-04-21 10:47 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/04/21/172218.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 2069 Asteroids</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/03/30/169574.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Fri, 30 Mar 2012 14:18:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/03/30/169574.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/169574.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/03/30/169574.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/169574.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/169574.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 求二分图最大匹配，使用匈牙利算法。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/03/30/169574.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/169574.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-03-30 22:18 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/03/30/169574.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 1864 Playing With Cubes</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/03/30/169573.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Fri, 30 Mar 2012 14:16:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/03/30/169573.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/169573.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/03/30/169573.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/169573.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/169573.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 二分图最大匹配使用匈牙利算法。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/03/30/169573.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/169573.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-03-30 22:16 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/03/30/169573.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>嵌入式上机之三，汇编与C语言相互调用</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/03/18/168275.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Sun, 18 Mar 2012 14:55:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/03/18/168275.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/168275.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/03/18/168275.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/168275.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/168275.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: .<br>1.1 编写一个汇编程序mixop.s<br>– 实现函数 y=mixop(x1,x2,x3)<br>– y=x1+x2*x3<br>– 调用c2.c中的multiply函数<br>1.2 C程序1：c1.c<br>– 实现函数 void init();<br>– 作为启动时的起始地址<br>– 在该函数内要调用mixop函数完成6+40*50，结果存放在变量y中。<br>1.3 C程序2：c2.c<br>– 实现函数y=multiply(x1,x2)<br>– y=x1*x2 。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/03/18/168275.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/168275.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-03-18 22:55 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/03/18/168275.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 1096 棋盘分割   （动态规划）</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/03/17/168176.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Sat, 17 Mar 2012 03:28:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/03/17/168176.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/168176.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/03/17/168176.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/168176.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/168176.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: .<br>将一个 8*8 的棋盘进行如下分割：<br>将原棋盘割下一块矩形棋盘并使剩下部分也是矩形，再将剩下部分继续如此分割，<br>这样割了 n-1 次后，连同最后剩下的矩形棋盘共有 n 块矩形棋盘。<br>每次切割都只能沿着棋盘格子的边进行。<br><br>原棋盘上每一格有一个分值，一块矩形棋盘的总分为其所含各格分值之和。<br>现需要把棋盘按上述规则分割成 n 块矩形棋盘，并使各矩形棋盘总分的均方差最小。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/03/17/168176.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/168176.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-03-17 11:28 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/03/17/168176.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 1823 数塔II        （动态规划入门）</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/03/16/168056.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Fri, 16 Mar 2012 04:02:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/03/16/168056.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/168056.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/03/16/168056.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/168056.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/168056.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 动态规划入门题。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/03/16/168056.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/168056.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-03-16 12:02 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/03/16/168056.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 2067 Building Roads</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/03/04/167136.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Sun, 04 Mar 2012 14:37:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/03/04/167136.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/167136.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/03/04/167136.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/167136.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/167136.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 二维平面中有 N 个点，其中 M 对点已经有边连接，<br>现在需要增加若干条边，以使所有点相互连通。<br>定义边的长度为两点间的欧几里得距离。<br><br>求增加的边的总长度的最小值。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/03/04/167136.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/167136.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-03-04 22:37 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/03/04/167136.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>