Magio牛的usaco源代码，希望和大家共同学习

struts 登陆的小例子,包括密码验证，业务逻辑，Token解决重复递交

一元稀疏多项式计算器的基本功能是： (1)输入并建立多项式； (2)输出多项式，输出形式为整数序列：n,c1,e1,c2,e2,….,cn,en, 其中n是多项式的项数，ci和ei分别是第I项的系数和指数，序列按照指数降序排列； （3）多项式a和b相加，建立多项式a+b （4）多项式a和b相减，建立多项式a-b.-Sparse Polynomial calculator a dollar a basic function is to: (1) input and the establishment of polynomials (2) the output polynomial, the output sequence of the form of an integer: n, c1, e1, c2, e2, ...., Cn , en, in which n is the number of polynomial, ci and ei, respectively, is the first I of the coefficient and index, sequence in accordance with the index in descending order (3) polynomials a and b are added together to establish polynomial A2B ! b (4) polynomials a and b-phase reduction, the establishment of polynomial ab.

Large sclae prepocess data for data mining and code

包含常见的数据结构的类和函数-contains common type of data structure and function

这是一个用回溯算法解0--1背包问题的C++程序（好用的）-This is a backtracking algorithm used 0 1 knapsack problem of the C++ Procedure (useful)

严蔚敏编写的《数据结构》第2章的答案，全部为源码-the answers of chapter two of a book called ‘Data Structures’ writen by Yan Wei Min

ODBC方法连接Access数据库(需设置数据源)的三国人物管理系统.本人以初学者的身份写的,紧供菜鸟们参考,达人们大可无视-Ways to connect Access database ODBC (need to set the data source) of the Three Kingdoms characters management system. I am a beginner in his capacity as the writing, tight菜鸟们for reference, of people can ignore!!

Data Structures and Algorithms with Object-Oriented Design Patterns in C# 这本书的范例代码dll自己反编译的source code http://www.brpreiss.com/books/opus6/-Data Structures and Algorithms with Objec t-Oriented Design Patterns in C# this book since dll code examples his opposition to the compiler source code http :// www.brpreiss.com/books/opus6/

采有C++模板实现的一个数据结构"链表"，可以进行增加，删除，修改等20多个成员函数。 本程序适合初学数据结构的朋友们。

BM关键字查找算法，在用于查找子字符串的算法当中，BM（Boyer-Moore）算法是目前相当有效又容易理解的一种，一般情况下，比KMP算法快3-5倍。-BM keyword search algorithm used in the sub-string search algorithm which, BM (Boyer-Moore) algorithm is quite effective and easy to understand A, under normal circumstances, more than 3-5 times the KMP algorithm quickly.