C++博客-LonelyTree的心路历程-最新评论http://www.cppblog.com/LonelyTree/CommentsRSS.aspx[MSN: LonelyTree@hotmail.com] [EMAIL: lanshen3333@126.com]zh-cnTue, 23 Sep 2008 03:24:00 GMTTue, 23 Sep 2008 03:24:00 GMTcnblogsre: 开灯问题http://www.cppblog.com/LonelyTree/archive/2008/09/23/62473.html#62637望尘追梦望尘追梦Tue, 23 Sep 2008 14:51:00 GMThttp://www.cppblog.com/LonelyTree/archive/2008/09/23/62473.html#62637嗯，好的想法！
其实这个还有更好的做法，可以把这个O(n*logn)降到O(n)的算法！这个关键是对实质的分析(提示:因子的个数).

望尘追梦 2008-09-23 22:51 发表评论
]]>re: 经典小说（两部）http://www.cppblog.com/LonelyTree/archive/2008/09/23/62470.html#62631望尘追梦望尘追梦Tue, 23 Sep 2008 14:01:00 GMThttp://www.cppblog.com/LonelyTree/archive/2008/09/23/62470.html#62631

望尘追梦 2008-09-23 22:01 发表评论
]]>re: 经典小说（两部）http://www.cppblog.com/LonelyTree/archive/2008/09/23/62470.html#62561聂元朗聂元朗Tue, 23 Sep 2008 03:24:00 GMThttp://www.cppblog.com/LonelyTree/archive/2008/09/23/62470.html#62561

聂元朗 2008-09-23 11:24 发表评论
]]>re: 开灯问题http://www.cppblog.com/LonelyTree/archive/2008/09/23/62473.html#62542聂元朗聂元朗Tue, 23 Sep 2008 00:21:00 GMThttp://www.cppblog.com/LonelyTree/archive/2008/09/23/62473.html#62542array[1] = !(array[i]);

聂元朗 2008-09-23 08:21 发表评论
]]>re: 经典小说（两部）http://www.cppblog.com/LonelyTree/archive/2008/09/23/62470.html#62538milkywaymilkywayMon, 22 Sep 2008 17:19:00 GMThttp://www.cppblog.com/LonelyTree/archive/2008/09/23/62470.html#62538

milkyway 2008-09-23 01:19 发表评论
]]>