DMS1

说明：  动态创建数组模板，可以用该模板动态创建所需要的数组类(Dynamic Creation of Array Templates)

An algorithm for tabu search methode for solving optimization problems

一个小巧的个人信息管理程序,很实用,vc6的源码和可执行文件,(A small, personal information management program is very practical, vc6 source code and executable file,)

canon sdk 8.4,remote capture necessary

一个小的C++应用程序,可选择起点目的地和出行方式并显示结果.供WINDOWS程序设计初级教学使用,熟悉C++工程中映射和变量的添加.(A small C++ application, select the starting point of destination and travel mode and displays the results. For WINDOWS elementary teaching program design using familiar with C++ project to add mapping and variable.)

FLUENT和EDEM结合 快速填充，提取节点坐标，然后在EDEM填充小球(FLUENT and EDEM combination of fast filling, extraction node coordinates, then fill in EDEM pellets)

Ogre_VC9_AppWizard_1.7.2.exe,vs与ogre集成环境插件(Ogre_VC9_AppWizard_1.7.2.exe, vs ogre integrated environment plug)

g723语音压缩格式。里面包含了最新的说明文档和代码，可以使用VC来编译。对视频会议或者作VOIP的朋友很有帮助。(voice compression format. The latest of which contains the documentation and code can be used to compile VC. Right for video conferencing or VOIP helpful friends.)

zoj094 Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. (Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. )

CDT规约 CRC8效验 VC编写的，里面有VC控件字符串和HEX数据互相装换的函数(VC Statute CDT prepared CRC8 efficacy, which has strings and HEX data VC control equipment for each function)