孙鑫教程源码 孙鑫视频 教程第5课源码

动态链接库程序的编写。静态库与动态库的区别，以及调用程序在链接静态库和动态库时的区别。如何利用工具查看动态链接库输出的函数，Depends工具的使用，C++编译器名字改编技术对动态链接库输出函数的影响，extern "C"的用法，利用模块定义文件来解决C++名字改编的问题。用typedef定义指向函数的指针类型，如何获得动态连接库里的函数的指针。-Dynamic link library preparation process. Static library and dynamic library distinction, and call procedures in the static library and dynamic link library when the distinction. How to use tool to view a dynamic link library function of the output, Depends tools, C++ Compiler technology to adapt the name of a dynamic link library function of the impact of the output, extern C usage, use module definition files to resolve the C++ Name adaptation problems. Typedef point to use the definition of function pointer type, how to obtain the dynamic link library function pointer.

用c编写的羊齿叶-prepared with the leaves reaching back

一个简单的五子棋小游戏，比较适合初学者学习之用。-a simple game of 331 small, more suitable for beginners learning.

应用背景本代码是基于LabWindows/CVI的采用C语言开发的一款控制摄像头程序，所控制的摄像头对于市面上一般的摄像头都可以适用，该程序具备实时监控、实时录像、实时拍照功能，操作比较方便。关键技术关键技术在于利用windows系统中的API函数，实现对摄像头的控制。难点在摄像头控制函数中的参数设置需要理解，否则在调试程序时，很容易出错。

最好的地理数据库之一；

目标：创建一个VI，即使用公式计算以下方程节点：y1=x3-x2+5y2=m*x+Bx范围为0-10。两者都可以使用同一个公式一个公式节点，并在同一个图表中显示相同的结果。

动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下： 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

这是我很早以前用C++Builder为某电信商做的一个网管程序,用SNMP监控硬件,用自定义协议管软件(要符合接口), 从父网也可直接监控子网, 每种硬件和软件都是用DLL接口,配置保存在数据库中,这是没有提供数据库及设计文档,我现在也找不到-this is a long time ago I used the C Builder for a carrier to do a network management procedures, using SNMP monitoring hardware, with agreement from the definition of software (to comply with the interface), from the parent network can also directly monitor subnetworks, each of the hardware and software are used DLL interface, configuration stored in a database, which is no database design and documentation, I could not find

八皇后VC图形演示，算法思想：回溯法，先在第1行放上一个皇后，然后在第2行合适的位置放上一个皇后，依次类推，如果8行都放满了，说明找到了一个解，如果第好第i行的皇后后，第i+1行找不到合适的位置，这时就回到第i行，把第i行的皇后放到下一个位置，继续尝试下一行。如此反复，知道找到所有的解。注意，这种算法找的解可能有等价的，某些解可由别的解经过旋转棋盘得到。-visual demostration in vc of eight queens problem. algorithm: backtracking. First, put a queen on first line then find a suitable position on 2nd line for next queen, and so on. When all eight lines have queens, it means we have find a solution. If we put the i-th queen, but can find a suitable position on the (i+1)th line, then back to the ith line and move the queen on the ith line to next suitable position and move on to the next line. Repeat this until we have found all the solutions. Note:By this mean, some solutions maybe equivalent to others, some can be acquired by the rotation of other solutions.

我写的小程序 用于实现简单的工资管理 但是好象有点小毛病-I write small programs for simple wages but it seems a little fault