//6.7 单数魔方阵
#include <stdio.h>
int main()
{
int n = 0, p = 1, i, j, k, a[15][15];
while (p == 1)
{
printf("enter n<n1---15>,(n%2!=0):");
scanf_s("%d", &n);
C程序设计(第四版) 谭浩强 练习题6.7 输出魔方阵(单数魔方阵)
![](https://img-home.csdnimg.cn/images/20240711042549.png)
//6.7 单数魔方阵
#include <stdio.h>
int main()
{
int n = 0, p = 1, i, j, k, a[15][15];
while (p == 1)
{
printf("enter n<n1---15>,(n%2!=0):");
scanf_s("%d", &n);