codeforce 486 div3 B 字符串中查询字串并进行排序

101 阅读 0 评论 67 点赞

我是靠谱客的博主知性雨，最近开发中收集的这篇文章主要介绍codeforce 486 div3 B 字符串中查询字串并进行排序，觉得挺不错的，现在分享给大家，希望可以做个参考。

概述

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 \leq n \leq 100

) — the number of strings.

The next $n$

lines contain the given strings. The number of letters in each string is from

1

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

#include<bits/stdc++.h>
using namespace std;
int n;
string a[101];
bool cmp(string a,string b)
{
    return a.length()<b.length();
}
int main()
{
    int i;
    for(cin>>n,i=0; i<n; cin>>a[i],++i);
    sort(a,a+n,cmp);
    for(int i=0; i<n-1; ++i)
    {
        if(a[i+1].find(a[i])==string::npos)
        {
            return cout<<"NO",0;

        }
    }
    cout<<"YES"<<endl;
    for(int i=0; i<n; ++i)
    {
        cout<<a[i]<<endl;
    }
    return 0;
}