-
进制转换是数据结构中的栈的应用的一个典型例子
进制转换是数据结构中的栈的应用的一个典型例子- Enters the system transformation is in a construction of data
stack application typical example
- 2022-10-02 01:30:03下载
- 积分:1
-
jsp网上选课系统
本系统是简易的网上选课系统,包括学生的选课查成绩、教师打分以及管理员的一些后台操作。本系统是基于jsp环境下进行设计的,学习运用JSP 请点击左侧文件开始预览 !预览只提供20%的代码片段,完整代码需下载后查看 加载中 侵权举报
- 2022-04-18 14:07:33下载
- 积分:1
-
使用指针实现的自然归并排序。是学习指针和数据结构的很好的资料,要的就快下吧。...
使用指针实现的自然归并排序。是学习指针和数据结构的很好的资料,要的就快下吧。-use of the natural target to achieve its stock ranking. Yes learning targets and data structure of good information to the fast are you.
- 2023-02-11 12:25:03下载
- 积分:1
-
pc游戏编程_人机博弈,算法和实现都比较完整,源码可运行。且可以从中学到很好的算法知识,和人机博弈...
pc游戏编程_人机博弈,算法和实现都比较完整,源码可运行。且可以从中学到很好的算法知识,和人机博弈-pc game programming _ man-machine game, algorithms and realization are relatively complete, source code can run. And can learn a good knowledge of algorithms, and human-computer game
- 2023-08-13 12:45:05下载
- 积分:1
-
自己的作品。。基于VB的图书馆管理系统。
感觉很有现实意义...
自己的作品。。基于VB的图书馆管理系统。
感觉很有现实意义-their work. . VB-based library management system. Feeling very realistic significance
- 2022-07-13 19:45:07下载
- 积分:1
-
POJ 1222己AC源代码,不信你可以试试.
POJ 1222己AC源代码,不信你可以试试.-POJ 1222 F AC source code, do not believe you can try.
- 2022-05-30 12:25:26下载
- 积分:1
-
data structure Cavaliers travel Algorithm
数据结构 之骑士周游算法-data structure Cavaliers travel Algorithm
- 2022-03-21 19:21:23下载
- 积分:1
-
大整数整除,char *d返回余数,char*c返回结果
大整数整除,char *d返回余数,char*c返回结果
-Large integer divisible, char* d return the remainder, char* c return result
- 2022-02-20 02:35:55下载
- 积分:1
-
Shortest Path inquiries, the company is ESRI arcobject development of the compon...
最短路径查询,用的是ESRI公司arcobject组件开发的,已经作成dll,用起来非常的方便-Shortest Path inquiries, the company is ESRI arcobject development of the components, make dll with it is very convenient
- 2023-08-12 13:35:03下载
- 积分: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