!!!General Topic
文章平均质量分 87
b_end_an
这个作者很懒,什么都没留下…
展开
-
!!!Cryptology
Cryptography is the practice and study of techniques for secure communication in the presence of third parties. Symmetric-key cryptography refers to encryption methods in which both the sender an原创 2013-10-07 22:51:03 · 474 阅读 · 0 评论 -
!!!Software release life cycle
A software release life cycle is the sum of the stages of development and maturity for a piece of computer software: ranging from its initial development to its eventual release, and including updated原创 2013-07-24 02:24:24 · 431 阅读 · 0 评论 -
!!!Things to Learn
资料 1. 正则表达式 2. 程序员面试宝典,程序员的数学, 编程之美 3. C++ STL, efficient C++ 4. 源码,反码,补码。 补码好处:省一位(-0),而且令加法简单 6. design pattern http://en.wikipedia.org/wiki/Design_pattern_%28computer_science%29 h原创 2012-09-20 04:48:11 · 436 阅读 · 0 评论 -
!!!Translation
进制 二进制: binary 八进制: octonary [美][ˈɑktəˌnɛri] 十进制: decimal [美] [ˈdɛsəməl] 十六进制: hexadecimal [美] [ˌhɛksəˈdɛsəməl]原创 2012-11-20 04:52:00 · 293 阅读 · 0 评论 -
!!!正则表达式 (Regular Expression)
What is regular expression A regular expression(正则表达式), or regex for short, is a pattern describing a certain amount of text. Wildcard(通配符) character can be used to substitute for any other char原创 2012-11-07 06:53:52 · 634 阅读 · 0 评论 -
!!!sample
void swap(int *a, int *b) { int c = *a; *a = *b; *b = c; } void bubbleSort(int a[], int n) { bool swapped = true; int j = 0; int tmp; while (swapped) { swapped = f原创 2013-10-22 04:47:59 · 559 阅读 · 0 评论 -
!!!Polynomial ADT
A simple Polynomial ADT 1. can input each term and display the result 2. can add/multiply two polynomials 3. linked list implementation Main.cpp #include #include"POLY_DEF.h" using namespace std;原创 2013-04-16 04:53:15 · 804 阅读 · 0 评论 -
!!!TopCoder I
SRM 144 DIV2 1.*200 --- 60 read #include #include #include using namespace std; class Time { public: string whatTime(int seconds); private: int hr,min,sec; }; string Time::whatTime (int seconds原创 2013-01-30 09:03:18 · 365 阅读 · 0 评论 -
!!!博弈论基础: 巴什博奕+威佐夫博奕+尼姆博弈
(一)巴什博奕(Bash Game): 只有一堆n个物品,两个人轮流从这堆物品中取物,规定每次至少取一个,最多取m个.最后取光者得胜. 若(m+1) | n,则先手必败,否则先手必胜。 显然,如果n=m+1,那么由于一次最多只能取m个,所以,无论先取者拿走多少个,后取者都能够一次拿走剩余的物品,后者取胜.因此我们发现了如何取胜的法则:如果n=(m+1)r+s,(r为任意自然数,s≤m),那么转载 2013-05-14 07:06:14 · 781 阅读 · 0 评论