Wed, 17 Jun 2009 09:50:00 GMThttp://blog.csdn.net/liangbch/http://blog.csdn.net/liangbch/archive/2009/06/17/4275388.aspxhttp://blog.csdn.net/liangbch/comments/4275388.aspx0http://blog.csdn.net/liangbch/comments/commentRss/4275388.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=4275388本文独辟蹊径，用物理化学概念来分析和描述自然数的性质。<img src ="http://blog.csdn.net/liangbch/aggbug/4275388.aspx" width = "1" height = "1" /><img src="http://www1.feedsky.com/t1/236632604/liangbch/csdn.net/s.gif?r=http://blog.csdn.net/liangbch/archive/2009/06/17/4275388.aspx" border="0" height="0" width="0" style="position:absolute" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/liangbch/236632604/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/liangbch/236632604/art01.gif" onerror="this.style.display='none'" /></a></p>Wed, 17 Jun 2009 17:50:00 +0800liangbchhttp://blog.csdn.net/liangbch/archive/2009/06/17/4275388.aspx#Feedbackhttp://blog.csdn.net/liangbch/archive/2009/06/17/4275388.aspxliangbchhttp://blog.csdn.net/liangbch/archive/2009/06/17/4275388.aspxhttp://blog.csdn.net/liangbch/feed.aspxcsdn.net/liangbch/~1136362/236632604/1136352http://blog.csdn.net/liangbch/archive/2008/11/05/3230535.aspxhttp://blog.csdn.net/liangbch/comments/3230535.aspx2http://blog.csdn.net/liangbch/comments/commentRss/3230535.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=3230535在 http://numbers.computation.free.fr中看到几个特别的程序，仅仅3-4行代码，却可以将圆周率，e（自然对数的底），log(2), 2的平方根 计算到数千位。这里将他们贴出来，方便大家学习。<img src ="http://blog.csdn.net/liangbch/aggbug/3230535.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/liangbch/236632605/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/liangbch/236632605/art01.gif" onerror="this.style.display='none'" /></a></p>Thu, 06 Nov 2008 07:43:00 +0800liangbchhttp://blog.csdn.net/liangbch/archive/2008/11/05/3230535.aspx#Feedbackhttp://blog.csdn.net/liangbch/archive/2008/11/05/3230535.aspxliangbchhttp://blog.csdn.net/liangbch/archive/2008/11/05/3230535.aspxhttp://blog.csdn.net/liangbch/feed.aspxcsdn.net/liangbch/~1136362/236632605/1136352http://blog.csdn.net/liangbch/archive/2008/11/05/3230428.aspxhttp://blog.csdn.net/liangbch/comments/3230428.aspx42http://blog.csdn.net/liangbch/comments/commentRss/3230428.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=3230428  本文给出一个仅用4行代码计算10000以内任意数的阶乘的例子，文中从一个最基本的代码开始，给出代码压缩的详细过程，直至最终的代码达到4行以内。<img src ="http://blog.csdn.net/liangbch/aggbug/3230428.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/liangbch/236632606/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/liangbch/236632606/art01.gif" onerror="this.style.display='none'" /></a></p>Thu, 06 Nov 2008 07:21:00 +0800liangbchhttp://blog.csdn.net/liangbch/archive/2008/11/05/3230428.aspx#Feedbackhttp://blog.csdn.net/liangbch/archive/2008/11/05/3230428.aspxliangbchhttp://blog.csdn.net/liangbch/archive/2008/11/05/3230428.aspxhttp://blog.csdn.net/liangbch/feed.aspxcsdn.net/liangbch/~1136362/236632606/1136352http://blog.csdn.net/liangbch/archive/2008/01/24/2064108.aspxhttp://blog.csdn.net/liangbch/comments/2064108.aspx3http://blog.csdn.net/liangbch/comments/commentRss/2064108.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=2064108本文给出将实数 转化为 一定范围内的 分数的 算法和代码，并给出误差分析。<img src ="http://blog.csdn.net/liangbch/aggbug/2064108.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/liangbch/236632607/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/liangbch/236632607/art01.gif" onerror="this.style.display='none'" /></a></p>Fri, 25 Jan 2008 05:47:00 +0800liangbchhttp://blog.csdn.net/liangbch/archive/2008/01/24/2064108.aspx#Feedbackhttp://blog.csdn.net/liangbch/archive/2008/01/24/2064108.aspxliangbchhttp://blog.csdn.net/liangbch/archive/2008/01/24/2064108.aspxhttp://blog.csdn.net/liangbch/feed.aspxcsdn.net/liangbch/~1136362/236632607/1136352http://blog.csdn.net/liangbch/archive/2007/04/19/1569970.aspxhttp://blog.csdn.net/liangbch/comments/1569970.aspx1http://blog.csdn.net/liangbch/comments/commentRss/1569970.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1569970张一飞是3届(2000,2001,2002)IOI国家集训队的成员，第14届（2002年，韩国龙仁市庆熙大学）国际信息学奥林匹克竞赛金牌获得者，本文是张一飞2001的论文，原文标题求N!的高精度算法。<img src ="http://blog.csdn.net/liangbch/aggbug/1569970.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/liangbch/236632608/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/liangbch/236632608/art01.gif" onerror="this.style.display='none'" /></a></p>Thu, 19 Apr 2007 16:30:00 +0800liangbchhttp://blog.csdn.net/liangbch/archive/2007/04/19/1569970.aspx#Feedbackhttp://blog.csdn.net/liangbch/archive/2007/04/19/1569970.aspxliangbchhttp://blog.csdn.net/liangbch/archive/2007/04/19/1569970.aspxhttp://blog.csdn.net/liangbch/feed.aspxcsdn.net/liangbch/~1136362/236632608/1136352http://blog.csdn.net/liangbch/archive/2007/04/19/1569967.aspxhttp://blog.csdn.net/liangbch/comments/1569967.aspx0http://blog.csdn.net/liangbch/comments/commentRss/1569967.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1569967本文提供了2个计算阶乘的程序。第1个程序采用在C中嵌入汇编代码的方法，改进上篇中了程序2的瓶颈部分，使速度提高到原先的3倍多。第2个程序进一步改进了算法，在计算1万的阶乘精确值时，比上一篇中的程序2快5-6倍，计算10000的阶乘的精确值，在迅驰1.7G的仅需0.25秒。<img src ="http://blog.csdn.net/liangbch/aggbug/1569967.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/liangbch/236632609/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/liangbch/236632609/art01.gif" onerror="this.style.display='none'" /></a></p>Thu, 19 Apr 2007 16:17:00 +0800liangbchhttp://blog.csdn.net/liangbch/archive/2007/04/19/1569967.aspx#Feedbackhttp://blog.csdn.net/liangbch/archive/2007/04/19/1569967.aspxliangbchhttp://blog.csdn.net/liangbch/archive/2007/04/19/1569967.aspxhttp://blog.csdn.net/liangbch/feed.aspxcsdn.net/liangbch/~1136362/236632609/1136352http://blog.csdn.net/liangbch/archive/2007/04/19/1569963.aspxhttp://blog.csdn.net/liangbch/comments/1569963.aspx0http://blog.csdn.net/liangbch/comments/commentRss/1569963.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1569963本文采用和《大数阶乘之计算从入门到精通―入门篇之一》几乎相同的算法思想计算阶乘，和上篇不同，本文给出的程序采用一个数组元素表示4位或者9位10进制数的方法，使得计算速度更快，占用内存更省。本文给出两个计算阶乘的函数，程序代码简洁，速度也不慢。其中第一个程序在计算1万的阶乘时需约18.5K的内存，在迅驰1.7G笔记本用时为0.86秒 。<img src ="http://blog.csdn.net/liangbch/aggbug/1569963.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/liangbch/236632610/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/liangbch/236632610/art01.gif" onerror="this.style.display='none'" /></a></p>Thu, 19 Apr 2007 16:07:00 +0800liangbchhttp://blog.csdn.net/liangbch/archive/2007/04/19/1569963.aspx#Feedbackhttp://blog.csdn.net/liangbch/archive/2007/04/19/1569963.aspxliangbchhttp://blog.csdn.net/liangbch/archive/2007/04/19/1569963.aspxhttp://blog.csdn.net/liangbch/feed.aspxcsdn.net/liangbch/~1136362/236632610/1136352http://blog.csdn.net/liangbch/archive/2007/04/18/1569873.aspxhttp://blog.csdn.net/liangbch/comments/1569873.aspx3http://blog.csdn.net/liangbch/comments/commentRss/1569873.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1569873这是一个名叫仲晨的中学生写的论文，作者对利用Stirling公式求大数阶乘的近似值进行了不懈的探索，写出了很不错的论文。但仔细分析一下就会知道，他得到的结论仍然时Stringling公式的高阶形式。原文见http://heymu.com/2006/03/myheimu-paper-stirling-jiecheng.html。<img src ="http://blog.csdn.net/liangbch/aggbug/1569873.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/liangbch/236632611/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/liangbch/236632611/art01.gif" onerror="this.style.display='none'" /></a></p>Thu, 19 Apr 2007 07:45:00 +0800liangbchhttp://blog.csdn.net/liangbch/archive/2007/04/18/1569873.aspx#Feedbackhttp://blog.csdn.net/liangbch/archive/2007/04/18/1569873.aspxliangbchhttp://blog.csdn.net/liangbch/archive/2007/04/18/1569873.aspxhttp://blog.csdn.net/liangbch/feed.aspxcsdn.net/liangbch/~1136362/236632611/1136352http://blog.csdn.net/liangbch/archive/2007/04/18/1569665.aspxhttp://blog.csdn.net/liangbch/comments/1569665.aspx1http://blog.csdn.net/liangbch/comments/commentRss/1569665.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1569665本文讨论如何使用一个简单的算法计算一个大整数的阶乘，并给出一个完整的计算大数阶乘的程序。该程序计算10000的阶乘的精确值需2.7秒。<img src ="http://blog.csdn.net/liangbch/aggbug/1569665.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/liangbch/236632612/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/liangbch/236632612/art01.gif" onerror="this.style.display='none'" /></a></p>Thu, 19 Apr 2007 04:54:00 +0800liangbchhttp://blog.csdn.net/liangbch/archive/2007/04/18/1569665.aspx#Feedbackhttp://blog.csdn.net/liangbch/archive/2007/04/18/1569665.aspxliangbchhttp://blog.csdn.net/liangbch/archive/2007/04/18/1569665.aspxhttp://blog.csdn.net/liangbch/feed.aspxcsdn.net/liangbch/~1136362/236632612/1136352http://blog.csdn.net/liangbch/archive/2007/04/13/1563407.aspxhttp://blog.csdn.net/liangbch/comments/1563407.aspx1http://blog.csdn.net/liangbch/comments/commentRss/1563407.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1563407本文详细的讨论了在windows平台中，测量程序运行时间的几个函数，GetTickCount, QueryPerformanceCounter和RDTSC，并给出示例代码。<img src ="http://blog.csdn.net/liangbch/aggbug/1563407.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/liangbch/236632613/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/liangbch/236632613/art01.gif" onerror="this.style.display='none'" /></a></p>Fri, 13 Apr 2007 22:11:00 +0800liangbchhttp://blog.csdn.net/liangbch/archive/2007/04/13/1563407.aspx#Feedbackhttp://blog.csdn.net/liangbch/archive/2007/04/13/1563407.aspxliangbchhttp://blog.csdn.net/liangbch/archive/2007/04/13/1563407.aspxhttp://blog.csdn.net/liangbch/feed.aspxcsdn.net/liangbch/~1136362/236632613/1136352