文件名称:b~a~hh
介绍说明--下载内容均来自于网络,请自行研究使用
由n2个方块排成n行n列的正方形称为“n元棋盘”。如果两个皇后位于n元棋盘上的同一行或同一列或同一对角线上,则称它们为互相攻击。要求输出使n无棋盘上的n个皇后互不攻击的所有布局。 具体要求如下; (1)n可由键盘输入。 (2)在输入n后,动态建立方法说明中所需要建立的数组空间;程序运行结束时释放该存储空间。 (3)分别用n=4,5,6运行你的程序。-by n2-n squares formed n trip out of a square called "n chessboard." If the two Queen's n chessboard at the same line or in the same series or on the same diagonal, claimed they attack each other. Request output enable chessboard n-n the Queen's not attack each other all the layout. Specific requirements are as follows; (1) n input from the keyboard. (2) n input, dynamic methodology established by the needs of an array of space; Running at the end of the release of the storage space. (3), respectively, n = 4,5,6 run your procedures.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
压缩包 : 88157b~a~hh.rar 列表 “八皇后”动态图形的实现.doc