mouse input programming Demonstration Program

全排列算法，递归实现全排列，可以对任意字符实现全排列，但长度有限制-Full-order algorithm, recursive realization of the entire array can be arbitrarily wide array of characters, but there are restrictions on the length of

一个俄罗斯方块控件，功能很不错。压缩包中包括了我们编写的一个实现基本功能的简单示例。控件中还有其他的功能，待你发掘。 -a Rubik"s cube control, function very well. Compression Package includes the preparation of our realization of the basic functions of a simple example. There are other control functions, you have to explore.

题目：用c 语言编写的程序，一个偶数总能表示为两个素数之和。-Tilte:a programme written by c: an idol can always be expressed as summation of two prime numbers.

delphi编程 号码查询系统.rar-Programming by delphi ,Number Searching System.rar

如何用VB在后台监视键盘？-how to use VB surveillance keyboard in the background?

K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其 加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.

此资源主要是实现图片浏览器的功能，运行环境为VC-This resource is mainly to achieve image viewer features, operating environment for the VC

这是一个简单的计算器，是用C++编译的程序，希望大家喜欢-This is a simple calculators, is the C compiler procedures, hope you like

自己写的测试获得进程包含的线程数量的小程序-himself wrote the test was included in the process of threading a small procedure

This just an example of a content provider class (see article), which overrides the PopulateItem virtual function to show the Shell s resources only when the user wants to access them