ini文件处理

C++常用数值算法集2-C Numerical Algorithms used two sets

打开真彩色位图，很有用，可以方便编程空间-this is bit picture .it make program easy

应用背景对于barcodelib.dll发布说明================================1.0.0.16- Pharmacode符号添加。-删除重复ISNUMERIC检查方法，移动checknumericonly方法对barcodecom关键技术成熟。净条码阅读器&；扫描器读取二维条形码在线性&：。NET，C #，vb.net类库项目ASP.NET，.NET Web服务。C #，vb.net的Windows应用程序净的控制台应用程序。

code to control mouse cursor with keyboard

使用opencv打开摄像头采集视频并简单灰度处理

利用VB编写的文本朗读程序，在输入文本后进行朗读并可保存-VB prepared text read aloud procedures, the imported text after reading can preserve

基于pxa270的linux下smsc9118的网卡驱动源码，支持10/100M的AutoMdix功能，经测试性能稳定-PXA270-based smsc9118 of the network card under linux driver source code, support 10/100M the AutoMdix function, have been tested stable performance

利用mfc实现window当前执行进程的现实，供初学者学习参考获取当前执行进程的方法。-The use of mfc of the implementation process to achieve the reality of the current window, for beginners to learn the process of reference for the current implementation of the method.

LCS问题就是求两个字符串最长公共子串的问题。解法就是用一个矩阵来记录两个字符串中所有位置的两个字符之间的匹配情况，若是匹配则为1，否则为0。然后求出对角线最长的1序列，其对应的位置就是最长匹配子串的位置。 最长递增子序列LCS的实现C源码！-LCS problem for two strings is the longest common sub-string problem. Solution is to use a matrix to record the location of two strings of all the matches between the two characters in the situation, if the match is one, otherwise to 0. And one of the longest diagonal obtained sequence, the location of its corresponding sub-string match is the longest position. The longest increasing sub-sequence source C implementation of the LCS!

编程实现最大子段和问题的求解（分别采用分治法和动态规划法求解）。-Programming the largest sub-segment and the problem solving (respectively divide and conquer and dynamic programming method to solve).