-
UartAssist
这个是非常流行的串口调试工具的VC++源代码,对于需要深入了解串口通信的朋友非常有帮助,需要的朋友可以看看。(This is a very popular tool for serial debug VC++ source code, the need for deeper understanding of serial communication very helpful friend, a friend in need can take a look at.)
- 2021-04-22 15:38:49下载
- 积分:1
-
SPA
连续投影算法的Matlab程序 下载后可以直接使用(Successive projections algorithm
)
- 2020-12-07 09:59:21下载
- 积分:1
-
676556
使用日期时间控件,VC++精选编程学习源码,很好的参考资料。(Use the date and time control, VC++ select learning programming source code, a good reference.)
- 2013-12-01 18:01:55下载
- 积分:1
-
GroupPlocyConfig
windows系统组策略操作封装.............(windows grouppolicy operator......................)
- 2013-11-13 21:57:02下载
- 积分:1
-
ty
说明: 8*8的矩阵键盘程序,是很好的代码喔。键盘程序采用的是查询的方式来写的喔。(8* 8 matrix keyboard procedures, is a very good code. The keyboard is used for writing.)
- 2012-03-13 16:07:54下载
- 积分:1
-
Recursive_integer_division
递归法求解整数划分。
整数划分,是指把一个正整数n写成如下形式:
n=m1+m2+…+mi (其中mi为正整数,并且1 <= mi <= n),则{m1,m2,...,mi}为n的一个划分。
如果{m1,m2,...,mi}中的最大值不超过m,即max(m1,m2,...,mi)<=m,则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
- 2014-02-06 14:21:38下载
- 积分:1
-
src
restores the SDT. an example in c++
- 2009-07-10 22:14:45下载
- 积分:1
-
Ri230-v1
c++ 利用ADO操作数据库,供初学数据库编程的人参考(c++ to operate the database by ADO)
- 2010-12-04 20:49:35下载
- 积分:1
-
vc-zhuru
一段注入代码,简单易用,适合研究
用外挂的可以看看(Inject code section, easy to use, suitable for research)
- 2013-03-26 22:21:43下载
- 积分:1
-
MultiCastReceiver
多媒体播放方面的实用例子程序,用visual C++实现(the program for muti-media,It‘s very useful)
- 2009-04-16 13:41:01下载
- 积分:1