搜索资源列表
fibonacci系列打印
- 该程序是一个有关fibonacci数列的打印问题 其中的一个功能是能修改生长周期 虽然很简单但不是每个人都会做的哟-that the procedure was a Fibonacci series, the printing problem which is a function of the growth cycle would amend Although very simple but not everyone will do yo
递归枚举模板
- 递归枚举模板 问题描述：生成长度为n的字串，其字符从26个英文字母的前p(p≤26)个字母中选取，使得没有相邻的子序列相等。例如p=3，n=5时： // abcba 满足条件 // abcbc 不满足条件 //输入：n p //输出：所有满足条件的字串及总数-recursive template Problem descr iption : n generation length of the string and its 26 characters from the
greedy_three
- 用贪心算法求最小生成树的问题是可以由这个程序来实现的。它求出在一棵树中哪些边组成的通路具有最小的权值。-with greedy algorithm for the minimum spanning tree problem can be resolved by this procedure to achieve it. It obtained in a tree in which the edge of the pathway with minimum weight.
8num
- 使用JAVA编写的八数码问题求解程序,程序使用A*算法-use Java to prepare the eight digital problem solving procedure is the use of the A * algorithm
circlecutting
- 集装箱的装箱问题 给定一个集装箱，其长为L，宽为W和高为H，现有一批圆柱形木材，每根木材的长均为L，但是半径不同，设第i根木材半径为ri。问如何装箱，使得集装箱的空间利用率最高？ 本程序要求用贪心算法解决: 贪心算法总是作出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，它所做出的仅是在某种意义上的局部最优解。 -problem given a container, its long-L, width W and H for high, the existing bat
myknapsack
- a) 0-1背包问题采用的是动态规划法,该算法思想简介如下: 有些问题常常没有办法把它们分成较小数目的子问题，在这种情况下，可以试着把问题分成必要多的子问题，每个子问题又可以分成数目不确定的必要多的子子问题，这样就会产生大量的子问题。如果分得的子问题界限不清，互相交叉，则在大量的子问题中会存在一些完全相同的子问题，因而在解这类问题时，将可能重复多次解同一个子问题。这种重复当然是不必要的，避免的方法可以在解决一个子问题后把它的解（包括其子子问题的解）保留下来，若遇到求解与之相同的子问题的时候，
7777777sw
- 一个简单的学生管理系统，是用C/C++混合写的，但由于时间不足。。。只有几个小时，所以做得不是很理想，但如果只是学习用，那就完全没问题了。-a simple student management system is the use of C / C was mixed, but because of the lack of time. . . Only a few hours, so do it is not ideal, but if only to study, it did not com
j_9238_input
- 实现文本内容的自动校验，标签属性与普通input相似，使用该标签后无需再考虑数据提交时的据校验问题。与struts的动态表单需要大量配置校验文本规则相比，这里的工作量为0。 -achieve text automatic calibration, labeling and regular input attributes similar after using the label no longer consider the data submitted was checking the p
Hanoi
- 经典问题汉诺塔的递归解法（C++版），欢迎大家下载！-classic problem HANOR recursive solution (C version), all are welcome to download!
1005acm
- Problem Set is the place where you can find large amount of problems from different programming contests. Online Judge System allows you to test your solution for every problem.-Problem Set is the place where you can find large amount of problems fro
1006acm
- Problem Set is the place where you can find large amount of problems from different programming contests. Online Judge System allows you to test your solution for every problem.-Problem Set is the place where you can find large amount of problems fro
God
- 用Windows控制台程序实现A*算法在交通网络中寻找最短路径的应用，并附有实际的测试数据，程序已经调过没有问题。-Windows Console Application with the realization of A* algorithm to find the shortest path transport network applications, along with the actual test data, the program has emphasized there is
eight-queens-problem
- eight queens problem；e ight queens problem；e ight queens problem；e ight queens problem；e ight queens problem；eight queens problem；-eight queens problem；
Array-of-gold-coins-problem
- //金币阵列问题 /*算法思想：将原始数列作为参考数列（m*n)，将目标数列的第一列与本身的-n列分别进行对调 在每次对调后进行一下处理：比较对调后的第一列与原始数列的第一列，从而知道对应的行是否要 进行变换。行变换确定后，然后确定列变换，通过列遍历性的交换，将目标数列转换到原始数列*/ -//Gold array problem /* Algorithm thinking: the original series as the reference sequence (m*
The-monkeys-eat-the-peach-problem
- The monkeys eat the peach problem Microsoft Visual Studio Solution File, Format Version 11.00 # Visual Studio 2010 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "猴子吃桃问题", "猴子吃桃问题\猴子吃桃问题.vcxproj", "{5D215B38-B4D3-488C-A8CE-D96B83157364}"
Tower-of-Hanoi-problem
- 汉诺塔问题：将A柱上大小不一样的圆盘移到C柱上，借助B柱，其中A,B,C柱上的圆盘必须符合大在下小在上地顺序-Tower of Hanoi problem: the A column is not same size disc moved to the C column, the B column, where A, B, C disk column must be consistent with the big in small order in Shangdi
Joseph-problem-solving
- 这是一个<数据结构(C语言版本)>约瑟夫问题求解的一个小程序.-This is a <data structure (C language version)> Joseph problem solving a small program.
Traveling-salesman-problem
- we re storing the cost form city to city in a 2-dimentional array, the algorithm first solves the problem for the shortest way with a shortest cost, then we solve it with the gready algorithm just to compare the results.
Code-of--problem-solving-of-cPP
- c++程序设计第八版的源码，适合看书的时候配套使用-The code for Problem solving of c++,eight edition . For learning
The-maze-problem
- C++源码，控制台实现数据结构中的迷宫问题，可给出所有路径的路径图，路径总数和最短路径图-Using VC++ to realize the maze problem.It can figure out all paths and the shortest path.