hello

labview 调用VC动态链接库的源码实例。(LabVIEW calls dynamic link libraries VC source code examples.)

纯内存操作解压JPGE 很早之前收录的 并非原创 共享给大家(Pure memory operation decompression JPGE. Long ago included, not original. Here to share with you.)

让你随时想安全地挂机就挂机，加上锁安全。(Hook lock)

从键盘接收字符串，并统计其中各种字符出现频率！(calculate the frequency of every sinal get from the keyboard!)

msvbvm50.rar 动行库文件(msvbvm50.rar dynamic library file line)

C#完全手册教程，是一个特别好的教程，希望大家写，下载。(C# complete manual tutorial)

西南交通大学ACM 1075题解源码，C++编写，保证能够AC(Southwest Jiaotong University, ACM 1075 to a problem source, C++ written guarantee that AC)

随机设置了雷的位置，当用户输入的位置与雷的位置相同，则游戏结束。否则该位置处打印出笑脸。(Ray random set position when the user enters the same position and the position of mine, the game is over. Otherwise, the position of print faces.)

此程序能指导四等水准测量过程并计算相关限差，以及计算闭合差(This program will guide four leveling process and calculate the relevant limit is poor, and to calculate the closed-poor)

最佳适应算法是动态内存分区分配算法的一种。所谓“最佳”是指每次为作业分配内存时，总是把能满足要求、又是最小的空闲分区分配给作业，避免“大材小用”。为了加速寻找，该算法要求将所有的空闲分区按其内容以从小到大的顺序形成一空闲分区链。这样，第一次找到的能满足要求的空闲区，必然是最佳的。(best adaptation algorithm is a dynamic memory allocation through an algorithm. The so-called "best" means the operation of each memory allocation, always meet requirements, and also the smallest area allocated to idle operations, to avoid "a waste of talent." To speed up the search, the algorithm requires that all leisure district according to content from small to large order of the formation of a regional chain idle. So, the first found to meet the requirements of the free zone will be the best.)