﻿<?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++博客-CLive Studio</title><link>http://www.cppblog.com/chauncey/</link><description>Record my life &amp; Code the lively world</description><language>zh-cn</language><lastBuildDate>Tue, 14 Apr 2026 23:08:11 GMT</lastBuildDate><pubDate>Tue, 14 Apr 2026 23:08:11 GMT</pubDate><ttl>60</ttl><item><title>Google code jam 2008 QR - Saving the Universe</title><link>http://www.cppblog.com/chauncey/archive/2009/08/12/93080.html</link><dc:creator>Chauncey</dc:creator><author>Chauncey</author><pubDate>Wed, 12 Aug 2009 13:20:00 GMT</pubDate><guid>http://www.cppblog.com/chauncey/archive/2009/08/12/93080.html</guid><wfw:comment>http://www.cppblog.com/chauncey/comments/93080.html</wfw:comment><comments>http://www.cppblog.com/chauncey/archive/2009/08/12/93080.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/chauncey/comments/commentRss/93080.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/chauncey/services/trackbacks/93080.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 这是Google code jam 2008 QR的第一道题，关于搜索引擎切换的问题。根据题目描述推演，可得出贪心法的解决策略，同时也给了一个动态规划算法方案。最后给出源码。&nbsp;&nbsp;<a href='http://www.cppblog.com/chauncey/archive/2009/08/12/93080.html'>阅读全文</a><img src ="http://www.cppblog.com/chauncey/aggbug/93080.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/chauncey/" target="_blank">Chauncey</a> 2009-08-12 21:20 <a href="http://www.cppblog.com/chauncey/archive/2009/08/12/93080.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Google code jam 2008 R1A - Numbers</title><link>http://www.cppblog.com/chauncey/archive/2009/08/12/93079.html</link><dc:creator>Chauncey</dc:creator><author>Chauncey</author><pubDate>Wed, 12 Aug 2009 13:19:00 GMT</pubDate><guid>http://www.cppblog.com/chauncey/archive/2009/08/12/93079.html</guid><wfw:comment>http://www.cppblog.com/chauncey/comments/93079.html</wfw:comment><comments>http://www.cppblog.com/chauncey/archive/2009/08/12/93079.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/chauncey/comments/commentRss/93079.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/chauncey/services/trackbacks/93079.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 这是Google code jam 2008 R1A的第三道题，关于无理数n次幂的问题。这道题巧妙的运用了数论的原理，对巩固指数多项式的相关数学知识、快速求指数法等算法、中国余数理论等，有很强的参考价值和复习作用。最后给出源码。&nbsp;&nbsp;<a href='http://www.cppblog.com/chauncey/archive/2009/08/12/93079.html'>阅读全文</a><img src ="http://www.cppblog.com/chauncey/aggbug/93079.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/chauncey/" target="_blank">Chauncey</a> 2009-08-12 21:19 <a href="http://www.cppblog.com/chauncey/archive/2009/08/12/93079.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Google code jam 2008 R1A - Milkshakes</title><link>http://www.cppblog.com/chauncey/archive/2009/08/12/93076.html</link><dc:creator>Chauncey</dc:creator><author>Chauncey</author><pubDate>Wed, 12 Aug 2009 13:17:00 GMT</pubDate><guid>http://www.cppblog.com/chauncey/archive/2009/08/12/93076.html</guid><wfw:comment>http://www.cppblog.com/chauncey/comments/93076.html</wfw:comment><comments>http://www.cppblog.com/chauncey/archive/2009/08/12/93076.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/chauncey/comments/commentRss/93076.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/chauncey/services/trackbacks/93076.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 这是Google code jam 2008 R1A的第二道题，关于如何最大限度顾客需求的问题。这可以归类为满足性问题，它是一个NP-完全问题。然而这道题有自己的特征，可以根据题目给定的约束条件，采用比较简单的算法就能得出结果。最后给出源码。&nbsp;&nbsp;<a href='http://www.cppblog.com/chauncey/archive/2009/08/12/93076.html'>阅读全文</a><img src ="http://www.cppblog.com/chauncey/aggbug/93076.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/chauncey/" target="_blank">Chauncey</a> 2009-08-12 21:17 <a href="http://www.cppblog.com/chauncey/archive/2009/08/12/93076.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>我的cppblog开通了！欢迎大家来访！</title><link>http://www.cppblog.com/chauncey/archive/2009/08/12/Start_point.html</link><dc:creator>Chauncey</dc:creator><author>Chauncey</author><pubDate>Wed, 12 Aug 2009 13:10:00 GMT</pubDate><guid>http://www.cppblog.com/chauncey/archive/2009/08/12/Start_point.html</guid><wfw:comment>http://www.cppblog.com/chauncey/comments/93074.html</wfw:comment><comments>http://www.cppblog.com/chauncey/archive/2009/08/12/Start_point.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/chauncey/comments/commentRss/93074.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/chauncey/services/trackbacks/93074.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 感觉这里很安静，是一个适合我修生养性的地方。最初只是觉得这里把代码贴上去以后，以后看代码会比其他博客方便很多，没想到还有这一点。恩，很好，我选择，我喜欢！<br>另外这里还有很多专业级资深人士和数位传说中的大牛，激动激动！希望能和大家成为朋友。<br>相信还有很多优点，恩，边用边发掘吧。 &nbsp;&nbsp;<a href='http://www.cppblog.com/chauncey/archive/2009/08/12/Start_point.html'>阅读全文</a><img src ="http://www.cppblog.com/chauncey/aggbug/93074.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/chauncey/" target="_blank">Chauncey</a> 2009-08-12 21:10 <a href="http://www.cppblog.com/chauncey/archive/2009/08/12/Start_point.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>