GNU make Version 3.79中文版，方便进行linux源码阅读和Linux下的编程...

深入浅出MFC简体第2版的随书源码，有兴趣的就下来看看。-simple MFC simplified version of the first two books source, interested to see it down.

fortran 77语言得介绍，是学习fortran77语言得一本难得的参考书-fortran language in the introduction, fortran77 language learning in a rare reference books

静态模块 静态模块 静态模块-Static Static Static Module Module Module Module static

Digital Image Processing 数字图像处理 冈萨雷斯 第二版 英文版 习题解答-Digital Image Processing Second Edition Problem SolutionswStudent Set Rafael C. Gonzalez Richard E. Woods

ERP系统-销售部分设计文档 系统设计说明书-ERP system-sales part of the design system design specification document

某石油公司计划建造一条由东向西的主输油管道。该管道要穿过一个有 n 口油井的油田。从每口油井都要有一条输油管道沿最短路经(或南或北)与主管道相连。如果给定 n口油井的位置,即它们的 x 坐标（东西向）和 y 坐标（南北向）,应如何确定主管道的最优位置,即使各油井到主管道之间的输油管道长度总和最小的位置?证明可在线性时间内确定主管道的最优位置,使得给定n口油井的位置,编程计算各油井到主管道之间的输油管道最小长度总和。 -An oil company plans to construct a east to west from the main pipeline. The pipeline to pass through an oil field n wells. Wells from each must have a pipeline along the shortest path (or South or North) connected with the competent Road. If given the location of oil wells in n, that is, their x coordinates (east-west) and y coordinates (north-south), should be how to determine the optimal position in charge of Road, even if the wells to the pipeline in charge of Road between the sum of the smallest length location? proved to be linear time in charge of Road to determine the optimal location, making a given n the location of oil wells, programmed to calculate the well-to-charge of Road between the length of the sum of the smallest oil pipeline.

易语言在网络中应用实例和易语言源程序代码-Yi language in the network application examples and easy language source code

经典好书,适合于高级编成人员阅读.本文件没有解压密码,可以直接使用.-classic books suitable for senior staff into reading. This document does not extract passwords can be used directly.

Programming WDM微软出的书的chm版-the book version of the chm

java server program,讲述java服务器端编程-java server program, on java server programming