Codeforces Round #486 (Div. 3) B. Substrings Sort

B. Substrings Sort

You are given $n$ strings. Each string consists of lowercase English letters. Rearrange (reorder) the given strings in such a way that for every string, all strings that are placed before it are its substrings.

String $a$ is a substring of string $b$ if it is possible to choose several consecutive letters in $b$ in such a way that they form $a$. For example, string "for" is contained as a substring in strings "codeforces", "for" and "therefore", but is not contained as a substring in strings "four", "fofo" and "rof".

Input

The first line contains an integer $n$ ($1\le n\le 100$) — the number of strings.

The next $n$ lines contain the given strings. The number of letters in each string is from $1$ to $100$, inclusive. Each string consists of lowercase English letters.

Some strings might be equal.

Output

If it is impossible to reorder $n$ given strings in required order, print "NO" (without quotes).

Otherwise print "YES" (without quotes) and $n$ given strings in required order.

Examples

input

Copy

5
a
aba
abacaba
ba
aba

output

Copy

YES
a
ba
aba
aba
abacaba

input

Copy

5
a
abacaba
ba
aba
abab

output

Copy

NO

input

Copy

3
qwerty
qwerty
qwerty

output

Copy

YES
qwerty
qwerty
qwerty

题意：给你n个字符串，假设n行串存在一种排序，使得任意相邻的两行串s1,s2，s1都是s2的子串，不存在就输出NO。

思路：子串s1长度一定小于等于s2，所以先按长度从小到大排序，等长的字符串，按照字典序正常排序即可（strcmp）。

数据只有100，排序之后，任意相邻两行暴力进行字符串匹配即可，如果都匹配完成，即判定YES，输出现在的顺序。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<string>
#include<map>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#define ll long long
#define exp 1e-8
#define mst(a,k) memset(a,k,sizeof(a))
#define pi acos(-1.0)
using namespace std;
char s[110][110];
ll n,flag;
ll judge(ll p1,ll p2)   //字符串暴力匹配
{
    ll len1=strlen(s[p1]);
    ll len2=strlen(s[p2]);
    for(ll i=0;i<len2;i++)
    {
        ll ok=0,cnt=0;
        for(ll j=i;j<i+len1;j++)
        {
            if(s[p1][cnt++]!=s[p2][j])
            {
                ok=1;
                break;
            }
        }
        if(ok==0&&cnt==len1)return 0;
    }
    return 1;
}
int main()
{
    while(~scanf("%lld",&n))
    {
        for(ll i=1;i<=n;i++)scanf("%s",s[i]);
        for(ll i=1;i<=n;i++)   //冒泡排序
        {
            for(ll j=2;j<=n;j++)
            {
                if(strlen(s[j-1])>strlen(s[j]))   //长度不等，短的一定在前
                {
                    swap(s[j-1],s[j]);
                }
                else if(strlen(s[j-1])==strlen(s[j]))   //长度相等，按字典序排
                {
                    if(strcmp(s[j-1],s[j])>0)
                    {
                        swap(s[j-1],s[j]);
                    }
                }
            }
        }
        flag=0;
        for(ll i=2;i<=n;i++)
        {
            if(judge(i-1,i))   //任意相邻两行判定
            {
                flag=1;
                break;
            }
        }
        if(flag==1)printf("NO\n");
        else
        {
            printf("YES\n");
            for(ll i=1;i<=n;i++)
            {
                printf("%s\n",s[i]);
            }
        }
    }
    return 0;
}