-
解N元一次方程，从文件读入整数 N, 然后读入N*（ N+1）矩阵，得到解并输出到文件中。...
解N元一次方程，从文件读入整数 N, 然后读入N*（ N+1）矩阵，得到解并输出到文件中。-Solution of N-linear equation, reading from a file into an integer N, and then read into the N* (N+1) matrix obtained solution and the output to a file.
- 2023-07-04 21:35:03下载
- 积分：1
-
C, C language data structures and algorithms important procedure is all.
C、C++语言实现的数据结构重要算法和程序
比较全。-C, C language data structures and algorithms important procedure is all.
- 2022-02-04 09:44:48下载
- 积分：1
-
1．定义图的数据结构。
2．编写函数，用邻接表实现图的存储结构，求图的顶点的度数。
3．编写函数，输出图的遍历序列。...
1．定义图的数据结构。
2．编写函数，用邻接表实现图的存储结构，求图的顶点的度数。
3．编写函数，输出图的遍历序列。-1. The definition of graph data structure. 2. Write a function, using adjacency list implementation diagram of the storage structure, find the vertex of degree. 3. Write a function, the output graph traversal sequence.
- 2022-02-13 12:01:18下载
- 积分：1
-
The bank payment management information system uses the VF
edition, may manage t...
银行支付管理信息系统采用VF编辑，可以管理简单的银行支付系统。- The bank payment management information system uses the VF
edition, may manage the simple bank payment system.
- 2022-02-04 23:21:28下载
- 积分：1
-
data structure c
数据结构c++-书的一些源代码-data structure c-some of the source code
- 2022-01-30 17:25:38下载
- 积分：1
-
求解可达距阵 自己写的 请大家指教
求解可达距阵 自己写的 请大家指教 -solution can write their own matrix Please enlighten Thank you
- 2022-05-06 21:28:46下载
- 积分：1
-
内部排序的所有算法，而且有相关可执行例子，包括插入排序，选择排序，希尔排序，快速排序，堆排序，归并排序等，很全，很孀。...
内部排序的所有算法，而且有相关可执行例子，包括插入排序，选择排序，希尔排序，快速排序，堆排序，归并排序等，很全，很孀。-sequencing of all internal algorithm, but is related to the executable examples, including insertion sort, select, in order of ranking Hill, the quick sort, heap sort, merging sequencing, all very, very widow.
- 2023-08-09 06:40:03下载
- 积分：1
-
database connection pool code
数据库连接池的代码-database connection pool code
- 2022-08-20 01:37:50下载
- 积分：1
-
Description of the problem: Given n
问题描述：
给定n个石子，其重量分别a1,a2,a3...an,要求将其划分成m份，每一份的划分费 义为这份石了中最大重量与最小重量的差的平方。总划分费用等丁m份划分费用之和。
编程任务
对于给定的n个石子，求一种划分方案，使得总划分费用最小。-Description of the problem: Given n-stones, its weight, respectively a1, a2, a3 ... an, asked that it be divided into m copies, each of the division of costs defined as the weight of the stone of the largest and the smallest weight difference the square. Small m the total costs were divided into the sum of the cost. Programming tasks for a given n-stones, seek a kind of division, making the total cost of the smallest division.
- 2022-04-30 14:06:05下载
- 积分：1
-
tree traversal of the four, China and Syria, the former sequence after sequence...
树的四种遍历方式，中叙，前序，后序和按层遍历算法，前三个用递归很好实现，最后一个复杂点。-tree traversal of the four, China and Syria, the former sequence after sequence and by layer traversal algorithm, the former three Recursive properly achieved, Finally a complex point.
- 2022-08-17 13:05:30下载
- 积分：1
