//非递归版,n受限于堆的大小
#include<iostream>
using namespace std;
int limit(int x, int n);
void fun(int** square, int n);
void print(int** square, int n);
int main(void)
{
int n;
cin >> n;//n>=3&&n是奇数
int** square = new int* [n + 1];
for (int i = 0; i <= n; ++i)
square[i] = new int[n + 1];
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
square[i][j] = 0;
fun(square, n);
print(square, n);
for (int i = 0; i <= n; ++i)
delete[]square[i];
delete[]square;
return 0;
}
int limit(int x, int n)
{
if (x >= 1 && x <= n)
return x;
else if (x < 1)
return n;
else
return 1;
}
void print(int** square, int n)
{
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
C语言最经典的题目---幻方问题的求解
于 2022-03-04 18:39:00 首次发布
本文详细介绍了C语言解决幻方问题的方法,从基础概念到实现步骤,通过实例解析幻方的生成与验证过程,帮助读者深入理解C语言编程技巧。
摘要由CSDN通过智能技术生成