c++ 算法
cout<<endl<<"下面是一个"<<n<<"阶魔方阵:"<<endl; int i,j;
for(i = 0;i < n;i++) {
for(j = 0;j < n;j++) {
cout<= 0,j < n;i--,j++)//次对角线是否相等 {
NowSum += p[i][j]; }
if(NowSum != sum) {
YesOrNo = false; goto END; } END:
return YesOrNo; }
void combination(int **p,int n,int *a)//求m = n*n个数(1,2,3……m)的全排列 {
int m = n*n; static int Num = 0; int *b_val = new int[m]; int c = 0,k,i,j;
b_val[c] = -1;//一维数组首地址的值赋-1 c[0]-1 while(b_val[0] < m) //-1 {
if(++b_val[c] < m) //分别从0开始累加每个元素值，并限制不超出最大阶数