在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。 你的任务是，对于给定的N，求出有多少种合法的放置方法。 -In N* N checkerboard of placed N a queen, so they don t attack each other (that is, any two queen not allowed in the same row, the same listed, and n

输入2维数组，对其行列值和对角线求和并且将其按照大小顺序排列输出。杨辉三角、质因数个数等等。-Enter the 2-dimensional array, its value and the diagonal sum of the ranks and their order in accordance with the size of the output.