#include<iostream>
#include<conio.h>
using namespace std;
int juz(int n,int x[100][100])
{
int a, b;
if (n % 2 != 0) {
a = (n - 1) / 2;
b = a;
x[a][b] = 1;
int w = 2;
while (1) {
for (int i = 1; i < w; i++)x[a][++b] = x[a][b - 1] + 1;
for (int i = 1; i < w; i++)x[--a][b] = x[a + 1][b] + 1;
w++;
for (int i = 1; i < w; i++)x[a][--b] = x[a][b + 1] + 1;
for (int i = 1; i < w; i++)x[++a][b] = x[a - 1][b] + 1;
w++;
if (x[a][b] > (n*n))break;
}
int sum = 0;
for (int i = 0; i < n; i++)sum += x[i]
蛇形矩阵C++/C实现
最新推荐文章于 2023-11-11 11:01:37 发布