﻿<?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/AllKillMan/category/17334.html</link><description>宁相依，也不见，也不离 ！</description><language>zh-cn</language><lastBuildDate>Thu, 18 Aug 2011 13:43:13 GMT</lastBuildDate><pubDate>Thu, 18 Aug 2011 13:43:13 GMT</pubDate><ttl>60</ttl><item><title>页码计数</title><link>http://www.cppblog.com/AllKillMan/archive/2011/08/18/153798.html</link><dc:creator>AK</dc:creator><author>AK</author><pubDate>Thu, 18 Aug 2011 11:26:00 GMT</pubDate><guid>http://www.cppblog.com/AllKillMan/archive/2011/08/18/153798.html</guid><wfw:comment>http://www.cppblog.com/AllKillMan/comments/153798.html</wfw:comment><comments>http://www.cppblog.com/AllKillMan/archive/2011/08/18/153798.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/AllKillMan/comments/commentRss/153798.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/AllKillMan/services/trackbacks/153798.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 【问题描述】<br><br>    一本书的页数为N，页码从1开始编起，请你求出全部页码中，用了多少个0，1，2，…，9。其中—个页码不含多余的0，如N＝1234时第5页不是0005，只是5。<br><br>【输入】<br><br>       一个正整数N(N≤109)，表示总的页码。<br><br>【输出】<br><br>       共十行：第k行为数字k-1的个数。<br><br>【样例】<br><br>       count.in                        count.out<br><br>       11                                1<br><br>                                          4<br><br>                                          1<br><br>                                          1<br><br>         &nbsp;&nbsp;<a href='http://www.cppblog.com/AllKillMan/archive/2011/08/18/153798.html'>阅读全文</a><img src ="http://www.cppblog.com/AllKillMan/aggbug/153798.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/AllKillMan/" target="_blank">AK</a> 2011-08-18 19:26 <a href="http://www.cppblog.com/AllKillMan/archive/2011/08/18/153798.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>HDU 1029 Ignatius and the Princess IV</title><link>http://www.cppblog.com/AllKillMan/archive/2011/08/16/153573.html</link><dc:creator>AK</dc:creator><author>AK</author><pubDate>Tue, 16 Aug 2011 09:10:00 GMT</pubDate><guid>http://www.cppblog.com/AllKillMan/archive/2011/08/16/153573.html</guid><wfw:comment>http://www.cppblog.com/AllKillMan/comments/153573.html</wfw:comment><comments>http://www.cppblog.com/AllKillMan/archive/2011/08/16/153573.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/AllKillMan/comments/commentRss/153573.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/AllKillMan/services/trackbacks/153573.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: HDU 1029 Ignatius and the Princess IV<br>给N个数字， N为奇数， 输出出现次数大于 N / 2 的数&nbsp;&nbsp;<a href='http://www.cppblog.com/AllKillMan/archive/2011/08/16/153573.html'>阅读全文</a><img src ="http://www.cppblog.com/AllKillMan/aggbug/153573.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/AllKillMan/" target="_blank">AK</a> 2011-08-16 17:10 <a href="http://www.cppblog.com/AllKillMan/archive/2011/08/16/153573.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>HDU 1280 前m大的数</title><link>http://www.cppblog.com/AllKillMan/archive/2011/08/16/153571.html</link><dc:creator>AK</dc:creator><author>AK</author><pubDate>Tue, 16 Aug 2011 08:40:00 GMT</pubDate><guid>http://www.cppblog.com/AllKillMan/archive/2011/08/16/153571.html</guid><wfw:comment>http://www.cppblog.com/AllKillMan/comments/153571.html</wfw:comment><comments>http://www.cppblog.com/AllKillMan/archive/2011/08/16/153571.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/AllKillMan/comments/commentRss/153571.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/AllKillMan/services/trackbacks/153571.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: HDU 1280 前m大的数<br>给定的N个整数序列， 两两求和，从大到小输出M个和数。<br>因为所有整数不超过5000，则相加不会超过10000，可以<br>用哈希解决。&nbsp;&nbsp;<a href='http://www.cppblog.com/AllKillMan/archive/2011/08/16/153571.html'>阅读全文</a><img src ="http://www.cppblog.com/AllKillMan/aggbug/153571.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/AllKillMan/" target="_blank">AK</a> 2011-08-16 16:40 <a href="http://www.cppblog.com/AllKillMan/archive/2011/08/16/153571.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>