客户管理系统使用ASP.NET和Acce

一元稀疏多项式计算器的基本功能是： (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.

遍历邻接表以及执行邻接矩阵布尔调整是数据结构里图的经典算法。- Traverse the adjacent table and adjust the implementation of Boolean adjacency matrix data structure is a classic graph algorithm.

数据结构银行模拟指导-simulation data structure to guide banks

Co oporate banking.is 不错的银行体系已写下 c + +.developed 由一组称为 ASN 在加纳......在 2013年 7 月中午，已投放市场

给定n 个整数a ,a , ,an 1 2  组成的序列， a n i | |£ ，1 £ i £ n。如果对于i £ j ，有 0 = å = j k i k a ，则称序列区间i i j a , a , , a +1  为一个零和区间，相应的区间长度为j-i+1。-given n integers a, a, and an 1 2

匈牙利算法 解决类似于线性规划中的分配问题,用于各种匹配算法-Hungary is similar to linear programming algorithm to solve the distribution problem, for a variety of matching algorithm

数据结构中实现图的关键路径的算法，是在TC中运行的。-data structure to achieve the critical path map algorithm is run in the TC.

Redhat8的安装教程(文本安装方式)(-Redhat8 the installation guide (text installation) (

网上购物数据库，所有代码都有，包括模型图 -Online Shopping Database

优先数调度处理器算法，实现处理器调度的程序，-Processor scheduling algorithm is priority number to achieve processor scheduling procedures,