-
iCordSource2
这是一个屏幕录制源代码，可以很清楚地录制计算机屏幕，用VC++编写的(This is a screen recording source code, can clearly record the computer screen, written in VC++.)
- 2020-06-16 10:40:01下载
- 积分：1
-
Notify-Icon
This control add your applications icon in the system tray.It also support baloon type tool tip. It s cool Control.
- 2013-09-20 07:04:01下载
- 积分：1
-
VC_UP_BallKey
说明： 说明：此为球形开关测试程序的上位机软件。
能够记录由下位机上传的每支球形开关
的通断情况，自动记录上传的时间，
并且会将历次的结果保存在PC机的硬盘
中，带有具体的日期，方便查询。(Note : This spherical switch to the testing procedures PC software. To record the next crew uploaded each spherical switch-off, automatically records upload time, and will keep all the previous results of the PC's hard disk, with the specific date, and easily accessible.)
- 2006-04-06 13:20:48下载
- 积分：1
-
RedHatWindow
VB语言写的仿Unix红帽操作系统界面，附带源码(VB language to write the copy Unix red hat operating system interface, with the source code)
- 2013-08-09 11:26:55下载
- 积分：1
-
VB6diqu
说明： 今天给大家带来使用文本文件作为数据源的 ComboBox中国城市三级联动的代码。
1.地区库更新非常方便，不会影响到其他功能（区划代码是唯一的）。
2.文本文件读取来速度很快。(n the past, I used VB6 to write an example of three-level linkage of ComboBox in Chinese cities, using MDB database. A few years ago, the code, the regional database is not the latest. Today we bring you the code of ComboBox, which uses text files as data sources, for three-level linkage of Chinese cities.
1. The regionalization library updates are very convenient and will not affect other functions (regionalization code is the only one).
2. Text files are read very fast.)
- 2019-06-05 09:34:04下载
- 积分：1
-
MNT1
Nucleus内核源码,包括任务的创建,任务间通信,中断处理.(Nucleus kernel source code, including task creation, task inter-communication, interrupt handling.)
- 2008-01-09 14:39:44下载
- 积分：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
-
poj3941
poj 3941
Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same.
In this problem, you are asked to write a program that finds the expected value of the number of given bills. (poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills.)
- 2013-07-16 20:45:28下载
- 积分：1
-
DlgIniTest
由于现代软件中，很多时候需要保留一些配置信息，而ini文件就是其中的方法之一，该工程简单而详细体现了ini文件的读写调用方式(Because of modern software, often need to retain some configuration information, and the ini file is one of the ways that the project reflects the simple and detailed invocation ini file read and write)
- 2013-11-03 15:52:15下载
- 积分：1
-
Addison-Wesley---CPP-by-Dissection-2002
this is visual C++ book
- 2011-05-05 19:21:23下载
- 积分：1
