魔方计划(C++)

use*_*053 6 c++ magic-square

对于那些不熟悉经典魔方算法的人:魔方是一个二维数组(nxn),它包含每个位置中值1和n ^ 2之间的数值.每个值只能出现一次.此外,每行,列和对角线的总和必须相同.输入应该是奇怪的,因为我正在写一个奇怪的方形解决方案.


我已经完成了这个问题,但截至目前它有一个未知的错误(逻辑?输出?),这一直困扰着我过去一小时.输出的值非常不合适.任何帮助将非常感谢:


#include<iostream>
#include<iomanip>
using namespace std;

int main()
{
  int n;

  cout<< "Please enter an odd integer: ";
  cin>>n;

  int MagicSquare[n][n];


  int newRow,
  newCol;

  // Set the indices for the middle of the bottom i
  int i =0 ;
  int j= n / 2;

  // Fill each element of the array using the magic array
  for ( int value = 1; value <= n*n; value++ )
  {
     MagicSquare[i][j] = value;
     // Find the next cell, wrapping around if necessary.
     newRow = (i + 1) % n;
     newCol = (j + 1) % n;
     // If the cell is empty, remember those indices for the
     // next assignment.
     if ( MagicSquare[newRow][newCol] == 0 )
     {
        i = newRow;
        j = newCol;
     }
     else
     {
        // The cell was full. Use the cell above the previous one.
        i = (i - 1 + n) % n;
     }

  }


  for(int x=0; x<n; x++)
  {
     for(int y=0; y<n; y++)
         cout << MagicSquare[x][y]<<" ";
     cout << endl;
  }
}
Run Code Online (Sandbox Code Playgroud)

And*_*ong 12

你忘了初始化你的MagicSquare所有零:

  for(int i = 0; i < n; i++) {
    for(int j = 0; j < n; j++) {
      MagicSquare[i][j] = 0;
    }
  }
Run Code Online (Sandbox Code Playgroud)

因此,此检查几乎总是会失败:

if ( MagicSquare[newRow][newCol] == 0 ) {
   i = newRow;
   j = newCol;
}
Run Code Online (Sandbox Code Playgroud)

因为C/++没有为你初始化为0.