Submission #63255049

---

Source Code Expand

#include <random>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((x).size())
typedef long long ll;
using ull = unsigned long long;
using namespace std;
mt19937 rnd(348502);
ll mod = 998244353;
ll mod1 = 1e9 + 7;
const ll N = 55;

char a[N][N];

void solve()
{
    int n, i, j;
    cin >> n;
    for ( i = 0; i < n; i++)
    {
        char c = '#';
        if (i % 2)
            c = '.';
        if (a[i][i] == 0)
        {
            int ind = i;
            while (a[i][ind] == 0 && ind < n)
            {
                a[i][ind] = c;
                ind++;
            }
            ind = i + 1;
            while (a[ind][i] == 0 && ind < n)
            {
                a[ind][i] = c;
                ind++;
            }
            ind = i + 1;
            while (a[ind][n - i - 1] == 0 && ind < n)
            {
                a[ind][n - i - 1] = c;
                ind++;
            }
            ind = i + 1;
            while (a[n - i - 1][ind] == 0 && ind < n)
            {
                a[n - i - 1][ind] = c;
                ind++;
            }
        }
    }
    for ( i = 0; i < n; i++)
    {
        for ( j  = 0; j < n; j++)
        {
            cout << a[i][j];
        }
        cout << '\n';
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result