-
magic word memory
魔法单词记忆――DAO访问ACCESS数据库-magic word memory-- DAO visit ACCESS database
- 2022-02-04 15:13:14下载
- 积分：1
-
cutting parts : a given width of the rectangular plate W, the height of rectangu...
零件切割问题：
给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小？
任给一个输入实例，能输出切割所需要的实际高度并能用图形演示切割的过程-cutting parts : a given width of the rectangular plate W, the height of rectangular plate unrestricted. Need from the board is cutting out respectively n height of the hi, wi width of the rectangular parts. Cutting parts to the rules of the height of the rectangular plate with a high degree of consistent direction. Asked how cutting makes use of the rectangular plate height h minimum? As an input for example, will cut output by the needs of the high and can be used graphic demonstration of the cutting proce
- 2022-01-27 17:45:40下载
- 积分：1
-
This is a decision tree classifiers on which the original algorithm C4.5 procedu...
这是一个有关决策树分类器中C4.5算法的原程序-This is a decision tree classifiers on which the original algorithm C4.5 procedures
- 2022-05-21 01:16:40下载
- 积分：1
-
实用的SQLite C++封装类
SQLite的封装类，简单实用，支持常用操作！
自己感觉封装的不错，运行平台有：windows、linux、unix。
如果有什么问题和建议，请邮件yin0123@sina.com
- 2022-11-08 15:15:03下载
- 积分：1
-
数据结构课本对应算法的程序实现，初学者有一定的帮助，包括一些常见的算法的程学实现。
数据结构课本对应算法的程序实现，初学者有一定的帮助，包括一些常见的算法的程学实现。-textbooks data structure corresponding algorithm program, beginners will help, including some common-learning algorithm to achieve.
- 2022-03-17 05:24:00下载
- 积分：1
-
想做个图片存取的程序，可JPG不行。请帮看一下。
想做个图片存取的程序，可JPG不行。请帮看一下。-Want to be a picture of the program access can not JPG. Please help to look at.
- 2022-08-18 09:39:36下载
- 积分：1
-
Shortest Path Problem Description C
最短路径问题C++描述-Shortest Path Problem Description C
- 2022-01-27 14:10:42下载
- 积分：1
-
Computes estimates for the number of fores ts of a graph. input as a 0
Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part.
- 2022-02-05 15:36:49下载
- 积分：1
-
编程求两个一元多项式的乘积。
输入
输入数据为两行，分别表示两个一元多项式。每个一元多项式以指数递增的顺序输入多项式各项的系数（整数）、指数（...
编程求两个一元多项式的乘积。
输入
输入数据为两行，分别表示两个一元多项式。每个一元多项式以指数递增的顺序输入多项式各项的系数（整数）、指数（整数）。
例如：1+2x+x2表示为：,,,
输出
以指数递增的顺序输出乘积： ,,,
零多项式的输出格式为：,-Programming seeking the product of two one-polynomial. Enter the input data for the two lines represent two unary polynomial. One dollar for each polynomial order of the exponential increase of the input polynomial coefficients (integer), index (integer). For example: 1+2 x+ x2 expressed as: " 1,0" , " 2,1" , " 1,2" , the output of the order of the exponential increase output of the product: " coefficient, index" , " coefficient, index" , " coefficient, the index " , zero polynomial output format is:" 0,0 " ,
- 2023-04-13 09:30:03下载
- 积分：1
-
贝尔曼
Bellman-Ford算法 是最短路径算法的一种-Bellman-Ford algorithm is the shortest path algorithm of a
- 2022-03-01 10:39:59下载
- 积分：1
