Wed, 01 Jul 2009 13:17:00 GMThttp://blog.csdn.net/baihacker/http://blog.csdn.net/baihacker/archive/2009/07/01/4312746.aspxhttp://blog.csdn.net/baihacker/comments/4312746.aspx0http://blog.csdn.net/baihacker/comments/commentRss/4312746.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=4312746后缀数组--倍增法实现,实现比较粗糙,速度慢,内存需求也大.<img src ="http://blog.csdn.net/baihacker/aggbug/4312746.aspx" width = "1" height = "1" /><img src="http://www1.feedsky.com/t1/239511359/baihacker/csdn.net/s.gif?r=http://blog.csdn.net/baihacker/archive/2009/07/01/4312746.aspx" border="0" height="0" width="0" style="position:absolute" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/baihacker/239511359/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/baihacker/239511359/art01.gif" onerror="this.style.display='none'" /></a></p>Wed, 01 Jul 2009 21:17:00 +0800baihackerhttp://blog.csdn.net/baihacker/archive/2009/07/01/4312746.aspx#Feedbackhttp://blog.csdn.net/baihacker/archive/2009/07/01/4312746.aspxbaihackerhttp://blog.csdn.net/baihacker/archive/2009/07/01/4312746.aspxhttp://blog.csdn.net/baihacker/rss.aspxcsdn.net/baihacker/~1335615/239511359/1340525http://blog.csdn.net/baihacker/archive/2009/07/01/4312721.aspxhttp://blog.csdn.net/baihacker/comments/4312721.aspx0http://blog.csdn.net/baihacker/comments/commentRss/4312721.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=4312721Shift-Or,Shift-And,KMP算法的C++实现.<img src ="http://blog.csdn.net/baihacker/aggbug/4312721.aspx" width = "1" height = "1" /><img src="http://www1.feedsky.com/t1/239510011/baihacker/csdn.net/s.gif?r=http://blog.csdn.net/baihacker/archive/2009/07/01/4312721.aspx" border="0" height="0" width="0" style="position:absolute" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/baihacker/239510011/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/baihacker/239510011/art01.gif" onerror="this.style.display='none'" /></a></p>Wed, 01 Jul 2009 21:07:00 +0800baihackerhttp://blog.csdn.net/baihacker/archive/2009/07/01/4312721.aspx#Feedbackhttp://blog.csdn.net/baihacker/archive/2009/07/01/4312721.aspxbaihackerhttp://blog.csdn.net/baihacker/archive/2009/07/01/4312721.aspxhttp://blog.csdn.net/baihacker/rss.aspxcsdn.net/baihacker/~1335615/239510011/1340525http://blog.csdn.net/baihacker/archive/2009/02/09/3869526.aspxhttp://blog.csdn.net/baihacker/comments/3869526.aspx0http://blog.csdn.net/baihacker/comments/commentRss/3869526.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=3869526<br />#include "../../MatLib/MathLib.h" #include using namespace std; using namespace MathLib; using namespace MathLib::Matrix; int solve() { //和求解问题相关的常数 const Int32 nPoint = 12; const Int32 nDOF = 2; const Int32 nTotalDOF = nPoint * nDOF; const Int32 nFixedPoint = 2; const Int32 nElement = 5; const Int32 nNode = 4; const Int32 nEDOF = nNode * nDOF; // const Int32 nDime = 2; //材料常数 const Float young = 1500; const Float poiss = 0.01; //高斯积分常数<img src ="http://blog.csdn.net/baihacker/aggbug/3869526.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/baihacker/239510012/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/baihacker/239510012/art01.gif" onerror="this.style.display='none'" /></a></p>Mon, 09 Feb 2009 10:27:00 +0800白良http://blog.csdn.net/baihacker/archive/2009/02/09/3869526.aspx#Feedbackhttp://blog.csdn.net/baihacker/archive/2009/02/09/3869526.aspx白良http://blog.csdn.net/baihacker/archive/2009/02/09/3869526.aspxhttp://blog.csdn.net/baihacker/rss.aspxcsdn.net/baihacker/~1335615/239510012/1340525http://blog.csdn.net/baihacker/archive/2008/08/22/2816282.aspxhttp://blog.csdn.net/baihacker/comments/2816282.aspx4http://blog.csdn.net/baihacker/comments/commentRss/2816282.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=2816282QQ群,面试,C++,题<img src ="http://blog.csdn.net/baihacker/aggbug/2816282.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/baihacker/239510013/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/baihacker/239510013/art01.gif" onerror="this.style.display='none'" /></a></p>Sat, 23 Aug 2008 04:06:00 +0800白良http://blog.csdn.net/baihacker/archive/2008/08/22/2816282.aspx#Feedbackhttp://blog.csdn.net/baihacker/archive/2008/08/22/2816282.aspx白良http://blog.csdn.net/baihacker/archive/2008/08/22/2816282.aspxhttp://blog.csdn.net/baihacker/rss.aspxcsdn.net/baihacker/~1335615/239510013/1340525http://blog.csdn.net/baihacker/archive/2008/08/20/2803385.aspxhttp://blog.csdn.net/baihacker/comments/2803385.aspx5http://blog.csdn.net/baihacker/comments/commentRss/2803385.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=2803385AVL(平衡树)C++代码(非递归),非递归无辅助辅助数据结构前序后序遍历二叉树<img src ="http://blog.csdn.net/baihacker/aggbug/2803385.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/baihacker/239510014/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/baihacker/239510014/art01.gif" onerror="this.style.display='none'" /></a></p>Thu, 21 Aug 2008 03:47:00 +0800白良http://blog.csdn.net/baihacker/archive/2008/08/20/2803385.aspx#Feedbackhttp://blog.csdn.net/baihacker/archive/2008/08/20/2803385.aspx白良http://blog.csdn.net/baihacker/archive/2008/08/20/2803385.aspxhttp://blog.csdn.net/baihacker/rss.aspxcsdn.net/baihacker/~1335615/239510014/1340525http://blog.csdn.net/baihacker/archive/2008/08/20/2803362.aspxhttp://blog.csdn.net/baihacker/comments/2803362.aspx12http://blog.csdn.net/baihacker/comments/commentRss/2803362.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=2803362KMP算法的C++代码<img src ="http://blog.csdn.net/baihacker/aggbug/2803362.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/baihacker/239510015/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/baihacker/239510015/art01.gif" onerror="this.style.display='none'" /></a></p>Thu, 21 Aug 2008 03:36:00 +0800白良http://blog.csdn.net/baihacker/archive/2008/08/20/2803362.aspx#Feedbackhttp://blog.csdn.net/baihacker/archive/2008/08/20/2803362.aspx白良http://blog.csdn.net/baihacker/archive/2008/08/20/2803362.aspxhttp://blog.csdn.net/baihacker/rss.aspxcsdn.net/baihacker/~1335615/239510015/1340525http://blog.csdn.net/baihacker/archive/2008/06/15/2550869.aspxhttp://blog.csdn.net/baihacker/comments/2550869.aspx12http://blog.csdn.net/baihacker/comments/commentRss/2550869.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=2550869金山招聘题目:编程计算从1到2008080808之间的整数有多少个含有数字7<img src ="http://blog.csdn.net/baihacker/aggbug/2550869.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/baihacker/239510016/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/baihacker/239510016/art01.gif" onerror="this.style.display='none'" /></a></p>Mon, 16 Jun 2008 05:00:00 +0800白良http://blog.csdn.net/baihacker/archive/2008/06/15/2550869.aspx#Feedbackhttp://blog.csdn.net/baihacker/archive/2008/06/15/2550869.aspx白良http://blog.csdn.net/baihacker/archive/2008/06/15/2550869.aspxhttp://blog.csdn.net/baihacker/rss.aspxcsdn.net/baihacker/~1335615/239510016/1340525http://blog.csdn.net/baihacker/archive/2008/06/15/2550859.aspxhttp://blog.csdn.net/baihacker/comments/2550859.aspx1http://blog.csdn.net/baihacker/comments/commentRss/2550859.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=2550859化循环为递归的算子<img src ="http://blog.csdn.net/baihacker/aggbug/2550859.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/baihacker/239510017/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/baihacker/239510017/art01.gif" onerror="this.style.display='none'" /></a></p>Mon, 16 Jun 2008 04:57:00 +0800白良http://blog.csdn.net/baihacker/archive/2008/06/15/2550859.aspx#Feedbackhttp://blog.csdn.net/baihacker/archive/2008/06/15/2550859.aspx白良http://blog.csdn.net/baihacker/archive/2008/06/15/2550859.aspxhttp://blog.csdn.net/baihacker/rss.aspxcsdn.net/baihacker/~1335615/239510017/1340525http://blog.csdn.net/baihacker/archive/2008/06/15/2549965.aspxhttp://blog.csdn.net/baihacker/comments/2549965.aspx0http://blog.csdn.net/baihacker/comments/commentRss/2549965.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=2549965用递归写的大数运算<img src ="http://blog.csdn.net/baihacker/aggbug/2549965.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/baihacker/239510018/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/baihacker/239510018/art01.gif" onerror="this.style.display='none'" /></a></p>Mon, 16 Jun 2008 00:19:00 +0800白良http://blog.csdn.net/baihacker/archive/2008/06/15/2549965.aspx#Feedbackhttp://blog.csdn.net/baihacker/archive/2008/06/15/2549965.aspx白良http://blog.csdn.net/baihacker/archive/2008/06/15/2549965.aspxhttp://blog.csdn.net/baihacker/rss.aspxcsdn.net/baihacker/~1335615/239510018/1340525http://blog.csdn.net/baihacker/archive/2008/04/06/2254369.aspxhttp://blog.csdn.net/baihacker/comments/2254369.aspx0http://blog.csdn.net/baihacker/comments/commentRss/2254369.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=2254369非递归生成所有排列(knuth)<img src ="http://blog.csdn.net/baihacker/aggbug/2254369.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/baihacker/239510019/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/baihacker/239510019/art01.gif" onerror="this.style.display='none'" /></a></p>Sun, 06 Apr 2008 18:59:00 +0800baihackerhttp://blog.csdn.net/baihacker/archive/2008/04/06/2254369.aspx#Feedbackhttp://blog.csdn.net/baihacker/archive/2008/04/06/2254369.aspxbaihackerhttp://blog.csdn.net/baihacker/archive/2008/04/06/2254369.aspxhttp://blog.csdn.net/baihacker/rss.aspxcsdn.net/baihacker/~1335615/239510019/1340525