文件名称:2
介绍说明－－下载内容来自于网络，使用问题请自行百度
在n*n的棋盘上（1<=n<=10）填入1、2、3、….、n*n，共有n*n个数，使得任意相邻数的和为素数。
输入：n
输出：若有多个解，则需输出第一行、第一列之和均为最小的排列方案；若无解，则输出‘no’。-On board n* n (1 <= n <= 10) filled with 1,2,3, ...., N* n, a total number of n* n, so that any adjacent, and the number of prime numbers.
Input: n
Output: If there are multiple solutions, we need to output the first row, first column of the permutation scheme and are minimal if no solution, then output no .
输入：n
输出：若有多个解，则需输出第一行、第一列之和均为最小的排列方案；若无解，则输出‘no’。-On board n* n (1 <= n <= 10) filled with 1,2,3, ...., N* n, a total number of n* n, so that any adjacent, and the number of prime numbers.
Input: n
Output: If there are multiple solutions, we need to output the first row, first column of the permutation scheme and are minimal if no solution, then output no .
(系统自动生成,下载前可以参看下载内容)
下载文件列表
2.pas
本网站为编程资源及源代码搜集、介绍的搜索网站，版权归原作者所有！ 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.