﻿<?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++博客-心竹初露-随笔分类-ACM题目解析</title><link>http://www.cppblog.com/Bamboo/category/15718.html</link><description>心有成竹初露</description><language>zh-cn</language><lastBuildDate>Mon, 20 Dec 2010 02:32:44 GMT</lastBuildDate><pubDate>Mon, 20 Dec 2010 02:32:44 GMT</pubDate><ttl>60</ttl><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>