一个简单的helloworld小代码，相信大家都接触过这样的代码。

c ++书籍-c++ books

javaWeb框架很多，struts2， webwork，struts，springMVC等，都是很好的javaweb框架-Many javaWeb framework, struts2, webwork, struts, springMVC are all very good framework javaweb

用CVI实现的EXCEL自动化服务器演示i-CVI realized Excel automation server demonstration i

Java编程思想中文版!很好很强大！不要会后悔-English version of Java programming idea! Good is very powerful! Will not to regret! ! ! ! ! ! ! ! ! ! ! !

if (pfile() == 0) unlink(inname) else fprintf(stderr, "%s: I/O Error -- File unchanged ", inname) fclose(outfile) fclose(infile) } exit(0) - if (pfile() == 0) unlink(inname) else fprintf(stderr, "%s: I/O Error-- File unchanged ", inname) fclose(outfile) fclose(infile) } exit(0)

一个很游泳的标准啊，值得一看啊-a swimming standards ah, ah eye-catcher

DOS 屏幕保护程序-DOS screen protection program

某石油公司计划建造一条由东向西的主输油管道。该管道要穿过一个有 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.

vc6.0实现画线第一步（深入浅出mfc）-vc6.0 realize the first step in drawing a line (in layman

是我下载的《深入浅出MFC》简体中文版(附源码)的pdf格式的电子书籍，内容很好。-I downloaded the " easy MFC" Simplified Chinese version (with source) in pdf format e-books, content very good.