蛇形矩阵

蛇形矩阵

应该不是太难看懂，比较菜，大佬不要在意

#include <algorithm>
#include <iostream>
#include <cmath>
#include <vector>
#include <stack>
#include <cstring>
#include <cstdio>
#include <queue>
#include <map>
#define Buff std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
#define inf 0x3f3f3f3f
#define ll long long
int t, n, m;
int a[50][50];
int main()
{
    // Buff;
    memset(a, 0, sizeof(a));
    a[1][1] = 1;
    int cnt = 1;
    int j = 2;
    int i = 1;
    while (1)
    {
        if (i < 1 || j < 1 || i > 40 || j > 40)
            break;
        if (i == 1)
        {
            while (j > 1)
            {
                a[i][j] = ++cnt;
                i++;
                j--;  
            }
            a[i][j] = ++cnt;

        }
        i++;
        if (j == 1)
        {
            while (i > 1)
            {
                a[i][j] = ++cnt;
                j++;
                i--;
            }
            a[i][j] = ++cnt;
        }
        j++;
    }
    cout << a[2][2];
    return 0;
}