GetWindowsPassWord

一个基于tcp connect的端口扫描器(Based on a port scanner tcp connect)

Enrollment system Enrollment Sample

说明：  vc项目开发全程实录 的源代码，书上的例子都有哦...(Record vc project development throughout the source code, books, examples of both Oh ...)

51CTO下载-VC++串口通信2051CTO下载-VC++串口通信20个经典源码合集51CTO下载-VC++串口通信20个经典源码合集个经典源码合集(51CTO download-VC++ serial communication 2051CTO download-VC++ serial communication 20 classic source collection 51CTO download-VC++ serial communication 20 classic source source collection classic collection)

ProE/Toolkit开发库基于同步模式DLL动态链接库形式的二次开发工程。根据官方文档中实例修改实现了根据MFC窗口输入参数自动画圆柱、圆台、棱柱等基本几何形状。即完成了草绘、拉伸、旋转等基本操作的代码实现以及其组合的实现。（备注：软件版本是ProE Wildfire 5.0，对应的开发环境是VS2008。工程所需外部链接库网上可以查到。）(ProE/Toolkit development libraries based on the synchronous mode dynamic link library DLL form of secondary development projects. Modify achieved under MFC window input parameters the base geometry animation cylinder, round table, prism, etc., according to official documents instances. That completed a sketch, drawing, code rotation and other basic operations to achieve and realize its portfolio. (Note: The software version is ProE Wildfire 5.0, the corresponding development environment is VS2008 external link libraries needed projects can be found online.))

多媒体定时类，精度1ms，调用函数均已封装，可以直接使用，很方便(Multimedia regular classes, accuracy 1ms, call functions are packaged, can be used directly, it is convenient)

VB版电子电路设计模拟与分析系统。。。。(VB version of the analog electronic circuit design and analysis system )

这是Windows程序设计（第五版）第11章-第15章的源代码！(This is a Windows program design (fifth edition) Chapter 11- Chapter 15 of the source code!)

电池管理系统，最多可同时管理12节电池电芯。LTC6804(Battery management system can manage up to 12 battery cells. LTC6804 )

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