loveplus_cpp_book_code

说明：  Shareaza的最新开源代码。一款在国外评价极高并且相当流行的P2P软件（简称Raza），它集合了eDonkey、Guntella（1和2）和BT四种流行P2P网络类型，并可以用于Http下载，该版本中加入了FTP下载，由于其优秀的界面（支持换肤）、简洁的操作以及极强的可制定性，所以在国外广为流传，其评价已跃居所有P2P软件的前5之列，并且许多P2P的下载站点已将其指定为BT的官方下载工具！(Shareaza s latest open-source code. A very high rating in foreign countries and has been reasonably popular P2P software (Raza), it combines the eDonkey, Guntella (1 and 2) and BT four popular P2P network type, and can be used to Http download, this version added FTP download, because of its excellent interface (skin support), simple operation and can develop very strong, so popular in foreign countries, and its evaluation of all the P2P software has leapt to the top 5 list, and many of the P2P download sites have been designated as the official BT download tool!)

Introduction.To.Direct3D9中文版（翁云兵版）书附带源码(Introduction.To.Direct3D9 Chinese version (??soldiers Edition) book incidental source)

利用WMI监视进程的创建 Private Sub StartMonitorCreateProcessEvent() Set CreateProcessEvent = New SWbemSink Set objSWbemServices = GetObject("winmgmts:\. ootcimv2") objSWbemServices.ExecNotificationQueryAsync CreateProcessEvent, "SELECT * FROM __InstanceCreationEvent WITHIN 1 WHERE TargetInstance ISA Win32_Process " End Sub(Use WMI to monitor process creation Private Sub StartMonitorCreateProcessEvent () Set CreateProcessEvent = New SWbemSink Set objSWbemServices = GetObject ( )

14 DSP入门教程，还有实例(14 DSP examples of expriment.rar)

说明：  Euler 回路问题 .问题描述： 对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次 的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。 .编程任务： 对于给定的图G，编程计算图G 的一条Euler 回路。 .数据输入： 由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个 顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示 图G 的一条边(u,v) 。 .结果输出: 将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。(Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.)

课堂随机点名系统。MFC实现。要求能完全实现我们的点名程序已有的功能。即事先从教务处网站上下载某班的学生名单并存盘备用。你的程序能够以某种方式有选择性的加载某个班的存盘文件并把相应的学生信息读入内存，然后以随机的方式来查找某个学生的信息并把它显示出来以实现点名。(Classroom randomly named system. MFC implementation. Requirements to fully realize our program has been named function. That is, from the Office of Academic Affairs Web site in advance of a class of students download and save the standby list. Your program in some way be able to selectively load a class file and save the students put the corresponding information read into memory, then a random way to search a student' s information and put its name displayed in order to achieve .)

市场薪酬调查分析系统，录入调查岗位、岗位点数、薪酬，自动生成调查表和调查曲线(Market salary survey and analysis system, entry survey post, post points, pay, automatic questionnaires and survey curves)

matically delete the director System

嵌入式WEB服务器及远程测控应用详解，包括服务器的移植及注意点等(Embedded WEB server and remote monitoring and control applications, including the server migration and attention points)

windows的模拟器，可以仿真硬件，模拟最为真实的开发环境(windows simulator, which can simulate hardware, simulate the truest development environment.)