#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n[11][11] = {0};
int N;
int num = 1;
int a = 1, b = 0, c;
cin >> N;
for (int i = 1; i <= 2*N - 1; i++)
{
if (i % 2 == 1)
{
if (i <= N)
b++;
else
a++;
n[a][b] = num;
num++;
c = N - 1 - abs(N - i);
for (int j = 1; j <= c; j++)
{
a++;
b--;
n[a][b] = num;
num++;
}
}
else
{
if (i <= N)
a++;
else
b++;
n[a][b] = num;
num++;
c = N - 1 - abs(N - i);
for (int j = 1; j <= c; j++)
【基础试题】蛇形矩阵 Time Limit:1000MS Memory Limit:65536K Total Submit:252 Accepted:118 Description 蛇形矩
最新推荐文章于 2023-04-22 09:47:23 发布