Codeforces Round #401 (Div. 2) D. Cloud of Hashtags

#include<bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define eps  1e-2
#define gcd __gcd
#define pb push_back
#define PI acos(-1.0)
#define lowbit(x) (x)&(-x)
#define bug printf("!!!!!\n");
#define mem(x,y) memset(x,y,sizeof(x))

typedef long long LL;
typedef long double LD;
typedef pair<int,int> pii;
typedef unsigned long long uLL;

const int N = 5e5+2;
const int INF  = 1<<30;
const int mod  = 1e9+7;

int n;
string s[N];

void solve(){
    cin>>n;
    for(int i=1;i<=n;i++) cin>>s[i];
    for(int i=n;i>=2;i--){
        if(s[i]>=s[i-1]) continue;
        string tp="";
        for(int j=0;j<min(s[i].size(),s[i-1].size());j++){
            if(s[i][j]!=s[i-1][j]) break;
            tp+=s[i][j];
        }
        s[i-1]=tp;
    }
    for(int i=1;i<=n;i++) cout<<s[i]<<endl;
    return;
}

int main()
{
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
//    ios::sync_with_stdio(false);
    int t = 1;
    //scanf("%d",&t);
    while(t--){
    //    printf("Case %d: ",cas++);
        solve();
    }
    return 0;
}