﻿<?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>博客园-Scorpio'sWeekend-最新评论</title><link>http://www.cnblogs.com/ScorpioLove/CommentsRSS.aspx</link><description>天蝎座的周末</description><language>zh-cn</language><pubDate>Tue, 18 Sep 2007 09:24:00 GMT</pubDate><lastBuildDate>Tue, 18 Sep 2007 09:24:00 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 1000 的阶乘有几位数?</title><link>http://www.cnblogs.com/ScorpioLove/archive/2008/07/09/541866.html#1250000</link><dc:creator>tear086</dc:creator><author>tear086</author><pubDate>Wed, 09 Jul 2008 12:20:26 GMT</pubDate><guid>http://www.cnblogs.com/ScorpioLove/archive/2008/07/09/541866.html#1250000</guid><description><![CDATA[Mathmetica 计算结果<br>402387260077093773543702433923003985719374864210714632543799910429938512398629020592044208486969404800479988610197196058631666872994808558901323829669944590997424504087073759918823627727188732519779505950995276120874975462497043601418278094646496291056393887437886487337119181045825783647849977012476632889835955735432513185323958463075557409114262417474349347553428646576611667797396668820291207379143853719588249808126867838374559731746136085379534524221586593201928090878297308431392844403281231558611036976801357304216168747609675871348312025478589320767169132448426236131412508780208000261683151027341827977704784635868170164365024153691398281264810213092761244896359928705114964975419909342221566832572080821333186116811553615836546984046708975602900950537616475847728421889679646244945160765353408198901385442487984959953319101723355556602139450399736280750137837615307127761926849034352625200015888535147331611702103968175921510907788019393178114194545257223865541461062892187960223838971476088506276862967146674697562911234082439208160153780889893964518263243671616762179168909779911903754031274622289988005195444414282012187361745992642956581746628302955570299024324153181617210465832036786906117260158783520751516284225540265170483304226143974286933061690897968482590125458327168226458066526769958652682272807075781391858178889652208164348344825993266043367660176999612831860788386150279465955131156552036093988180612138558600301435694527224206344631797460594682573103790084024432438465657245014402821885252470935190620929023136493273497565513958720559654228749774011413346962715422845862377387538230483865688976461927383814900140767310446640259899490222221765904339901886018566526485061799702356193897017860040811889729918311021171229845901641921068884387121855646124960798722908519296819372388642614839657382291123125024186649353143970137428531926649875337218940694281434118520158014123344828015051399694290153483077644569099073152433278288269864602789864321139083506217095002597389863554277196742822248757586765752344220207573630569498825087968928162753848863396909959826280956121450994871701244516461260379029309120889086942028510640182154399457156805941872748998094254742173582401063677404595741785160829230135358081840096996372524230560855903700624271243416909004153690105933983835777939410970027753472000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/ScorpioLove/" target="_blank">tear086</a> 2008-07-09 20:20 <a href="http://www.cnblogs.com/ScorpioLove/archive/2008/07/09/541866.html#1250000#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: [转]FVWM的配置文件 - archerC@kyxk.net</title><link>http://www.cnblogs.com/ScorpioLove/archive/2008/07/02/449897.html#1242681</link><dc:creator>=KK=</dc:creator><author>=KK=</author><pubDate>Wed, 02 Jul 2008 09:55:47 GMT</pubDate><guid>http://www.cnblogs.com/ScorpioLove/archive/2008/07/02/449897.html#1242681</guid><description><![CDATA[在用了，修改了一下，效果不错。<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/ScorpioLove/" target="_blank">=KK=</a> 2008-07-02 17:55 <a href="http://www.cnblogs.com/ScorpioLove/archive/2008/07/02/449897.html#1242681#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 1000 的阶乘有几位数? - 后续, 求解</title><link>http://www.cnblogs.com/ScorpioLove/archive/2007/09/18/617585.html#897525</link><dc:creator>foobar</dc:creator><author>foobar</author><pubDate>Tue, 18 Sep 2007 09:53:00 GMT</pubDate><guid>http://www.cnblogs.com/ScorpioLove/archive/2007/09/18/617585.html#897525</guid><description><![CDATA[居然看到了牛顿莱布尼茨公式。。。。。<br><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/ScorpioLove/" target="_blank">foobar</a> 2007-09-18 17:53 <a href="http://www.cnblogs.com/ScorpioLove/archive/2007/09/18/617585.html#897525#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 一个小题目</title><link>http://www.cnblogs.com/ScorpioLove/archive/2007/09/18/629351.html#897483</link><dc:creator>foobar</dc:creator><author>foobar</author><pubDate>Tue, 18 Sep 2007 09:24:00 GMT</pubDate><guid>http://www.cnblogs.com/ScorpioLove/archive/2007/09/18/629351.html#897483</guid><description><![CDATA[看到一个说8次搞定的<br><br>六个第一比赛，得到前三，然后这三个的小组第二替换他们在和另外三个第一比赛<br>再次得到前三<br><br>不过ms不严密<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/ScorpioLove/" target="_blank">foobar</a> 2007-09-18 17:24 <a href="http://www.cnblogs.com/ScorpioLove/archive/2007/09/18/629351.html#897483#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 1000 的阶乘有几位数? - 后续, 求解</title><link>http://www.cnblogs.com/ScorpioLove/archive/2007/04/24/617585.html#725161</link><dc:creator>ScorpioLove</dc:creator><author>ScorpioLove</author><pubDate>Tue, 24 Apr 2007 05:26:00 GMT</pubDate><guid>http://www.cnblogs.com/ScorpioLove/archive/2007/04/24/617585.html#725161</guid><description><![CDATA[谢谢各位回复，同时希望能原谅我不能及时的回复各位。<br><br>@ 蔡晖<br><br>事实上这个问题，我在计算前也考虑过，确实有误差，不过就像 wqx 说的，只要误差可接受就可以了，像这里的误差相对于实际结果而言是比较小的，可以接受。<br><br>@ wqx<br><br>关于红字部分，我在算式前面的括号里注明了，10 和 100 是原来算式里就有的，但我觉得不该加，所以就用红色标记了一下，可能导致你误以为是我强调要加上的...<br><br>关于 CLRS，我目前正在读，不过感觉好难啊，好多课后题都不会...<br>如果可能，希望能和你交流一下^_^。<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/ScorpioLove/" target="_blank">ScorpioLove</a> 2007-04-24 13:26 <a href="http://www.cnblogs.com/ScorpioLove/archive/2007/04/24/617585.html#725161#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 1000 的阶乘有几位数? - 后续, 求解</title><link>http://www.cnblogs.com/ScorpioLove/archive/2007/04/24/617585.html#724819</link><dc:creator>wqx</dc:creator><author>wqx</author><pubDate>Tue, 24 Apr 2007 02:07:00 GMT</pubDate><guid>http://www.cnblogs.com/ScorpioLove/archive/2007/04/24/617585.html#724819</guid><description><![CDATA[你红字加的内容不对，不应该乘10和100；<br>楼上的说的也不对，把不可直接求职的离散转为积分是基本的方法，只要误差允许接受就可以，具体可以看CLRS的附录A<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/ScorpioLove/" target="_blank">wqx</a> 2007-04-24 10:07 <a href="http://www.cnblogs.com/ScorpioLove/archive/2007/04/24/617585.html#724819#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 1000 的阶乘有几位数? - 后续, 求解</title><link>http://www.cnblogs.com/ScorpioLove/archive/2007/04/18/617585.html#717735</link><dc:creator>蔡晖</dc:creator><author>蔡晖</author><pubDate>Wed, 18 Apr 2007 01:25:00 GMT</pubDate><guid>http://www.cnblogs.com/ScorpioLove/archive/2007/04/18/617585.html#717735</guid><description><![CDATA[把求lgN(N=2.3.4....1000)转换为积分，这个思路就有误差吧。<br>积分是连续的，而这里的N是离散的，所以这里的转换不合理。<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/ScorpioLove/" target="_blank">蔡晖</a> 2007-04-18 09:25 <a href="http://www.cnblogs.com/ScorpioLove/archive/2007/04/18/617585.html#717735#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 1000 的阶乘有几位数?</title><link>http://www.cnblogs.com/ScorpioLove/archive/2007/01/11/541866.html#617597</link><dc:creator>ScorpioLove</dc:creator><author>ScorpioLove</author><pubDate>Thu, 11 Jan 2007 04:25:00 GMT</pubDate><guid>http://www.cnblogs.com/ScorpioLove/archive/2007/01/11/541866.html#617597</guid><description><![CDATA[@qiushengxy<br><br>非常感谢您的回复，其实在不久之后就在小百合上找到了这个方法，不过上不来，没法记录，我已经把该方法写了一篇后续，在 <a target="_new" href="http://www.cnblogs.com/ScorpioLove/archive/2007/01/11/617585.html">http://www.cnblogs.com/ScorpioLove/archive/2007/01/11/617585.html</a>。<br><br>再次感谢 ^-^<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/ScorpioLove/" target="_blank">ScorpioLove</a> 2007-01-11 12:25 <a href="http://www.cnblogs.com/ScorpioLove/archive/2007/01/11/541866.html#617597#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 1000 的阶乘有几位数?</title><link>http://www.cnblogs.com/ScorpioLove/archive/2007/01/10/541866.html#617157</link><dc:creator>qiushengxy</dc:creator><author>qiushengxy</author><pubDate>Wed, 10 Jan 2007 13:24:00 GMT</pubDate><guid>http://www.cnblogs.com/ScorpioLove/archive/2007/01/10/541866.html#617157</guid><description><![CDATA[1&#215;2&#215;3&#215;……&#215;1000 ＝ 0.xyz &#215; 10(N)            //10的N次冥<br>两边同时取10的对数：<br>log10(1) + log10(2) + …… + log10(1000) = log10(0.xyz) + N<br>M.lmn = -0.abc + N<br>then<br>N = M + 1<br><br>等号左边的加法很容易算出M<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/ScorpioLove/" target="_blank">qiushengxy</a> 2007-01-10 21:24 <a href="http://www.cnblogs.com/ScorpioLove/archive/2007/01/10/541866.html#617157#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 排列组合</title><link>http://www.cnblogs.com/ScorpioLove/archive/2006/11/02/534957.html#548328</link><dc:creator>xiaopei</dc:creator><author>xiaopei</author><pubDate>Thu, 02 Nov 2006 12:25:00 GMT</pubDate><guid>http://www.cnblogs.com/ScorpioLove/archive/2006/11/02/534957.html#548328</guid><description><![CDATA[next_permutation 和next_permutation的复杂度为线性。<br>所以<br>    while (prev_permutation(v.begin(), v.end()))<br>    {<br>        PRINT_ELEMENTS( v, &quot;&quot;);<br>    }<br>的做法应该效率很低，应该为0(N*(N!))<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/ScorpioLove/" target="_blank">xiaopei</a> 2006-11-02 20:25 <a href="http://www.cnblogs.com/ScorpioLove/archive/2006/11/02/534957.html#548328#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>
