课程上机作业，有关人脸识别和morphing的

这段代码在windows平台上进行大小调整。

Turboc2.0函数大全-Turboc2.0 function Daquan

486DX66 cache测试文件，vcd格式-486DX66 cache test document format vcd

Modbus 协议是应用于电子控制器上的一种通用语言。通过此协议，控制器相互之间、控制器经由网络（例如以太网）和其它设备之间可以通信。它已经成为一通用工业标准。有了它，不同厂商生产的控制设备可以连成工业网络，进行集中监控。-Modbus electronic controller is used on a common language. Through this agreement between controller, the controller through the network (such as Ethernet), and other equipment between the communication. It has become a common industry standard. With it, the different manufacturers can even control equipment for industrial network for centralized monitoring.

这是一个最小堆的模板实现，遗憾的是没有使用模板特化，否则使用起来会更方便，这个实现似乎还有些问题，在析构的时候会出现错误，但是我没有找到原因，很是郁闷。没什么好说的，代码跟书上的没什么两样-This is a template to achieve the minimum heap, unfortunately, do not use template specialization, or else will be more convenient to use, this achievement seems to be some problems in the destructor when an error, but I did not find reason, was very depressed . There" s really nothing, the code is no different with the book" s

请求段式存储管理方式，是一个可以运行并实现管理功能的小程序-NOTE: Request segment memory management method,This is a small program executing and implementing management function

在DELPHI程序中获取网络资源信息-the process of information access network resources

数字黑洞程序. 你输入一个不超过10的整数,然后按倍数从大到小排列,减去位数从小到大排列的数字.得出的数重复做上面的操作，最后会吸进一个数字．-digital black hole procedures. You enter a not exceed 10 Integer, and then arranged by multiples on average, less median from small to large with the figures. Come do a few repeat the above operation will eventually sucked into a figure.

一些名数学问题的 C语言源程序（例如 四皇后问题， 八皇后问题，特洛比方块等等）-some mathematical problems from the C language source code (for example, four Queen"s, Queen"s eight, Tello than box, etc.)

Assume that Edison has found himself in a square-shaped maze of NxN square cells which is surrounded by walls from the outside. In the maze, some of the cells are also walls. Edison can only move between two empty cells in four directions, north, south, west and east. In order to get out of the maze, he drafts a plan. He uses his left hand to lean on the wall and goes by following the wall. Here is the question, is Edison able to get out of the maze in at most 10,000 steps? If he can make it, output the path. By getting out of the maze, he only needs to be in the exit cell. If the starting cell is the same as the exit, Edison won"t need to move and can directly get out of the maze. Input The first line of the input gives the number of test cases, T. T test cases follow. Each test case starts with an integer N. N is the size of the maze. Th