﻿<?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++博客-心竹初露</title><link>http://www.cppblog.com/Bamboo/</link><description>心有成竹初露</description><language>zh-cn</language><lastBuildDate>Thu, 09 Apr 2026 01:04:46 GMT</lastBuildDate><pubDate>Thu, 09 Apr 2026 01:04:46 GMT</pubDate><ttl>60</ttl><item><title>关于SQL Server 2005的安装过程</title><link>http://www.cppblog.com/Bamboo/archive/2011/11/17/160372.html</link><dc:creator>Bamboo</dc:creator><author>Bamboo</author><pubDate>Thu, 17 Nov 2011 12:57:00 GMT</pubDate><guid>http://www.cppblog.com/Bamboo/archive/2011/11/17/160372.html</guid><wfw:comment>http://www.cppblog.com/Bamboo/comments/160372.html</wfw:comment><comments>http://www.cppblog.com/Bamboo/archive/2011/11/17/160372.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Bamboo/comments/commentRss/160372.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Bamboo/services/trackbacks/160372.html</trackback:ping><description><![CDATA[&nbsp; &nbsp; &nbsp; 安装之前，别人就告诉我SQL Server 不好安装，尤其在你的电脑之前安装过，之后卸载了，现在又安装的情况下。但是为了做作业，只好硬着头皮试试了。<br />&nbsp; &nbsp; &nbsp;结果真是不听老人言，吃亏在眼前啊。早知道SQL Server这么难装，我就不会傻傻的把电脑上已经装的sql server 2008给卸了，尽管它装的不全，但是应该是可以通过后天修补给修补过来的吧！现在只好面对卸不干净后装不上的问题了，白白浪费了好多时间呐。<br />&nbsp; &nbsp; &nbsp;现在的问题是安装SQL Server过程中出现了安装msxml失败，接着就出现了一系列的失败，安装了两次都是这样，于是上网搜。结果还真有跟我问题一样的，幸好我看了他的文章，才少走了很多弯路。于是按照他的方法下载<span class="Apple-style-span" style="font-family: 宋体, Arial; font-size: 12px; line-height: 15px; background-color: #f5f7f8; ">windows&nbsp;install&nbsp;clean&nbsp;up程序，也就是微软自己出的卸载程序，将</span>msxml6.0给卸载掉了，然后将之前安装的sql server的半成品，也给卸载掉了，现在正在安装过程中啊，希望顺利......<br />&nbsp; &nbsp; &nbsp;终于成功了，眼泪哗哗的......<br /><br /><br />附上作者链接：<a href="http://blog.chinaunix.net/space.php?uid=14296218&amp;do=blog&amp;id=2823588">http://blog.chinaunix.net/space.php?uid=14296218&amp;do=blog&amp;id=2823588</a><br /><img src ="http://www.cppblog.com/Bamboo/aggbug/160372.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Bamboo/" target="_blank">Bamboo</a> 2011-11-17 20:57 <a href="http://www.cppblog.com/Bamboo/archive/2011/11/17/160372.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>pku ACM分类</title><link>http://www.cppblog.com/Bamboo/archive/2011/03/14/141754.html</link><dc:creator>Bamboo</dc:creator><author>Bamboo</author><pubDate>Sun, 13 Mar 2011 22:51:00 GMT</pubDate><guid>http://www.cppblog.com/Bamboo/archive/2011/03/14/141754.html</guid><wfw:comment>http://www.cppblog.com/Bamboo/comments/141754.html</wfw:comment><comments>http://www.cppblog.com/Bamboo/archive/2011/03/14/141754.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Bamboo/comments/commentRss/141754.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Bamboo/services/trackbacks/141754.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 转自：http://hi.baidu.com/spacetimer/blog/item/5360ac64efec1cfcf6365459.html1.搜索　//回溯2.DP（动态规划）　3.贪心　北大ACM题分类2009-01-27 14.图论　//Dijkstra、最小生成树、网络流5.数论　//解模线性方程6.计算几何　//凸壳、同等安置矩形的并的面积与周长sp;&nbsp;7.组合数学　//...&nbsp;&nbsp;<a href='http://www.cppblog.com/Bamboo/archive/2011/03/14/141754.html'>阅读全文</a><img src ="http://www.cppblog.com/Bamboo/aggbug/141754.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Bamboo/" target="_blank">Bamboo</a> 2011-03-14 06:51 <a href="http://www.cppblog.com/Bamboo/archive/2011/03/14/141754.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>ACM 1013 Counterfeit Dollar</title><link>http://www.cppblog.com/Bamboo/archive/2010/12/19/136949.html</link><dc:creator>Bamboo</dc:creator><author>Bamboo</author><pubDate>Sun, 19 Dec 2010 08:42:00 GMT</pubDate><guid>http://www.cppblog.com/Bamboo/archive/2010/12/19/136949.html</guid><wfw:comment>http://www.cppblog.com/Bamboo/comments/136949.html</wfw:comment><comments>http://www.cppblog.com/Bamboo/archive/2010/12/19/136949.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Bamboo/comments/commentRss/136949.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Bamboo/services/trackbacks/136949.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 问题描述： &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Sally有12枚银币，其中有11枚是真的，1枚是假的。假的这枚在外形、色泽上与真的无异，但是质量上有差距。可能比真的重，也可能比真的轻。幸运的是Sally借到了一个天平，有3次机会来称量决出其中的假币。规定每次放到天平两端的银币数目是一样的，最终还需要找出假币的质量是轻，还是重。 分析：&nbsp;...&nbsp;&nbsp;<a href='http://www.cppblog.com/Bamboo/archive/2010/12/19/136949.html'>阅读全文</a><img src ="http://www.cppblog.com/Bamboo/aggbug/136949.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Bamboo/" target="_blank">Bamboo</a> 2010-12-19 16:42 <a href="http://www.cppblog.com/Bamboo/archive/2010/12/19/136949.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>PKUACM1012 约瑟夫环</title><link>http://www.cppblog.com/Bamboo/archive/2010/12/18/136818.html</link><dc:creator>Bamboo</dc:creator><author>Bamboo</author><pubDate>Fri, 17 Dec 2010 16:47:00 GMT</pubDate><guid>http://www.cppblog.com/Bamboo/archive/2010/12/18/136818.html</guid><wfw:comment>http://www.cppblog.com/Bamboo/comments/136818.html</wfw:comment><comments>http://www.cppblog.com/Bamboo/archive/2010/12/18/136818.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Bamboo/comments/commentRss/136818.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Bamboo/services/trackbacks/136818.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 问题描述：k个好人和k个坏人站成一圈，前k个是好人，后k个是坏人，m是隔的人数，求最小的m，可以将所有的k个坏人杀死，而好人留下。&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;这是一个典型的约瑟夫问题的简单变形，在做这道题的时候，我对约瑟夫问题有所了解，但是对具体的算法步骤却...&nbsp;&nbsp;<a href='http://www.cppblog.com/Bamboo/archive/2010/12/18/136818.html'>阅读全文</a><img src ="http://www.cppblog.com/Bamboo/aggbug/136818.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Bamboo/" target="_blank">Bamboo</a> 2010-12-18 00:47 <a href="http://www.cppblog.com/Bamboo/archive/2010/12/18/136818.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>