▍1. RMI
Dijkstra programming
更多选项
▍2. test
某公司收到若干报价，然后报价由低到高进行排序。设最低报价为F,最高报价为G。n=0.2*(G-F) 设A，B，C，D，E五个等距区间并取： A=[F,F+n） B=[F+n,F+2n) C=[F+2n,F+3n) D=[F+3n,F+4n) E=[F+4n,G) 所有的报价都按各自的大小，分别列入上面五个区间。各自区间内的最小报价为该区间的代表报价。如果某区间内没有报价 则以小于该区间的且与该区间相邻的区间内的最高报价代表该区间报价，如果该区间与与之相邻的较小区间内都没有报价则该区间不参加最后计算。取各区间的代表值， 求出其平均值 做为评标基准报价 (A company received a number of quotations, and quotations from low to high order. Minimum price for the F, the highest offer for the G. n = 0.2* (GF) Let A, B, C, D, E, and five equidistant intervals obtained: A = [F, F+ n) B = [F+ n, F+2 n) C = [F+ 2n, F+3 n) D = [F+3 n, F+4 n) E = [F+4 n, G) All quotes are by their size, five were included in the above range. The minimum offer their own range representative of the range quoted. If a range does not offer less than the range of places and range of adjacent intervals with the highest offer within the offer on behalf of the interval, if the interval and the adjacent smaller range do not offer the range not to participate the final calculation. Take the representative value of each interval, calculate the average price as a benchmark evaluation)
▍3. FinalExam
C语言期末考试题，含答案。数组、链表、函数等的使用和C编程。(failed to translate)
▍4. migong---cPP
迷宫问题C++代码。。。解决迷宫问题。。。。(Maze C++ code. . . Solve maze problems. . . .)
▍5. expression
利用栈完成算术表达式求值：从键盘或文件中输入算术表达式，计算其结果并显示。要求处理过程为：（1）转换为后缀表达式并输出；（2）对后缀表达式求值并输出。 输入的表达式中可以有整数、实数、括号，运算符包括+、-、*、/、#（代表单目负）。可以多次输入不同的表达式进行计算，直到用户选择“退出”。栈的基本操作可以自己实现，也可以使用系统提供的STL实现。 (Done using an arithmetic expression evaluation stack: file input from the keyboard or an arithmetic expression, calculate and display the results. Requirements process: (1) to postfix expression and output (2) evaluation of the postfix expression and output. Enter the expression can be integers, real numbers, parentheses, operators including+,-,*,/,#( representatives unary minus). You can enter several different expressions are evaluated until the user selects " Exit." Stack can implement the basic operations, you can also use the system implementation of the STL.)
▍6. AOV-Sort-Algorithm
使用C语言编写的AOV网的拓扑排序，内附有详细的源码解释和输入示意图(Using C language AOV network topological sorting, enclosing a detailed explanation and input source diagram)
▍7. yuesefu
约瑟夫问题，通过C语言对约瑟夫问题进行了分析和讲解，从而解决问题(Joseph problems, by Joseph C language issues are analyzed and explained, in order to solve the problem)
▍8. CEIA
POJ141的源代码，以空间换时间，速度很快很好用。(POJ141 the source code for time in space, fast easy to use.)
▍9. beibao_9
背包问题，经典的9个算法详细解析。每一个都有详细的讲解和代码分析。。(Knapsack problem, the classic algorithm detailed analysis of nine. Each with a detailed explanation and code analysis. .)
▍10. Binary_tree
二叉树的C++实现，成员可以自己调整，实现了各种修剪此树的方法：初始化，增加节点，删去节点，复制树，读取节点，遍历树(Binary tree in C++, members can make their own adjustments to achieve a variety of pruning this tree methods: initialize, add nodes, delete nodes, copy the tree, read the node, traverse the tree)
▍11. Anorldi
关于Arnoldi算法的今年来的中文资料，希望能够给有兴趣编写这方面算法的人提供帮助(Arnoldi algorithm on the Chinese data this year, hoping to write this algorithm are interested in helping people)
▍13. @163
数值计算方法中高斯主元素消元法 在vc环境中运行 用于解方程组(Numerical methods in the Gaussian elimination method, the main elements of the environment in vc run for the solution of equations)
▍14. lianbiao
用c语言写的线性链表的创建、删除、插入、销毁代码(With c language to create a linear linked list, delete, insert, destroy code)
▍15. youlishi
有理数的算法，包括其加减乘除，启用的是单链表的形式来表达(Rational algorithms, including addition, subtraction, enabling a single-chain form of expression)
▍16. DBSCAN
数据挖掘中聚类算发中基于密度的算法DBSCAN(Hair count data mining clustering algorithm DBSCAN density-based)
▍17. 851DataStructure2009
江苏大学数据结构研究生试题2009Jiangsu University graduate examination papers(Jiangsu University graduate examination papers)
▍18. c5
说明： 问题描述：字符序列的子序列是指从给定字符序列中随意地（不一定连续）去掉若干个字符（可能一个也不去掉）后所形成的字符序列。令给定的字符序列X=“x0，x1，…，xm-1”，序列Y=“y0，y1，…，yk-1”是X的子序列，存在X的一个严格递增下标序列<i0，i1，…，ik-1>，使得对所有的j=0，1，…，k-1，有xij=yj。例如，X=“ABCBDAB”，Y=“BCDB”是X的一个子序列。 (Problem Description: character sequence is the sequence of a given sequence of characters from arbitrarily (not necessarily consecutive) to remove a number of characters (perhaps a not removed) after the formation of character sequence. So that a given character sequence X = " x0, x1, ..., xm-1" , the sequence Y = " y0, y1, ..., yk-1" is a sequence of X, X, there is a strictly increasing sequence subscript <i0，i1，…，ik-1> So for all j = 0,1, ..., k-1, with xij = yj. For example, X = " ABCBDAB" , Y = " BCDB" is a sequence of X.)
▍19. 11
任务 编写程序计算波兰表达式的值。 输入 输入第一行是一个整数，表示输入文件中共有几个波兰式，之后每一行是一个波兰表达式。 (Enter the first line is an integer, the input file there are several Polish, followed by a Polish expression for each line. Each expression contains numbers and binary operators+,-,*, operands and results are in [-101 000, 101 000] between. Can assume that each row of data (operation symbols and numbers) a total of not more than 100. 字典“Google 翻译”适合以下用途：搜索手机聊天商务:译者工具包全球商机洞察Website Translator关于 Google 翻译关闭即时翻译隐私权政策帮助点击可显示其他翻译 按住 Shift 键的同时拖动短语即可重新排序。 为翻译结果评分)
▍20. SortDemo
实现排序操作SortDemoSortDemo.rar,很不错的vc源码，希望对大家有所帮助。(To achieve the sorting operation SortDemo SortDemo.rar, very good vc source, we want to help.)
本站资源：696518 个
本站会员：104305 个
总计下载：494529 次
今日上传：0 个
- 优秀论文及配套源码 SVM Short-term-Load-Forecasting
- 综合能源优化含储能
- 用遗传算法改进粒子群GA-PSO算法
- 通过粒子群能够很好的解决优化问题 pso
- 天牛群算法 BSO
- 混沌粒子群优化算法
- 2019年中国研究生数学建模竞赛E题
- 智能算法的Matlab仿真程序及教程
- 《MATLAB R2016a神经网络设计与应用28个案例分析》随书代码
- BAS BP论文及代码
- denoising
- Airy 基模高斯光束
- EMS Microgrid
- 2012年全国大学生数学建模竞赛题目--葡萄酒的评价Wines-Evaluation
- GA-bp
- 本人调试的大作业 源程序模型+论文 intelligent_control_modle
- LSTM的例子、单向LSTM、双向LSTM、多层LSTM
- 遗传算法优化BP网络案例
- 通过yalmip平台调用cplex求解器 microgrid Cplex
- 基于lstm算法在MATLAB对短期风速进行预测 LSTM-regression-master
