<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[MForever的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/MForever</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; MForever]]></copyright><item><title><![CDATA[数分？分数！]]></title><link>https://blog.youkuaiyun.com/MForever/article/details/6768129</link><guid>https://blog.youkuaiyun.com/MForever/article/details/6768129</guid><author>MForever</author><pubDate>Sun, 11 Sep 2011 23:32:38 +0800</pubDate><description><![CDATA[题目描述
在被数分课完虐之后LazyChild决定去研究分数。他发现一件很有爱的事情，很多分数的小数形式四舍五入到某一位后都是一样的。比如四舍五入到千分位之后等于0.500的有12，5001000，甚至还有6001201，2893257869 等。LazyChild现在给你一个]]></description><category></category></item><item><title><![CDATA[食物链]]></title><link>https://blog.youkuaiyun.com/MForever/article/details/6744691</link><guid>https://blog.youkuaiyun.com/MForever/article/details/6744691</guid><author>MForever</author><pubDate>Fri, 02 Sep 2011 23:57:53 +0800</pubDate><description><![CDATA[【NOI2001】食物链(normal)

 



Time Limit:10000MS  Memory Limit:65536K
Total Submit:119 Accepted:45
Description
动物王国中有三类动物A,B,C，这三类动物的食]]></description><category></category></item><item><title><![CDATA[对拍程序]]></title><link>https://blog.youkuaiyun.com/MForever/article/details/6718043</link><guid>https://blog.youkuaiyun.com/MForever/article/details/6718043</guid><author>MForever</author><pubDate>Thu, 25 Aug 2011 13:19:40 +0800</pubDate><description><![CDATA[在信息学竞赛中，尤其是考试的时候，经常会出现把水题写水的情况，而题目那一两个单薄的测试数据常常不足以让我们发现自己程序中的BUG。在竞赛时，水题悲剧了的话下场一定会很惨。在这种情况下，我们可以采用写一个对拍程序的方法来大大降低出错的可能。
基本思路是对于一道题目来讲，写出高效算]]></description><category></category></item><item><title><![CDATA[最大连续子序列的和]]></title><link>https://blog.youkuaiyun.com/MForever/article/details/6717899</link><guid>https://blog.youkuaiyun.com/MForever/article/details/6717899</guid><author>MForever</author><pubDate>Thu, 25 Aug 2011 13:01:10 +0800</pubDate><description><![CDATA[【培训试题】最大连续子序列的和

 



Time Limit:10000MS  Memory Limit:65536K
Total Submit:877 Accepted:427
Case Time Limit:1000MS
Description
　　求]]></description><category></category></item><item><title><![CDATA[灯的排列问题]]></title><link>https://blog.youkuaiyun.com/MForever/article/details/6633452</link><guid>https://blog.youkuaiyun.com/MForever/article/details/6633452</guid><author>MForever</author><pubDate>Tue, 26 Jul 2011 00:42:53 +0800</pubDate><description><![CDATA[【1995提高】灯的排列问题 Time Limit:1000MS  Memory Limit:65536KTotal Submit:731 Accepted:366Description设在一排上有N个格子（N≤20），若在格子中放置有不同颜色的灯，每种灯的个数记为N1，N2，…]]></description><category></category></item><item><title><![CDATA[集合问题]]></title><link>https://blog.youkuaiyun.com/MForever/article/details/6633342</link><guid>https://blog.youkuaiyun.com/MForever/article/details/6633342</guid><author>MForever</author><pubDate>Mon, 25 Jul 2011 23:33:35 +0800</pubDate><description><![CDATA[【培训试题】集合问题(easy) Time Limit:1000MS  Memory Limit:65536KTotal Submit:1035 Accepted:324Description　　集合的前N个元素：编一个程序，按递增次序生成集合M的最小的N个数，M的定义如下：]]></description><category></category></item><item><title><![CDATA[多项式相加]]></title><link>https://blog.youkuaiyun.com/MForever/article/details/6630014</link><guid>https://blog.youkuaiyun.com/MForever/article/details/6630014</guid><author>MForever</author><pubDate>Sun, 24 Jul 2011 19:03:27 +0800</pubDate><description><![CDATA[【培训试题】多项式相加(normal) Time Limit:1000MS  Memory Limit:65536KTotal Submit:1109 Accepted:212Description求两个一元多项式的和。输入多项式方式为，多项式项数，每项系数；如求多项式2x2+3]]></description><category></category></item><item><title><![CDATA[免费馅饼]]></title><link>https://blog.youkuaiyun.com/MForever/article/details/6628300</link><guid>https://blog.youkuaiyun.com/MForever/article/details/6628300</guid><author>MForever</author><pubDate>Sat, 23 Jul 2011 17:25:21 +0800</pubDate><description><![CDATA[【模拟试题】免费馅饼 Time Limit:10000MS  Memory Limit:65536KTotal Submit:161 Accepted:69 Description 　　SERKOI最新推出了一种叫做“免费馅饼”的游戏:游戏在一个舞台上进行。舞台的宽度为W格，天幕]]></description><category></category></item></channel></rss>