scrdesign compile source code

获取CUP的状态信息-CUP access to the state information

VC导入Word例子源代码-VC into Word example source code

VC各种综合类的设计，包含有：菜单类、操作Excel类、ADO、打印等等。-VC range of integrated design, includes: menu category, operation Excel type, ADO, Print, etc..

把24位彩色图片转换成8位图片，c++编写的，感觉有点用处，特来分享一下 把24位彩色图片转换成8位图片，c++编写的，感觉有点用处，特来分享一下 把24位彩色图片转换成8位图片，c++编写的，感觉有点用处，特来分享一下

这是对矩阵连乘的最优解的算法实现，利用优化算法来寻找多个矩阵的最优值及最优连乘次序-This is a matrix with the optimal solution by the algorithm, using optimization algorithms to find multiple optimal value and optimal matrix with by the order of

文件打包器sdfa sdfasdf-asdfasdfasdfasdfaasdfa

生命游戏，规则： 1、一个细胞周围八个格存活2～3个细胞，则下一时代次此细胞依然存活 2、如果某个格周围八个格存活三个细胞，则下一时代该格能创生一个细胞 3、如果一个细胞周围8格存活细胞数为1个或1个一下，则下一世代该细胞因孤独而死 4.如果一个细胞周围8格存活细胞数为4个或4个以上，则下一世代该细胞因生存空间拥挤而死-Game of Life rules: 1, a cell survival of the surrounding eight grid cells 2 ~ 3 months, then the next times at 2 this cell is still viable, if a grid around the eight cell survival of three cells, then the next era of the grid to creation of a cell 3, around 8, if a cell survival of cells for cell 1 or a click, then the next generation of the cells die because of loneliness 4. If a cell survival of cells in the surrounding 8 cells for 4 or 4 or more, then the next generation of the cells died due to crowded living space

　提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局 部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具 体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。 关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu search techniques, using I & D strategies, while designed for the local optimal solution of the two kinds of mutation operator. The improved algorithm can effectively compensate for the standard tabu search algorithm depends on the initial solution defect, but also to avoid the phenomenon of search stagnation. Through specific examples and random-question test, indicating that the improved tabu search algorithm has better performance. Guan

北大ACM试题poj 第3067 3071题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 30,673,071 question Question poj source code, good code, and want to help students engage in ACM

广度优先搜索 (BFS) 是一种策略寻找图中搜索时限于本质上是两个操作： (a) 访问和视察一个节点图 ；(b) 获得访问权的邻居的当前访问的节点的节点。BFS 从根节点开始，并检查所有相邻的节点。然后这些邻居节点的每个反过来，它检查其中人迹罕至，他们的邻居节点，等等。BFS 相比相当，但更多的内存 efficientIterative 深化深度优先搜索和深度优先搜索与对比。