-
ddvip_com_014027b2aeb0a8
说明: 渐变进度条vc中的代码,能确定开始和结束的颜色(Gradient progress bar vc in code, can determine the beginning and end of the color)
- 2008-09-09 20:48:50下载
- 积分:1
-
CBC_AES_NoPadding_PKCS5Padding
MFC工程,实现AES CBC 128bit NoPading和PKCS5Pading的功能(MFC AES CBC 128bit NoPading project implementation, and the function of PKCS5Pading)
- 2017-11-03 11:18:17下载
- 积分:1
-
95159368cd_vcd_player_by_vcpp
avi,mpg4,mp3等视频格式文件的播放,关闭,循环播放,循环回放(avi, mpg4, mp3 players and other video format files, shut down, loop, loop playback)
- 2011-04-20 17:09:37下载
- 积分:1
-
zidongsaolei
扫雷程序外挂,真正的算法实现(非读内存方法),高级最快3~5秒,有具体的算法解释说明(Plug-in de-mining process, the real algorithm (non-memory methods of reading), Senior fastest 3 ~ 5 seconds, there are specific explanations of the algorithm)
- 2009-06-24 09:17:58下载
- 积分:1
-
eprocess
获得wrk中当前进程eprocess结构体(Get the current process eprocess structure)
- 2014-04-23 10:02:51下载
- 积分:1
-
CStatic(ownerdraw)
MFC Static 自绘控件,美化控件。(Static OwnerDraw)
- 2013-10-19 13:46:17下载
- 积分:1
-
PCI-9524-Users-Guide
PCI 数据采集卡,9524,实现数据采集,凌华的卡,性能高,性价比好(PCI Card,easy to use,very good,cheap
and can fit many cases)
- 2016-06-02 14:41:48下载
- 积分:1
-
base-station-simulation
中兴捧月,基站模拟程序,使用CSocket类(ZTE holding on, the base station simulator, using class CSocket)
- 2011-06-24 15:18:52下载
- 积分: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
-
-SourceCode
数字图像处理,何斌 ,VC++.关于图像处理的典型基本算法的实现,(Digital imageprocessing of pro.He)
- 2009-11-04 22:10:01下载
- 积分:1