它是哈希的实现。

RLE8压缩的LabVIEW源程序，这个是游程压缩算法-LabVIEW source RLE8 compression, this is a run-length compression algorithm

该程序可以将自己的帮助文档集成到MSDN里。自己制作库的时候特别有用-the program can help their integration into the MSDN documentation Lane. They produced the library is especially useful when

unice as a picture name-unice name as a picture

#include struct powernode { float pi float qi int i float vi } struct powernode wg[20] struct powernode wl[20] struct linedata

inter电脑主板电路原理图，私家收藏网上是找不到的！-inter computer motherboard circuit diagram, private collections are not to be found online!

编写筛选查找素数函数： void sieve(bool isPrime[], int n) 其中isPrime[ ]为一个布尔型数组，n为数组大小。由于2是第一个素数， 所以设置isPrime[0]和isPrime[1]的值为false，并设置其余的元素初值为true。 然后对从4到n－1的每一个i，判断i是否能够被2整除，如果i能够被2整除，则设置isPrime[i]为false。 对从2到n/2的每一个可能的数值重复以上处理，当操作结束时，所有值为true的isPrime[i]所对应的i就是素数，它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.

用Delphi实现热点-hot with Delphi

[斐波那契运算DEV-C++编译器]学习，学习东西，以实现C语言的方式。

MFC的一个动态雪花效果，里面有按键控制，改变其速度以及背景-MFC-a dynamic snow effect, which are key control, changing its speed, and background

VC环境下运行的坦克大战，不用多说了吧！-VC environment running under the tank, the answer!