Tue, 23 Sep 2008 23:26:00 GMTFreshare's codehttp://blog.csdn.net/freshare/http://blog.csdn.net/freshare/archive/2008/09/23/2970356.aspxhttp://blog.csdn.net/freshare/comments/2970356.aspx0http://blog.csdn.net/freshare/comments/commentRss/2970356.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=2970356<img src ="http://blog.csdn.net/freshare/aggbug/2970356.aspx" width = "1" height = "1" />Wed, 24 Sep 2008 07:26:00 +0800清翔兔http://blog.csdn.net/freshare/archive/2008/09/23/2970356.aspx#Feedbackhttp://blog.csdn.net/freshare/archive/2008/09/23/2970356.aspx清翔兔http://blog.csdn.net/freshare/archive/2007/01/01/1471977.aspxhttp://blog.csdn.net/freshare/comments/1471977.aspx0http://blog.csdn.net/freshare/comments/commentRss/1471977.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1471977本Blog即日起暂时停止更新。<img src ="http://blog.csdn.net/freshare/aggbug/1471977.aspx" width = "1" height = "1" />Tue, 02 Jan 2007 04:19:00 +0800清翔兔http://blog.csdn.net/freshare/archive/2007/01/01/1471977.aspx#Feedbackhttp://blog.csdn.net/freshare/archive/2007/01/01/1471977.aspx清翔兔http://blog.csdn.net/freshare/archive/2006/11/16/1388088.aspxhttp://blog.csdn.net/freshare/comments/1388088.aspx0http://blog.csdn.net/freshare/comments/commentRss/1388088.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1388088A singly linked list is a common data structure familiar to all computer scientists. A singly linked list is made of nodes where each node has a pointer to the next node (or null to end the list). A singly linked list is often used as a stack (or last in first out queue (LIFO)) because adding a new fist element, removing the existing first element, and examining the first element are very fast O(1) operations.<img src ="http://blog.csdn.net/freshare/aggbug/1388088.aspx" width = "1" height = "1" />Thu, 16 Nov 2006 22:56:00 +0800清翔兔http://blog.csdn.net/freshare/archive/2006/11/16/1388088.aspx#Feedbackhttp://blog.csdn.net/freshare/archive/2006/11/16/1388088.aspx清翔兔http://blog.csdn.net/freshare/archive/2006/11/16/1388053.aspxhttp://blog.csdn.net/freshare/comments/1388053.aspx0http://blog.csdn.net/freshare/comments/commentRss/1388053.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1388053摘自网络的微软面试题，对于参加面试的同学，非常有参考价值。<img src ="http://blog.csdn.net/freshare/aggbug/1388053.aspx" width = "1" height = "1" />Thu, 16 Nov 2006 22:44:00 +0800清翔兔http://blog.csdn.net/freshare/archive/2006/11/16/1388053.aspx#Feedbackhttp://blog.csdn.net/freshare/archive/2006/11/16/1388053.aspx清翔兔http://blog.csdn.net/freshare/archive/2006/11/15/1385571.aspxhttp://blog.csdn.net/freshare/comments/1385571.aspx0http://blog.csdn.net/freshare/comments/commentRss/1385571.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1385571IT技术类[面试、笔试]心得<img src ="http://blog.csdn.net/freshare/aggbug/1385571.aspx" width = "1" height = "1" />Wed, 15 Nov 2006 20:59:00 +0800清翔兔http://blog.csdn.net/freshare/archive/2006/11/15/1385571.aspx#Feedbackhttp://blog.csdn.net/freshare/archive/2006/11/15/1385571.aspx清翔兔http://blog.csdn.net/freshare/archive/2006/09/19/1248979.aspxhttp://blog.csdn.net/freshare/comments/1248979.aspx0http://blog.csdn.net/freshare/comments/commentRss/1248979.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1248979凯撒密文的破解编程实现 程序原理： 1.Kaiser Recovery 字典智能 破解方法：根据字典文件(dict.txt)，求出明文可最大满足字典内单词的加密key。 程序特色：使用字典，可在无人工干涉的情况下，破解密文。 2.Kaiser Recovery 人工辅助 破解方法：根据密文中字母出现的次数，从高到低，依次对应明文“e”，由用户自行判断是否正确。 3.Kaiser Recovery 传统破解 破解方法：密文中出现概率次数最多的字母对应明文“e”，由此求出key及明文。<img src ="http://blog.csdn.net/freshare/aggbug/1248979.aspx" width = "1" height = "1" />Wed, 20 Sep 2006 03:43:00 +0800清翔兔http://blog.csdn.net/freshare/archive/2006/09/19/1248979.aspx#Feedbackhttp://blog.csdn.net/freshare/archive/2006/09/19/1248979.aspx清翔兔http://blog.csdn.net/freshare/archive/2006/05/21/748409.aspxhttp://blog.csdn.net/freshare/comments/748409.aspx2http://blog.csdn.net/freshare/comments/commentRss/748409.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=748409先后收到10多封邮件(分别来自eguoliang7、小西、路仔旋风、华中二版、小林等)，询问C++电梯程序的问题，我在此给与集中回复： 1.我的程序，模型为2层楼一个电梯 2.将我的程序扩展为N层一个电梯，是可行的，且非常简单的 3.将我的程序扩展为N层N个电梯，我认为是不可行的。 4.由于本人时间有限，几乎不可能给任何人定制程序，这里只好说抱歉。 5.欢迎与我交流程序，如果您愿意，可以将您的程序发给我，我可以为您测试一下，当然我的水平也只是初学者。 6.感谢大家访问我的代码Blog。 <img src ="http://blog.csdn.net/freshare/aggbug/748409.aspx" width = "1" height = "1" />Mon, 22 May 2006 07:40:00 +0800清翔兔http://blog.csdn.net/freshare/archive/2006/05/21/748409.aspx#Feedbackhttp://blog.csdn.net/freshare/archive/2006/05/21/748409.aspx清翔兔http://blog.csdn.net/freshare/archive/2006/03/27/640473.aspxhttp://blog.csdn.net/freshare/comments/640473.aspx0http://blog.csdn.net/freshare/comments/commentRss/640473.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=640473本原元计算，教课书《应用密码学教程》page53，可根据本算法，完成习题ex4-5，清翔兔原创算法，有误请来信纠正。<img src ="http://blog.csdn.net/freshare/aggbug/640473.aspx" width = "1" height = "1" />Tue, 28 Mar 2006 03:52:00 +0800清翔兔http://blog.csdn.net/freshare/archive/2006/03/27/640473.aspx#Feedbackhttp://blog.csdn.net/freshare/archive/2006/03/27/640473.aspx清翔兔http://blog.csdn.net/freshare/archive/2006/03/27/640466.aspxhttp://blog.csdn.net/freshare/comments/640466.aspx0http://blog.csdn.net/freshare/comments/commentRss/640466.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=640466教课书《应用密码学教程》page53，习题4-4，扩展欧几里得算法（最大公约数及逆元）算法<img src ="http://blog.csdn.net/freshare/aggbug/640466.aspx" width = "1" height = "1" />Tue, 28 Mar 2006 03:47:00 +0800清翔兔http://blog.csdn.net/freshare/archive/2006/03/27/640466.aspx#Feedbackhttp://blog.csdn.net/freshare/archive/2006/03/27/640466.aspx清翔兔http://blog.csdn.net/freshare/archive/2006/03/27/640460.aspxhttp://blog.csdn.net/freshare/comments/640460.aspx0http://blog.csdn.net/freshare/comments/commentRss/640460.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=640460//书本page31，例题eg3-5完整解 void decode(char a) { int i = ((a-97)*9 -19)%26; char b = i+97; if (b<91) b+=26; cout << b; }<img src ="http://blog.csdn.net/freshare/aggbug/640460.aspx" width = "1" height = "1" />Tue, 28 Mar 2006 03:40:00 +0800清翔兔http://blog.csdn.net/freshare/archive/2006/03/27/640460.aspx#Feedbackhttp://blog.csdn.net/freshare/archive/2006/03/27/640460.aspx清翔兔