轻量级的日志文件类

通过尽可能简洁明了的代码实现查询功能 方便开发者使用

1写一个函数，求一个字符串的长度，在main函数中输入字符串，并输出其长度。　 2有n个人围成一圈，顺序排号。从第一个人开始报数（从1到3报数），凡报到3的人退出圈子，问最后留下的是原来第几号的那位。 3编写input()和output()函数输入，输出5个学生的数据记录。 4反向输出一个链表。 5找到年龄最大的人，并输出。-1 to write a function, and the length of a string, in the main function in the input string and output its length. 2 There are n individuals form a circle, in that order排号. From the first person to start off (from the reported number of 1-3), who reported 3 people out of the circle and asked the last remaining original issue of who the first few. 3 preparation of input () and output () function input and output data of the five student records. 4 reverse a linked list output. 5 to find the oldest, and output.

选择启动股票软件的工具-stock options activated software tools

书店管理系统！vb开发，实现图书自动编号，图书的添加、修改、删除，会员的添加、修改删除、以及借书还书，登录分类，会员管理、图书查询等功能！-Bookstore Management System! vb develop, implement automated library number of books to add, modify, delete, member add, modify delete, as well as the borrowing and returning books, log classification, members of management, library inquiries and other functions!

资料光盘VC技术实例代码，详细资料资料光盘VC技术实例代码，详细资料

创建屏幕保护程序的基础类例子-The example of the class of creating screen-save program

本程序为用VC基于对话框开发的小程序，能够列举出四个数计算24点的所有表达式。-This procedure for the use of VC based on the development of a small dialog box procedure to list the four 24-point calculated by the number of all the expressions.

　提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用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

Windows ce的一本非常好的教程 windowce-Windows ce of a very good tutorial windowce

该程序用贪心算法来求解二分覆盖问题. 采用贪婪准则：每次从A中选择一个顶点加入覆盖，选择时：选取能覆盖B中还未被覆盖的顶点的数目最多的顶点。-procedures with the greedy algorithm to solve two hours coverage. Using greed criteria : A time to choose from a peak accession coverage options : To B coverage can not be covered by the largest number of vertices of the vertex.