Function

换肤程序小例程，里面实现了程序换皮肤的基本方法，注意，如果程序找不到图片的话，请把pic文件夹放入Debug文件夹。(Skin small routine procedure, which the realization of the procedures for the skin s basic method, note that if not able to locate the picture, please put pic folder Add Debug folder.)

vc 利用ADO开发数据库介绍，对初学者有帮助(Visual c++ ADO )

说明：  VC++ 中实现对多画面窗口的控制，基于MDI的MFC程序，用四个按钮控件控制四个文档窗口的显示(VC++ to implement multi-screen window, control, the MFC-based MDI program, with four button controls for four of the document window display)

实现本地程序从远程服务器下载文件。保存到本地。同时，具备断点续传的功能。可以在下载一部分的情况下，再次下载从断点处继续下载。(Implement a local program to download files a remote server. Saved locally. At the same time, with the functions of HTTP. You can download a part in the case, once again download continue downloading the breakpoint.)

说明：  在VB中利用MO组件在图层中画多边形 for MO(The use of MO in the VB components in the layers of paint polygon for MO)

基于MFC的强大的串口通信程序，可以用于串口通信测试(Based on the powerful serial communication Demo MFC can be used to test)

带ID的lpc2368 CAN通信，包括初始化、中端、CAN通信和串口通信(With the ID lpc2368 CAN communications, including initialization, in the end, CAN communications and serial communication)

实现p2p点对点视频播放，不足之处，请多指出QQ：564073314(achieve point-to-point video broadcast inadequate, I feel apologetic that QQ : 564073314)

说明：  mongoose v6.15，多线程http——server，线程数可设。从GitHub下载C语言原代码，在vc6里面编译成c++工程(multi-threads http_server, based on source code from Github. The project is conducted in VC6, converted from c language. The threads num can be edited in code.)

说明：  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.)