资源列表
88d70d57-e7e0-490b-8b8b-feb85c0bea3b
- VC托盘这个程序详细说明了如何使用VC编写出现在WINDOWS托盘中的程序- How has this procedure specify used VC to compile in the present WINDOWS tray the procedure ,Visual C++,界面编程/GUI Develop -VC pallet of this procedure a detailed descr iption of how to use the VC prepared appear
VBXITONGCIPAN
- VB代码 获得系统磁盘的属性 简明扼要! 很适合新手 -VB code access system disk attributes concise! Very suitable for novice! !
BiTreeExcise
- 二叉树的练习,先序输入,先序,中序,后序输出-binary tree exercises, first order input, first sequence, the sequence after sequence output
magmouse
- 放大鼠标移动到的区域 完成局部屏幕放大的功能-Click the mouse moved to the region to complete the partial screen enlargement function
DirectoryTreeView
- 一个文件夹浏览窗口的源程序，整个界面同Windows下的资源管理器中的文件夹浏览十分的相似-a folder browser window to the source, the entire Windows interface with the management of resources for the folder View is very similar to the
COMkongzhixitongsheji
- 控制系统com接口设计，程序适合初学com者，参考学习。内有程序功能设计说明，为了解程序提供帮助。可以运行。-control system interface design, programming suitable for beginners com, the reference to the study. Procedures within the functional design specifications, to provide help to understand the proc
yuesehuan
- 这是一个关于月色环的计算,输出的算法!用户输入人的个数,以及每个人的密码,以及开始的记数m,该程序将输出出列人的序号!-This is a part of the moonlight, the output algorithm! Users input the number, and each person's password, and the start of the counting m, the program will print out from the serial num
nizhi
- 这是一个将链表就地逆置的算法!用户输入原始数据,该程序将不需另申请空间而将原序列进行逆置!-This is a local chain of home inverse algorithm! User input raw data, The procedure will no longer have to apply for another space, the original sequence inverse home!
lll333
- 这是一个利用扩展先序二叉树建立二叉树,并采用先序,中序,后序进行遍历的算法!-This is the first expansion of the use of a binary tree order to establish binary tree, and a first sequence, sequence, After traversal sequence for the algorithm!
fei333
- 这是一个利用扩展先序二叉树建立二叉树,且利用非递归算法进行中序遍历的算法!-This is the first expansion of the use of a binary tree order to establish binary tree, and the use of non - recursive algorithm which preorder algorithm!
maandian
- 这是一个判断马鞍点的算法,当用户输入一个二维数组,当一个元素为每行的最小,而又是每列的最大时,它就是马鞍点!-This is a judgment of the saddle point algorithms, user input when a two-dimensional array, When one element per line for the smallest, which is the largest per, it is saddle point!
filecleaner
- 简单小巧的工具——文件清理小助手,通过vc++来实现的-simple compact tools -- document clearing his assistant, to achieve the vc