-
DLL
说明： VS2013运行VC6.0编写的程序，报错找不到msvcrtd.dll,mfc42d.dll,msvcp60d.dll,mfco42d.dll,msvcp60.dll。将以上dll文件复制到C:WindowsSysWOW64目录下即可。(Vs2013 runs the program written by vc6.0 and fails to find msvcrtd.dll, mfc42d.dll, msvcp60d.dll, mfco42d.dll, msvcp60.dll. Copy the above DLL files to the directory C: windows syswow64.)
- 2020-05-09 14:11:08下载
- 积分：1
-
ChatRoom11(Csocket)
说明： winsocket 实现网络聊天室
使用vc++6.0编程，socket 接口(winsocket network chat rooms using vc 6.0 programming interface socket)
- 2006-05-17 03:58:47下载
- 积分：1
-
SNAMP
通过获取网络数据包，通过SNMP得到网络信息，包括设备的目标地址，源地址，物理地址，算法效率高，获取时间不超过20毫秒。(Through access to network packets, network information through SNMP, including the target address, equipment source address, physical address, the algorithm efficiency is high, the acquisition time is not more than 20 millisecond.
)
- 2014-11-27 12:05:39下载
- 积分：1
-
MyProjects
使用MFC ODBC和LISTCONTROL控件显示数据库表内容(Use MFC ODBC and LISTCONTROL control display the contents of database tables)
- 2007-12-18 15:24:47下载
- 积分：1
-
buscard
公交刷卡系统项目源代码压缩文件夹，有需要的可以去看看(Bus card system project source code archive folder, there is need to go and see)
- 2013-09-02 23:26:58下载
- 积分：1
-
模板匹配实例
模板匹配简单实例 可用于新手测试 与示范 用opencv实现(A simple template matching example can be used for the novice test and demonstration opencv implementation)
- 2021-03-01 19:19:34下载
- 积分：1
-
SCommTest1
该源代码主要是实现串口通信，并将所传输的内容实现保存。(The source code is mainly realize serial communication, and the transmission of content preservation.)
- 2007-10-25 21:18:20下载
- 积分：1
-
565566
扩展收缩对话框应用程序界面，VC++编程精选学习源码，很好的参考资料。(Expansion contraction dialog application program interface, VC++ programming featured learning source code, a good reference.)
- 2013-11-19 18:57:47下载
- 积分：1
-
NetTel
使用低层波形API写的语音聊天程序，可做为API使用的一个例子。(lower waveform use the API to write voice chat program, the API can be used as an example.)
- 2006-07-09 16:59:41下载
- 积分：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
