-
俄国人写的内存数据库的delphi封装
俄国人写的内存数据库的delphi封装-Russian people write memory database delphi Packaging
- 2022-04-24 15:04:06下载
- 积分:1
-
ADO 访问Access数据库
ADO 访问Access数据库-ADO Access database
- 2022-08-20 03:19:48下载
- 积分:1
-
mysql-5.0.45.tar.gz
Mysql5.0的源代码,可以不受系统平台限制,而解决原来使用数据库的软件顺利平移的问题。
- 2022-04-11 19:58:12下载
- 积分:1
-
包括数据结构中最常用的6种排序算法和相关解释,适用与严蔚敏的c语言版。...
包括数据结构中最常用的6种排序算法和相关解释,适用与严蔚敏的c语言版。-including data structure of the six most common types of algorithm and the related interpretation, application and Yan Wei Min c language version.
- 2022-06-17 00:42:52下载
- 积分:1
-
VB的图书馆系统,数据库使用ACCE
VB的图书馆系统,数据库使用ACCE-VB of the library system, the use of ACCESS database
- 2022-12-03 20:30:03下载
- 积分:1
-
check the information paper form
查询资料的表单文件-check the information paper form
- 2022-11-02 12:25:03下载
- 积分:1
-
VC6.0开发的社区访问数据库管理系统下
VC6.0下开发的Access数据库小区管理系统-VC6.0 developed under the Community Access database management system
- 2022-06-20 11:47:49下载
- 积分:1
-
Pre
前k条最短路径(KSP)算法在国内鲜有研究,本压缩包中文献整合了自1971年此问题被提出后几十年来的论文共25篇。
其中以Martin先生的删除(Delelte)算法与Yen先生的背离(Devation)算法为主。
其中所有文献均来自网络。含有两篇中文文章以及23篇英文文章。
算法的复杂度基本控制于O(logn)内-Pre-k shortest paths (KSP) algorithm in the domestic few studies in the literature in this compressed package integration since 1971, this issue has been moved for several decades a total of 25 papers. Among them, Mr. Martin removed (Delelte) algorithm and Mr. Yen departure (Devation) algorithm is based. In which all documents are from the network. Contains two Chinese articles and 23 articles in English. The complexity of basic control algorithms in O (logn) in
- 2023-01-02 04:10:18下载
- 积分:1
-
代码茂 LCD4bit.c
空 LCD_Enable(void)
{
output_high(LCD_EN) ;
delay_us(100) ;
output_low(LCD_EN) ;
delay_us(500) ;
}
//Ham Gui 4 位杜代替 Ra 液晶屏
无效 LCD_Send4Bit (无符号字符型数据)
{
output_bit (LCD_D4,数据与 0x01) ;
output_bit (LCD_D5,数据 & 0x02) ;
output_bit (LCD_D6,数据 & 0x04) ;
output_bit (LCD_D7,数据 & 0x08) ;
/ /
- 2023-08-23 22:00:03下载
- 积分:1
-
问题描述:设有11种不问的钱币各若干张,可用这II种钱币产生许多不同的面值。试
设计一个算法,计算给定的某个面值,能有多少种不同的产生方法。例如有1分3张,...
问题描述:设有11种不问的钱币各若干张,可用这II种钱币产生许多不同的面值。试
设计一个算法,计算给定的某个面值,能有多少种不同的产生方法。例如有1分3张,2分 3张,5分1张,则能组成7分面值的方法有:3个1分+2个2分,1个1分十3个2分,2 个1分+1个5分,1个2分+1个5分共四种。
^编程任务:对于给定的II种不同钱币,编程计算某个给定面值能有多少种不同的产生
方法。-Problem Description: There should be 11 kinds of coins did not ask the number of beds available this II produced many different kinds of coin denominations. Try to design an algorithm to calculate a nominal value of a given that there can be many different returned. For instance, a sub-3, 2 points 3, 5 min 1, then can be composed of seven sub-par methods are: 3 1 min+2 2 points, a 1 minute 10 3 2 points, 2 1 points+1 5 points, a 2 min+1 5 minutes of four kinds. ^ Programming task: for a given II different coins, the calculation of a given program can have many different denominations is returned.
- 2022-11-21 20:10:03下载
- 积分:1