-
adjustment
三角高程近似平差计算（包括高差计算）程序，外业资料需要整理成练习文档（测站信息）.txt和练习文档（测站点观测信息）.txt的形式(Triangle elevation approximate adjustment calculation (including height difference calculation) program, field data need to be organized into practice document (station information) .txt documents and exercises (the station observation information) .txt form)
- 2020-11-07 23:49:48下载
- 积分：1
-
Windows_API
非常实用的Windows API参考手册，可以方便开发者快速查找所需API(Very useful Windows API reference manual, you can easily find the API developers to quickly)
- 2010-05-16 18:35:32下载
- 积分：1
-
drag
vc实现拖放操作的程序源码，希望对大家有所帮助(vc drag and drop operation of program source code, we want to help)
- 2011-06-05 23:07:28下载
- 积分：1
-
Dual-mode-research-for-microgrid
微网的双模式研究，对微电网逆变器的下垂控制、PQ控制以及孤岛检测方法进行了调研，对它们进行简要的叙述，文档作为课题的开题报告(Dual-mode research for microgrid)
- 2015-06-13 21:17:02下载
- 积分：1
-
cprogram
说明： 单纯形法C语言程序，适用于目标方程在约束方程的基础上，求解！(visual C++)
- 2011-04-17 20:52:01下载
- 积分：1
-
TadaptiveOFDMh
本程序利用改进的CHOW算法，仿真了自自适应OFDM系统的性能，并画出了SNR
(This program makes use of improved CHOW algorithm simulates the performance of self-adaptive OFDM system, and draw the SNR)
- 2012-08-20 06:45:10下载
- 积分：1
-
Directsound
封装在单个类运用Directsound编制程序完成实时混音，很不错的读取程序(Encapsulated in a single class to use Directsound preparation program complete real-time mixing, very good reading program)
- 2012-09-23 22:24:39下载
- 积分：1
-
usb_20
usb2.0协议相关文档，有助于程序开发，请参考上传得代码使用。(USB2.0 protocol-related documents, contribute to program development, please refer to upload a code to use.)
- 2008-07-22 01:53:22下载
- 积分：1
-
7308961
ansi字符串与Unicode字符串转换的代码 包括UTP－8(ANSI string with Unicode string conversion code Including UTP - 8 -)
- 2017-07-15 01:29:32下载
- 积分：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
