Submission #74647762

---

Source Code Expand

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace atcoder;
using namespace std;
using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
#define nl '\n'
#define rep(i, n) for(ll i = 0; i < (ll)(n); ++i)
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const ull BigPrime = (1LL << 61) - 1;
const ll INF = (1LL << 61);
//--------------------------------------------------------------------------------
//--------------------------------------------------------------------------------

void solve()
{
    int h, w; cin >> h >> w;
    rep(i, h)
    {
        rep(j, w)
        {
            if(i == 0 || i == h-1 || j == 0 || j == w-1) cout << "#";
            else cout << ".";
        }
        cout << nl;
    }
}

//--------------------------------------------------------------------------------

int main()
{
    //cout << fixed << setprecision(10); //Be careful!
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

Submission Info

Judge Result