POEWRPOINT 嵌入vc中

网络优化算法：最大流的FordFulkerson标号算法-Network optimization algorithms: maximum flow of FordFulkerson Enumeration

一个游戏界面代码，仿照《魔兽》；使用了HGE游戏引擎；对学习使用HGE引擎有很大帮助。-A game interface code, along the lines of Warcraft use the HGE Game Engine on learning to use the HGE engine of much help.

字符串统计-abc...

smartphone2003 上用evc编译的 短信发送程序, api编写-Smartphone2003 EVC compiler used to send the message procedures, api prepared

一个七星彩选号器，很好用的呀！-BARRE- Dip a device that is useful!

CAPP工业文档模版设计和打印添加了许多漂亮的工具栏图标有打印预览功能-CAPP document design templates for industrial with print and print preview function. There are many beautiful toolbar icons too.

坦克大战C语言代码，详细场景地图，寻找童年感觉

to check and control parallel port in a system-to check and control parallel port in a system

Description: 对整型有序关键码序列进行折半查找，待排序序列以数组存储。如果找到待查记录，返回找到的位置下标，并删除该关键码记录；如果没找到待查记录，返回0，并将待查记录插入到适当位置，即该查找属于动态查找。输出查找过程中每一轮的low，mid，high 值，以及与给定值相比较的关键码值，并输出最后找到的位置，及变化后的数组。 注意：该数组为整型，数组中关键码存储位置为r[1]~r[n]，r[0]留作它用，且关键码个数大于4. Input Format: 第一行输入数组中记录个数n 第二行输入n个有序的整型关键码，以空格隔开 接下来输入三个待查关键码，每个关键码占一行 Output format: 对于每个关键码，分别输出： 找到给定值之前的每一轮的low，mid，high及相比较的待查找序列中的关键码，以空格隔开 接下来一行输出查找到的位置 接下来一行输出变化后的待查找序列 -Description: The key codes for integers ordered sequence of binary search until the sorting sequence to an array of storage. If you find a complete set of records, returns to find the location of the next standard, and delete the key code is recorded if not find a complete set of records, returns 0, and a complete set of records inserted into the appropriate location, that is, the search was part of search. Find out the process for each one of the low, mid, high value, as well as compared to the value given the key code value and output of the last to find the locat

传真发送程序,还不错-fax transmission procedures, but also good