-
KSGLREG
一个用Qt编写的类注册机程序，在windows下根据磁盘序列号，用md5加密方式生成可用的用户识别序列与授权序列。
此源码主要展示了Qt如何调用windowsAPI，希望对大家有用(A class RI program, written using Qt under windows disk serial number available sequence of user identification and authorization sequence generated by md5 encryption. The main source show a Qt how to call windowsAPI, hope to be useful)
- 2013-01-02 18:15:05下载
- 积分：1
-
visualphone
采用VB进行可视化通信编程的一个应用实例(using VB Visual Communication Programming Application of a)
- 2006-08-06 23:35:40下载
- 积分：1
-
xcEduService01
后端学成网站代码，教育网站模型，提供了后端的基础框架的搭建等(Backend Learning Website Code, Educational Website Model)
- 2019-06-05 20:07:14下载
- 积分：1
-
8001_exe_luosiDLL_src
石器时代 螺丝端用的8001.exe DLL源码，含32色支持(StoneAge luosiSA 8001.exe DLL source code, with 32 color support)
- 2021-04-24 12:38:47下载
- 积分：1
-
TestWord
把word文件嵌入到系统中，不用另外打开其他程序，非常实用，可以应用到其他大型程序之中(Embedding word files into the system without opening other programs is very practical and can be applied to other large programs.)
- 2019-05-06 17:26:43下载
- 积分：1
-
zoj1094
zoj094
Matrix multiplication problem is a typical example of dynamical programming.
Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose.
For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix.
There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C).
The first one takes 15000 elementary multiplications, but the second one only 3500.
Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy.
(Matrix multiplication problem is a typical example of dynamical programming.
Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose.
For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix.
There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C).
The first one takes 15000 elementary multiplications, but the second one only 3500.
Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy.
)
- 2012-06-10 10:38:53下载
- 积分：1
-
CUGEDIT
说明： CUG输入编缉，打字教程的C语言源程序，非常好的程序，很有用，大家赶快下载
(CUG input editing, typing tutorial for C language source code, very good program, very useful, we quickly download)
- 2010-05-03 05:12:33下载
- 积分：1
-
cluster
实现聚类分析的几种典型算法，包括Greedy、K-Means、FCM、Xie-Beni等。可以对提供的几个数据库文件进行聚类操作，并显示和统计结果的各项数据。程序具有基于C#的图形界面，操作直观方便。(Cluster analysis of several typical algorithms, Greedy, K-Means, FCM, Xie-Beni, etc.. The cluster provides several database files, and display the data and statistical results. The program has a graphical interface based on C#, easy and intuitive.)
- 2013-03-31 04:33:17下载
- 积分：1
-
SourceCode09_i2c_eeprom_OK
基于DSP28335的IIC接口EEPROM驱动程序(DSP28335 IIC EEPROM source)
- 2014-09-16 16:09:21下载
- 积分：1
-
convert
conversion tool for units
- 2019-07-10 01:27:04下载
- 积分：1
