搜索资源列表
myknapsack
- a) 0-1背包问题采用的是动态规划法,该算法思想简介如下: 有些问题常常没有办法把它们分成较小数目的子问题，在这种情况下，可以试着把问题分成必要多的子问题，每个子问题又可以分成数目不确定的必要多的子子问题，这样就会产生大量的子问题。如果分得的子问题界限不清，互相交叉，则在大量的子问题中会存在一些完全相同的子问题，因而在解这类问题时，将可能重复多次解同一个子问题。这种重复当然是不必要的，避免的方法可以在解决一个子问题后把它的解（包括其子子问题的解）保留下来，若遇到求解与之相同的子问题的时候，
Srand
- 生成随机数的一个小程序，这种方法每次调用第一次产生的随机数相同率很高，但是做个循环连续调用几次，然后调用最后一次得到的随机数，就可以避免这种问题-Random Number Generation of a small program called this method the first time the same number of random high rate But to be a continuous cycle called several times, and then the
questionofvector
- 解决一个矩阵问题。具体的问题看文件说明。和源码。-solve a matrix problems. Look at specific problems documented. And the source.
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
nQueenPuzzle
- 八皇后问题，用Ｃ＋＋编程，在ＶＣ＋＋上运行正确，效率还不错-eight Queen's problems, and use C + + programming in Visual C + + running on the right, also good efficiency
Gomory
- 求解整数规划的问题可以解决一般的整数规划模型的解而且效率比较高！在matlab下调试通过-Solving integer programming problems can be solved in the general solution of integer programming model and more efficient! Adopted under the debugger in matlab
Josephus
- 解决约瑟夫问题的一个较为简单的例子的源代码。-Joseph problems to solve a relatively simple example of the source code.
qi_pan
- 用C++语言编写的残缺棋盘问题的分治法源代码，很完整，可直接编译运行。-Using C++ language problems and incomplete chessboard divide and conquer the source code, it is complete, can be directly compiled to run.
stone
- 使用典型的动态规划的思想解石子问题，不过没有添加注释-The use of a typical dynamic programming solution of pebbles thinking problems, but did not add a comment
Businessmen_Crossing_SRC
- 解决商人渡河问题。该问题为：有三个商人，三个强盗，和一条船（船每次只可以载小于等于两个人）他们同在河的一边，想渡过河去，但是必须保证在河的任何一边必须保证商人的数目大于等于强盗的数目，并要满足渡河次数尽可能的少，应该怎么过这条河呢？ -To solve business problems crossing. The problem is: There are three businessmen, three robbers, and a boat (each boat can only c
SortBasketball
- 递归方法,实现了篮球排错问题. 题目如下： 请编写程序求解篮球错排问题。已知n个篮子一字排开（n为用户输入的任意正整数） ，从左 到右分别标着号：1，2，... ...，n；每个球也有编号，分别也是1，2，... ...，n。现要将这n 个球全部放入这n个篮子中，满足：每个篮子放置1个球，球的号不能与其所在的篮子的号 相同，且在相邻篮子内的球的球号不能相邻。例如，如果在相邻两个篮子内的球的球号分 别为9和10，则是不允许的。请输出所有符合要求的放球方式（对于每种符合要求
R_WP1
- 操作系统中生产者与消费者问题的模拟，对于出现的死锁情况，采用置换算法解决。-Producers and consumers in the operating system simulation problems, for the deadlock situation occurs, the use of replacement algorithm to solve.
compute_lasfousnum
- 采用分治法快速求解拉斯斐切数。代码用C语言编程实现，可用于处理数学问题。-The divide-and-conquer method fast solving Lasifeiqie number. Code with C language programming, can be used to deal with mathematical problems.
Dynamic_hash
- 动态哈希的具体实现，代码注释的非常的清晰，格式规范，已经测试过了，完全没有任何的问题-Concrete realization of dynamic hash code comments is very clear, standardized format, has been tested, completely without any problems
queen
- vc6下的控制台程序，实现四皇后问题，解决算法问题-vc6 under the console program, the four-queens problem solve algorithmic problems
laser
- 迅速壁障前进，分为三种情况讨论，可以快速简单的解决壁障问题-Obstacle avoidance is one of the most challenging problems for the topic of UAV indoor navigation. In this paper, an indoor obstacle avoidance strategy based on Scanning Laser Range Finder (SLRF) is developed, so t
share_WLAN
- 电脑插一个无线网卡后用netsh命令把有线网共享成无线，免去买路由器和不稳定的问题，方便好用-After the computer plug a wireless card with the netsh command to share a wireless cable network, eliminating the need to buy a router and instability problems, easy to use
Remote-desktop
- 远程桌面! V1.0 你的桌面我作主! 远程服务支持库例程,配合《易语言远程控制技术教程》之用. 远程控制实际上只要对桌面进行控制,基本上就没有什么问题了. 我们的口号:集成也是种创新. 一.软件简介: 这是一个将对方电脑桌面进行抓屏,查看的小软件,并且可用鼠标控制受控端电脑,也可以使用快捷键,及输入文字.类似于QQ的远程协助功能. 二.软件特点: 1.全面采用了远程服务支持库,支持大图片传输入. 2.无论两台电脑的分辩率有差别,鼠标控制时均能准确定位
five-classic--C-code
- 里面有五个C语言初学者遇到的经典递归问题的代码及详解！八皇后、回文、顺转矩阵、斐波那契及整数分划问题。-There are five classic C language for beginners recursive problems encountered by the code and explain! Eight queens, palindrome, clockwise rotation matrix, Fibonacci and integer partition problem.