Submission #73300408

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define vll vector < ll >
#define vvl vector < vl > ;
#define dequeue dq;
#define all(x)(x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define pf push_front
#define st stack < ll >
#define stc stack < char >
#define sts stack < string >
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repe(i, a, b) for (ll i = a; i <= b; i++)
int main() {
    ll n;cin>>n;vector <string> v(n);ll m=0;
    rep(i,0,n){
        cin>>v[i];
    }
    rep(i,0,n){
        m=max(m,(ll) (v[i].size()));
    }
rep(i,0,n){
    string t="";
    ll k=(m-(ll)(v[i].size()))/2;
    rep(j,0,k){
    t+='.';}
    t+=v[i];
    rep(j,0,k){
    t+='.';}
    cout<<t<<endl;
}
    

}

Submission Info

Judge Result