数据结构：用链表做存储结构求两个一元多项式相加的结果

example for security of meikuang

中南的数据结构试验1-Indochina data structure a test

录入数据是开发数据库管理软件最基本的工作,录入数据有多种方法,本方法通过药品库入库登记来说明利用表格录入数据的方法.单击登记按纽,选择"供应商"全称,经手人,结算方式"等信息,在表格中输入入库药品的信息,在药品编号列选择药品编号后回车,将自动填入该药品的基本信息,用户在最后一列回车后自动添加新的记录.-development of the database is the most basic management software, a data input methods, the method for warehousing drugs through registration forms to illustrate the use of data input methods. Click registration button, select the "supplier" designation, handling, clearing way "information, etc. input forms in the arsenal of drugs, the drugs listed No. No. choice after the transport drugs, will automatically fill in the basic information of drug users in the final after a carriage return automatically add new records.

ACM解题报告，必有有用，特别对于初学者，看是否对你有帮助-ACM problem-solving report, there must be useful, especially for beginners to see if there is help for you

本程序用来学校管理学生挡案用. 采用Access数据库,程序实现关键在应用ODBC 的两个类.-procedures for the management of schools with students archives. Access database, program lies in the application of two types of ODBC.

Pb9.0的实用源代码下载；主要是介绍PB的案例；比较详细能说明PB的程序的-Pb9.0 practical to download the source code; PB was introduced to the case; A more detailed illustrative of the procedures PB

贸易公司管理包括可户信息管理 商品信息管理 经营信息管理等内容!-trading company management information including household goods management information management business information management and so on!

自编的波兰、逆波兰、中缀表达式计算的小程序，在VS2005下通过编译运行。-Self of Poland, against Poland, in the calculation expression is made up of small procedures, in VS2005 to run through the compiler.

描述（英文）：（提示：至少100个字符。请尽你所能详细描述你的项目。更好的内容将为您赢得更多的分数）

(1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time