搜索资源列表
n!qiujie
- 本人初学c语言程序不是很拿手,n!的求法。。希望大家指教-I novice c language program is not very good at, n! The Method. . We hope the exhibitions
运用递归来解N皇后问题
- 运用递归来解N皇后问题-use recursive solution to the problem of N Queen
回溯法实现N皇后问题
- vc++源码 N皇后
单链表排序输入n个数,用单链表
- 单链表排序输入n个数,用单链表(任意算法)对其进行排序并按从小到大顺序输出。 ,Single-linked list to sort n the number of input, using a single list (any algorithm) and sort them from small to large order of output.
描述:把M个同样的苹果放在N个同样的盘子里
- 描述:把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。 输入:第一行是测试数据的数目t(0 <= t <= 20)。以下每行均包含二个整数M和N,以空格分开。1<=M,N<=10。 输出:对输入的每组数据M和N,用一行输出相应的K。 输入实例: 1 7 3 输出实例:8 -Descr iption: The same apples to the
fuperm
- 应用JBuilder环境开发,输入一个正整数n,输出1~n的组成的全排列-JBuilder application development environment, enter a positive integer n, output 1 ~ n the composition of the entire array
javaalgorithm
- 包括冒泡排序,归并排序,N皇后,最小生成树等经典算法的java实现代码-Including bubble sort, merge sort, N Queen, such as the classic minimum spanning tree algorithm java code
ddvip_com_04065038a97af4
- 采用循环,而不是递规,系统资源占有少可计算 n 皇后问题把问题线性化处理,可以把问题分块,在分布式环境下用多台计算机一起算。-The use of the cycle, rather than delivery rules occupy less system resources computable n Queen of issues to deal with the problem of linear, you can block the problem, in distributed en
queen
- n皇后问题,能够快速的算出24个点,24个点过侯程序会变慢-the question of queen
simulator
- Go back n protocol with hamming code implementation. this is made in java 5.
Drag-N-Drop
- drag and drop in flex application
go-back-n
- 通信编程中常用到的go-back-n算法的模拟显示,采用Applet可视化模拟,带算法说明文档,用于对GBN算法的理解。-Commonly used in communications programming to the go-back-n algorithm for the simulation showed that using Applet visual simulation, with algorithm documentation, understanding the algorit
drag-n-drop
- Drag n drop code in flash as2.0
n-queen-problem-display
- n后问题演示程序,算法分析与设计,递归算法-N queen problem demonstration program, the algorithm analysis and design, recursion algorithm
n-queen
- 解决n皇后问题 利用回溯算法 n后问题等于在n×n格的棋盘上放置n个皇后,任何2个皇后不放在同一行或同一列或同一斜线上。即规定每一列放一个皇后,不会造成列上的冲突;当第i行被某个皇后占领后,则同一行上的所有空格都不能再放皇后,要把以i为下标的标记置为被占领状态。用回溯法解n后问题,用完全n叉树表示解空间。可行性约束Place剪去不满足行,列和斜线约束的子树。从根节点出发搜索解空间树。算法搜索至空间树的任何一结点时,先判断该点是否包含问题的解。如果肯定不包含,则跳过对以该结点为根的子树的搜索,
In-three-loop-statement-for-n
- 用三种循环语句求n!绝对真是的!!!课程学习必要的,广大学生必备-In three loop statement for n! Absolutely really! ! ! The course of study is necessary, the majority of students essential! ! !
N
- 这是一个N点虚拟主机的前台,只要解包覆盖,免费下载的(安装好的)后台文件管理夹既可。--This is a N point of the virtual host in the foreground, as long as the package cover, free download ( install good ) file management folder can.
C(n-m)
- JAVA代码:该代码实现功能为数学中的C(n,m),n为下标,m为上标。-JAVA code: This code implements a mathematical function of C (n, m), n is the subscr ipt, m is superscr ipt.
N--java-
- 利用递归机制,可以很容易的求解n皇后问题。针对八皇后,总共有92种解。下面将给出N-皇后问题的一般求解代码,在这里代码是使用java编码的。-Recursive mechanism that can easily solve the n-queens problem. For eight queens, a total of 92 kinds of solutions. The following will give a general N-queens problem solving code
n queen的管道风格,调用返回风格,黑板风格等实现
- n queen的管道风格,调用返回风格,黑板风格,管道风格实现