八皇后问题

最近点对问题的图形界面实现，用户可以通过鼠标输入点集，也可以通过随机生成点集，程序会将最近的两个点用红色标示出来-Nearest point on the question of the realization of a graphical interface, users can mouse input point set, can also be randomly generated point set, the program will be the two most recent points, marked in red

女问题描述： 设R={r1,r2,...rn}要进行排列的n个元素。其巾元素r1,r2...rn可能相同。试设计 一个算法,列出R的所有不同排列。 编程任务： 给定n以及待排列的n个元素。计算出这n个元索的所有不同排列。-Female Problem Description: Let R = (r1, r2, ... rn) must be arranged in n elements. The towel elements r1, r2 ... rn may be the same. Try to design an algorithm listing all the different arrangement of R. Programming tasks: Given n and n elements to be arranged. To calculate the n-element array of all the different cable.

红黑树：输入：在同一目录下的redblacktree.txt文件中输入十个大于0的数值，每个数值中间用空格格开 数目可以大于十个，但是要求在源程序中改变＃define NUM 10 ，改成相应关键值各个数输出：按照先序输出红黑树，格式为：根节点。颜色（左子树。颜色，右子树。颜色），并输出此 树的黑高度，然后输入要删除的关键值，按回车后输出删除后的结果，并输出其高度。-RED-BLACK TREE : Admission : in the same directory under the file input redblacktree.txt greater than 0 10 digits each intermediate numerical grid with open spaces can be greater than the number 10, but requested change in the source# define NUM 10, the corresponding critical value into several different output : In accordance with the first sequence RED-BLACK TREE output format : nodes. Color (left subtree. Color, right subtrees. Color), and export of the black tree height and then delete the key to value, according to enter the output was the result of the deletion, and its high output.

大整数整除，char *d返回余数，char*c返回结果 -Large integer divisible, char* d return the remainder, char* c return result

[问题描述] 在二叉排序树中查找关键字为KEY的记录 [输入] 有序表输入要查找元素的关键字 [输出] 查找成功是即可显示查找成功 #include #include typedef int KeyType typedef struct{ -[Problem Description] Binary Tree ranking keyword search for the records KEY [imported] ordered to investigate the importation of table find elements of the keyword search [output] is successful you can show success# include

mysql 5.x手册，全中文，mysql数据库管理开发必备。-mysql 5.x manual, all Chinese, mysql database management to develop necessary.

Realiza inventarios no terminado

利用TreeCtr控件访问数据库-use TreeCtr controls access to the database

物业管理 1.建立一个WYGL数据库，恢复WYGL脚本，然后配置ODBC。 2.建立一个TLBackup数据库，配置ODBC。-a property management. WYGL establish a database, restore WYGL script, and then configure ODBC. 2. TLBackup establish a database, configuring ODBC.

数据结构经典：《数据结构基础》 "Fundamentals of Data Structures" 作者：Horowitz 1983年第一版-Classical data structure: