-
zhucebiao
关于注册表的操作，关于注册表的读出和注册表的输入(Operating on the registry, read about registry and registry input)
- 2016-07-23 23:19:12下载
- 积分：1
-
homework4
手绘吉普车，并且伴随摄像机变换视角，之间渐远。北京是红粉光漫反射(Hand-painted jeeps, and with the camera angle change, there' s become distant. Beijing is a Pink light diffuse reflectance)
- 2020-09-14 14:27:57下载
- 积分：1
-
Magic Strtree
说明： 我自己写的 将动态 字符串解析到CTreeCtrl。以前是为了 写道数据库，不用ＸＭＬ，为了不麻烦。就 用 VC 写了一个 这个 这个，希望大家可以用到(I wrote it myself dynamic string parsing to CTreeCtrl. Previously wrote to the database, not XML, in order not to trouble. On the VC was a um, hope that we can use!)
- 2005-09-12 09:27:10下载
- 积分：1
-
TestDevFunction
示例程序用了最少的代码实现了对USB的启用禁用操作，对想做windows设备控制的朋友应该有抛砖引玉的作用。(Sample program code used to achieve a minimum of USB-enabled disable operation, pairs of friends want to windows device control should have the role of attracting valuable opinions.)
- 2010-01-17 19:52:56下载
- 积分：1
-
passing-l-array-to-a-function
如何将多维数组传递给一个函数，附实例说明，得出结果(passing a two-dimensioanl array to a function)
- 2013-03-01 00:48:35下载
- 积分：1
-
Socket
socket 编程(socket programming)
- 2008-01-15 17:30:30下载
- 积分：1
-
ucGUI_Kenal
说明： 图形接口ucGUI的内核的详细说明手册中文版(Graphics interface of the core ucGUI detailed instruction manual Chinese edition)
- 2008-09-20 15:04:33下载
- 积分：1
-
EULER1
说明： 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.)
- 2006-03-29 21:31:15下载
- 积分：1
-
MF
说明： 关于 Visual studio的书籍，实现了很多功能，很有借鉴意义。值得一看。适合学习。(Books about Visual studio, to achieve a lot of features, and a useful one. Worth a visit. Suitable for learning.)
- 2013-03-21 16:52:44下载
- 积分：1
-
Visual-CPP-PDF
Visual C++通信编程工程实例精解(附盘) PDF(failed to translate)
- 2013-05-07 15:51:11下载
- 积分：1
