操作ssd4exercise6答案，欢迎大家下载，我想…

伪随即码生成C++源码，所有功能 都封装在类中 。-Then pseudo-code to generate C++ source code, all functions are encapsulated in the class.

本附件是 VB.NET-Database-Program (vb.net数据库编程)书附带的源代码 共两个压缩文件 里面有很多例子 大家可以借鉴-this annex is VB.NET- Database-Program (vb.net database programming) book accompanying source code were two compressed files there are many examples we can learn from

实现简单的复数加减乘除四则运算，输入格式是分别输入服输的实部和虚部，可能还有点小毛病，但能实现基本功能-Plural simple arithmetic calculation, enter the format is throwing in the towel enter the real and imaginary parts, there may be little problems, but to achieve the basic functions of

喜此代码使保存屏幕和佩尔梅特你，使过渡 betxeen 屏幕 tyhis 代码是净矿我忘了来源出处

字符、数字、日期等多种信息处理类，简单方便，直接包含到工程，就可以使用！ 下载后，将扩展名更改为jar-Characters, numbers, dates and other information-processing categories, simple and convenient, direct to the works included, you can use! Download, would be changed to jar extension

C语言标准 此源码是标准的风格形式 可以给用户带来极大的方便-C language standard for this source is a standard form of the style can bring great convenience to users

Control area network implemented without while loop

acm竞赛参考代码，利用中缀表达式计算后缀表达式-acm contest reference code, the use of infix expression calculation expression suffix

PocketNester的c++源代码,很好的学习例子,仅供大家学习-PocketNester the c source code, examples of good learning, and learning is for everyone

动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下： 1）设置大小为连乘个数的方阵 2）主对角线上方各元素Di,j(ij)记录获得该最小工作量矩阵分组的第一组的最后一个矩阵的序列号 最后通过下方元素可知最终结果的分组方式。-dynamic programming matrix continually multiply-dynamic programming problem is a problem-solving method. It does not require the results need to be how to divide the problems of the sub- problems fixed, but different input given by the specific example of the problem partition method, and then calculate, and answer questions. Matrix continually multiply the main idea is as follows : 1) the installation of the size of continually multiply the number phalanx 2) above the main diagonal elements Di, j (ilt; J) Matrix Mi continually multiply to the smallest workload 3) below elements Di, j (IGT; J) the record was the smallest workload of a matrix of the first group of a matrix of the final sequence, followed by the final element of the final results of the