#include<iostream>
#include<vector>
#include<iomanip>
using namespace std;
vector<int> OddRankRubikMatrix(const int n)//生成奇数阶的矩阵vector
{
vector<int> Matrix(n*n,0);
if (!(n >= 1&&n<=30))return Matrix;
int count = 1;
int Curi=0, Curj=n/2;
Matrix[Curi*n+Curj] = count;
count++;
while (count <= n*n)
{
if (Curi == 0 && Curj == n - 1)//如果当前数字在右上角,下一个数字填在它的下方
{
Curi++;
Matrix[Curi*n + Curj] = count;
count++;
}
else if (Matrix[((Curi - 1 + n) % n)*n + (Curj + 1)%n])//如果当前数字的上一行下一列已经填过,就填在它下面,要不然就填那儿
{
Curi = (Curi + 1) % n;
Matrix[Curi*n + Curj] = count;
count++;
}
else//第一行的上一行是最后一行,最后一列的下一列是第一列
{
Curi = (Curi - 1 + n) % n;
Curj = (Curj + 1) % n;
Matrix[Curi*n + Curj] = count;
count++;
}
}
return Matrix;
}
void O
C++生成1-30阶魔方阵/纵横图/幻方-奇/偶阶
最新推荐文章于 2023-04-01 08:24:45 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)