acad 公差查询源码, a2004,05,06, 可选择文本

数据库实现员工的管理-database management staff

编写算法，在二叉排序树上找出任意两个不同结点的最近公共祖先-Write algorithm, binary sort tree to find any two different nodes of the nearest common ancestor

一个求进制的c++算法,希望能给大家带来帮助!如果大家有更好的,别忘记发给我啊! emil:wyx32893039@163.com-seeking a band of c algorithm, we can bring hope to help! If you have the better, do not forget to me ah! Emil : wyx32893039@163.com

用Treeview来显示每个Field-used to demonstrate each Treeview Field

数据结构中常用结构的动态演示，可以帮助初学者更好的理解其结构的实现-data structure used dynamic structure of the demonstration, and can help beginners a better understanding of its structure to achieve

VFP图书馆管理系统-VFP Library Management System

用栈解决迷宫问题，随机生成迷宫，而且还调用了 windows.h 实现了 windows 控制台字体变化，采用C++实现，注释很详细-Find a way through a maze with stack. The maze is generated randomly. Change the colors in console. Use C++ with detailed comments.

用JAVA开发的数据库底层核心，是学习用JAVA开发数据库系统的必要资料。-with JAVA development of the database underlying core, Java is used to study the development of a database system the necessary information.

将excel格式的文件销售订单导入数据库中-Will excel file sales orders into the database

采用VC++6.0 + Ado开发 除了基本的增删改之外，还有以下特色 **可以直接将照片存于数据库，不必担心因为系统路径改变导致的更改。 **支持简单查询，模糊查询和精确查询和多种排序功能。 **双击左侧列表即可进行更改，右键保存。 **系统界面美观。 屏幕分辨率：1024*768　效果最佳 有需要源代码的朋友，通过电子邮件与本人联系。 Email:linchangcheng007@163.com 进一步了解本人相关作品，请访问本人的Blog。 Blog: http://blog.csdn.net/linchangcheng007/ 花了几天时间做的东东。对于VC开发，数据库开发入门来说很不错的。-Used VC++ 6.0+ Ado development apart from the basic to the additions and deletions, there are the following features can be directly** photos stored in the database without having to worry about because the system led to changes in the path of change.** Support a simple query, fuzzy query and precise queries and a variety of sorting functions.** Double-click the list on the left you can make changes, right-preservation.** System Interface beautiful. Screen Resolution: 1024* 768 best source code need to have a friend by e-mail with my contact. Email: linchangcheng007@163.com to learn more about my work-related, please visit my Blog. Blog: http://blo