Description: 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.
File list (Check if you may need any files):
Download