Submission #74644127

---

Source Code Expand

#pragma GCC optimize("O3")

#include <iostream>
#include <cmath>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <string>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <cstdint>

using namespace std;

using ll = int64_t;

void solve()
{
    int h, w;
    cin >> h >> w;
    cout << string(w, '#') << '\n';
    for (int i = 0; i < h - 2; ++i)
    {
        cout << '#' << string(w - 2, '.') << '#' << '\n';
    }
    cout << string(w, '#') << '\n';
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;

    while (t--)
    {
        solve();
    }

    return 0;
}

Submission Info

Judge Result