Submission #49096391

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

Num grid[64][64];

void solve(std::istream& is, std::ostream& os) {
    Num n {0};
    is >> n;

    Num center = n / 2;
    Num lower = center - 1;
    Num upper = center + 1;
    Num serial = 1;
    Num x = lower;
    Num y = lower;

    for(;;) {
        while(y < upper) {
            ++y;
            grid[y][x] = serial;
            ++serial;
        }

        while(x < upper) {
            ++x;
            grid[y][x] = serial;
            ++serial;
        }

        while(y > lower) {
            --y;
            grid[y][x] = serial;
            ++serial;
        }

        while(x > lower) {
            --x;
            grid[y][x] = serial;
            ++serial;
        }

        if (x == 0) {
            break;
        }

        --x;
        grid[y][x] = serial;
        ++serial;
        --lower;
        ++upper;
    }

    for(Num y{0}; y<n; ++y) {
        for(Num x{0}; x<n; ++x) {
            if ((x == center) && (y == center)) {
                os << "T";
            } else {
                os << grid[y][x];
            }
            if ((x + 1) == n) {
                os << "\n";
            } else {
                os << " ";
            }
        }
    }
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result