-
zw2
主要是基于VC6.0和控件的实现,主要实现的功能是数学运算。(Mainly based on VC6.0 and control implementation, the main function is to math.)
- 2013-06-02 10:44:30下载
- 积分:1
-
H矩阵读取程序
通过文本文档读取矩阵,并存储为二重指针。(Read the matrix and store it as a double pointer.)
- 2018-03-06 10:20:30下载
- 积分:1
-
gc
说明: 简单垃圾回收器本人以多次试用效果不错,请大家多提意见
(Simple garbage collector I would like to try the effect of a good many times, please do so everyone)
- 2007-08-07 10:54:52下载
- 积分:1
-
of-second-interview-data
考研复试资料大全 本人计算机专业考入研究生,这份复试资料很多忙(One s deceased father grind second-round exam of resources I was admitted to the graduate computer science, the second-round exam information a lot)
- 2015-06-16 11:43:57下载
- 积分:1
-
ConvertBMP
说明: 说明: 压缩BMP图片,图片质量有些损失,但压缩率很大(Explanation: Compressing BMP pictures may cause some loss of image quality, but the compression rate is very high.)
- 2020-06-16 10:40:01下载
- 积分:1
-
musicplayer
音乐播放,可以实现简单的音乐播放功能,可以找到音乐文件进行添加(music play)
- 2013-12-01 17:23:55下载
- 积分:1
-
osg_osgearth
osgearth的文档资料不多,这里几乎是所有可以找到的中文资料,以及一些osg的中文资料(osgearth documentation much, here you can find almost all the Chinese data, as well as some of the Chinese data osg)
- 2020-11-19 09:59:38下载
- 积分:1
-
FileSafe
基于PKI体系的 CrytoAPI开发 文件保险箱 (PKI CrytoApi )
- 2016-11-14 13:32:53下载
- 积分:1
-
正态分布随机数
实现正态分布随机数,可以控制平均值和标准差(The realization of normal distribution random number)
- 2021-03-17 22:19:21下载
- 积分: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