-
TelBook
能实现添加，删除，查找，拨号等基本功能。当然还用到了windows皮肤，很漂亮的哟(Able to add, delete, search, dial-up and other basic functions. Of course, also used the windows skin, very beautiful yo)
- 2013-07-21 07:27:35下载
- 积分：1
-
vb_SQL_excel
利用vb开发环境连接wincc数据库，将wincc运行的数据导入excel中(SQL excel VB WINCC ADODB.Connection recorderset.Open AdoSql, Connection, adOpenDynamic, adLockOptimistic)
- 2012-10-23 15:44:44下载
- 积分：1
-
chengxu
编写一个函数，要求输入年月日时分秒，
输出该年月日时分秒的下一秒。
如输入2011年12月31日23时59分59秒，
则输出2012年1月1日0时0分0秒。
需要考虑闰年 和 2月的特殊情况 (Write a function that requires input date, hour, minute and second outputs of the date when the next second. If the input at 23:59:59 on December 31st, 2011, output at 0:00:00 on January 1, 2012. Leap year and February need to consider the special case)
- 2013-05-28 13:06:03下载
- 积分：1
-
SendGoose
模拟GOOSE报文发送过程，GOOSE报文的编码。(Analog GOOSE message sending process)
- 2020-09-10 16:28:00下载
- 积分：1
-
PrivateSubText1
校运动会代码（部分），使用VB编程，由学生自己开发(yundonghui)
- 2010-12-14 10:56:17下载
- 积分：1
-
myTask0
有的科技图书会附有索引，其中列出书中重要术语出现的页码，便于读者查看。试设计一个类似的程序。输入是一个英文文本文件，输出是文件中关键字及其出现的行号的列表并按照关键字有序排列。程序运行方式：>index inputfile keys outputflie
(Some books will be accompanied by technology index, which lists important terms appear in the book pages, easy to readers to view. Try to design a similar procedure. English text input is a file, the output is a file that appears in the keywords and their line numbers list and ordered according to keywords. Program run mode:> index inputfile keys outputflie)
- 2013-10-28 21:15:13下载
- 积分：1
-
Long-integer
长整数运算(双向链表),实现长整数无限长加减法的运算(Long integer (two-way linked list), to achieve long-integer addition and subtraction of infinite computing)
- 2011-10-29 16:54:42下载
- 积分：1
-
COM_PORT_SETTING
说明： 在EVC4.0环境下，设置串行通讯端口程序例(The EVC4.0 environment, set up procedures for cases of serial communication ports)
- 2009-08-27 13:47:41下载
- 积分：1
-
tongjimima
统计字母出现的频率，统计英文文章相应字母出现概率(Statistics the frequency of occurrence of English letters, the letters corresponding to probability statistics)
- 2011-12-19 20:02:36下载
- 积分：1
-
youxiangtu
编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路：
（1）如果为n阶，则随机产生一个n*n的邻接矩阵；
（2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。
这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)
- 2008-06-14 02:33:57下载
- 积分：1
