C语言“魔方阵”编写

结果图

代码如下

代码片.

#include<stdio.h>
#include<stdlib.h>
int main()
{
	int a[16][16];
	int i, j, k, p=1, n;
	while (p == 1)        //输入一个1--15之间的奇数
	{
		printf("plese enter n(1--15):");
		scanf_s("%d", &n);
		if ((n != 0) && (n <= 15) && (n % 2 == 0));
		p = 0;
	}
	for (i = 1; i <= n; i++)     //初始化
		for (j = 1; j <= n; j++)
			a[i][j] = 0;
	j = (n + 1) / 2;// 构建魔方阵
	a[1][j] = 1;
	for (k = 2; k <= n * n; k++)
	{
		i = i - 1;
		j = j + 1;
		if ((i < 1) && (j > n))
		{
			i = i + 2;
			j = j - 1;
		}
		else
		{
			if (i < 1) i = n;
			if (j > n)j = 1;
		}
		if (a[i][j] == 0)
			a[i][j] = k;
		else
		{
			i = i + 2;
			j = j - 1;
			a[i][j] = k;
		}
	}
		for(i=1;i<=n;i++)  //输出魔方阵
		{
			for (j = 1; j <= n; j++)
				printf("%5d", a[i][j]);
			printf("\n");
		}
		system("pause");
		return 0;
}