-
vc看护进程
vc看护进程,功能单一,高效。把看护进程和应用程序放在同一个目录下,可以实现程序看护猫的作用,可以保证看护进程和应用程序的可靠运行
- 2022-01-26 01:59:31下载
- 积分:1
-
三星2410 Windows CE 4.2 触摸屏驱动源码。适合所有以S3C2410X为主芯片开发的平台。...
三星2410 Windows CE 4.2 触摸屏驱动源码。适合所有以S3C2410X为主芯片开发的平台。-Samsung 2410 Windows CE 4.2 source-driven touch screen. Suitable for all mainly to UART chip development platform.
- 2022-05-19 08:45:45下载
- 积分:1
-
一个基于struts,tile,jstl的留言本
一个基于struts,tile,jstl的留言本-struts, tile, the voice of the JSTL
- 2023-04-18 02:25:03下载
- 积分:1
-
多文档窗口自动变化
在多文档应用程序中,子框架的视图是formview格式,本程序实现formview内控件的自控变化,使其符合子框架的大小,layout格式,是一个比较成熟的代码,用户拿来直接用就可以,方便用户重复性劳动,提高效率
- 2022-02-14 18:46:11下载
- 积分:1
-
示例自动完成框
AutoCompleteBox定义在 Silverlight 工具包,您可以找到其最新版本在这里。如果没有已经安装工具包,请从 http://developer.nokia.com/Community/Wiki/How_to_use_Auto_Complete_Box_in_Windows_Phone 按照安装说明进行安装。
- 2022-05-17 19:07:13下载
- 积分:1
-
一个用户登录身份验证的安卓应用程序
开发一个应用程序来验证用户登录时正确的凭证输入和显示信息。
- 2022-05-23 22:37:04下载
- 积分:1
-
求阶乘算法(0
求阶乘算法(0---10000)标准C++语言控制台应用程序 可能很多人都曾经想过要实现一些比较大的数的阶乘,但是C++中提供的标准数据类型其存储空间太小,根本无法实现。我们可以通过其他方法来实现,本程序用一个很简单的算法实现数的阶乘,程序很短,也很简单,各处都有注释,相信大家很容易就可以看懂,下载源码后在VC6.0中打开编译后即可运行,程序经少许改动可以实现更大的数的阶乘,有兴趣的读者在看完本程序后可一动手试试,其乐无穷!!希望这个程序能给大家一点帮助-The arithmetic for counting factorial(0-10000)
This is a standard C++ language console application, many people could want to relize the factorial of some large numbers, but the memory space of the standard data type provided by the C++ is too small, so it can not realize at all. But we can realize it by other method, the program realize the factorial of the number you give by a simple arithmetic ,this is a short and easy program, and there are remarks everywhere, I believe that everyone can easily understand it, after downloading the sound code you can open it in VC6.0, then edit and run it. you also can change something to realize the factorial of a larger number, the reader who is interesting in it can have a try, there are more happiness in it!! At last,
- 2023-02-22 10:45:03下载
- 积分:1
-
实现。
基于列表操作实现。-achieve.
- 2022-04-15 16:44:44下载
- 积分:1
-
该程序实现对一维数据轴上的最临近点的求解问题 采用方法:分治方法1(该方法在递归时由于使用数组的值,使得递归进栈的数据很多,消耗系统空间很大,所以处理的个数经测...
该程序实现对一维数据轴上的最临近点的求解问题 采用方法:分治方法1(该方法在递归时由于使用数组的值,使得递归进栈的数据很多,消耗系统空间很大,所以处理的个数经测试不超过70个,可见在设计程序时,考虑空间的使用也是很必要的!)-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : a partition method (the method when the use of recursive array, which makes the recursive stack into many of the data, consume much space, the number of tested not more than 70, based in Visibility terms procedures, the use of space is also necessary!)
- 2023-08-13 21:00:03下载
- 积分:1
-
primary programming, the way C
初级编程,了解C的写法-primary programming, the way C
- 2022-07-25 20:49:29下载
- 积分:1