有关文件读写的各种典型操作例程VC源代码实现，丰富有用．

mfc编程讲解，从mfc最基础讲起，适合于初学mfc者-mfc programming on from talking about the most basic mfc, mfc those suitable for beginner

mentor wg 2004中文简明教程,本来用mentor 的资料就不容易找，改文档介绍了从做库，到原理图，PCB板的制作过来，想学MENTOR WG的人有很大的帮助，看到本论坛这方面资料也很少，上传上来和大家分享-mentor wg 2004 Chinese Concise Guide, originally with the mentor is not easy to find information, to introduce the document from the Treasury to do, to the schematic diagram, PCB board production over MENTOR WG would like to study people who have a lot of help, see the Forum information is also very little in this regard, upload up to share

ad590是温度传感器，这是ad590的技术文档，内容包括ad590的应用-AD590 is a temperature sensor, which is AD590 technical documentation, including the application of AD590

演示在ODBC中使用时间日期-ODBC demonstration in the use of time-of-day

Microsoft® Windows® 2000的驱动程序开发包（DDK）文档总览给您详尽的信息，这些信息对编写Windows2000平台任何类型的驱动程序都是必须的。本文档也描述了Windows Driver Model（WDM）驱动程序，这些驱动程序在Windows2000和Microsoft® Windows® 98平台之间是源码级兼容的。-Microsoft ?? Windows ?? 2000 Driver Development Kit (DDK) documentation overview gives you detailed information on Windows2000 platform for the preparation of any type of driver are necessary. This document also describes the Windows Driver Model (WDM) driver, the driver in the Windows2000 and Microsoft ?? Windows ?? 98 platform is between the source-level compatible.

这个源程序主要是针对C++的继承特性而写的，程序里面的解释很清楚。-This source is mainly for C++ inheritance characteristics of written procedures for the interpretation of which is clear.

本资料是学习LCD开发的必备好的资料！！ 很好的小软件-This information is essential to study the development of LCD good information! ! Good small software

在一个划分成网格的操场上，n个士兵散乱地站在网格点上。网格点由整数坐标(x,y)表示。士兵们可以沿网格边上、下、左、右移动一步，但在同一时刻任一网格点上只能有一名士兵。按照军官的命令，士兵们要整齐地列成一个水平队列，即排列成(x,y),(x+1,y),…,(x+n-1,y)。如何选择x 和y的值才能使士兵们以最少的总移动步数排成一列。 实验任务：计算使所有士兵排成一行需要的最少移动步数。-In a grid divided into the playground, n soldiers stood scattered on the grid points. Grid point by the integer coordinates (x, y) express. Soldiers along the edge of the grid, down, left and right moving step, but at the same time any one grid point has only one soldier. In accordance with the officer s command, the soldiers should be neatly列成level queue, that is arranged in (x, y), (x+ 1, y), ..., (x+ N-1, y). How to choose x and y values to make the soldiers with the minimum of the total moves one line up. Experimental tasks: the calculation so that all the soldiers lined up his required minimum moves.

孙鑫老师 c++20讲 孙鑫老师 c++20讲-SUN Xin c++20-speaking teachers teachers Xin Sun Xin Sun c++20-speaking teachers speak c++20

XML基础教程.rar-XML Essentials. Rar ,,,,,,,,,,,,,,,,,,,,,