CodeForces - 988B 字符串

字符串的处理

Problem Description

You are given nn 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 aa is a substring of string bb if it is possible to choose several consecutive letters in bb in such a way that they form aa. 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 nn (1≤n≤1001≤n≤100) — the number of strings.

The next nn lines contain the given strings. The number of letters in each string is from 11 to 100100, inclusive. Each string consists of lowercase English letters.

Some strings might be equal.

Output

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

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

Examples

Input

5
a
aba
abacaba
ba
aba

Output

YES
a
ba
aba
aba
abacaba

Input

5
a
abacaba
ba
aba
abab

Output

NO

Input

3
qwerty
qwerty
qwerty

Output

YES
qwerty
qwerty
qwerty

Note

In the second example you cannot reorder the strings because the string "abab" is not a substring of the string "abacaba".

题目大意：给定n个字符串，按照字符串长度排序，然后判断前一个是否为下一个的字串，

全部符合时，输出“YES”，并且输出排序结束的字符串

存在不符合的，输出“NO”，

注意：//新知识点

字符串的查找    

string::size_type idx=v[i+1].s.find(v[i].s);

如果返回的 idx==string::npos  表示没有字串

另一种简单的：v[i+1].s.find(v[i].s)>n; 同样表示没有字串

This is the code

#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include <iomanip>
#include<list>
#include<map>
#include<queue>
#include<sstream>
#include<stack>
#include<string>
#include<set>
#include<vector>
using namespace std;
#define PI acos(-1.0)
#define EPS 1e-8
#define MOD 1e9+7
#define LL long long
#define ULL unsigned long long     //1844674407370955161
#define INT_INF 0x7f7f7f7f      //2139062143
#define LL_INF 0x7f7f7f7f7f7f7f7f //9187201950435737471
const int dr[]={0, 0, -1, 1, -1, -1, 1, 1};
const int dc[]={-1, 1, 0, 0, -1, 1, -1, 1};
// ios.sync_with_stdio(false);
// 那么cin, 就不能跟C的 scanf，sscanf, getchar, fgets之类的一起使用了。
struct node
{
    string s;
    int size;
};
bool cmp(node a,node b)
{
    return a.size==b.size? a.s<b.s:a.size<b.size;
}
int main()
{
    int n;
    vector<node > v;
    vector<node > ::iterator it;
    while(cin>>n)
    {
        v.clear();
        for(int i=0;i<n;++i)
        {
            node a;
            cin>>a.s;
            a.size=a.s.size();
            v.push_back(a);
        }
        sort(v.begin(),v.end(),cmp);
        bool falg=true;
        for(int i=0;i<v.size()-1;++i)
        {
            string::size_type idx=v[i+1].s.find(v[i].s);
            if (idx==string::npos)//表示不存在
            {
                falg=false;
                break;
            }
        }
        if(falg)
        {
            cout<<"YES"<<endl;
            for(int i=0;i<v.size();++i)
            {
                cout<<v[i].s<<endl;
            }
        }
        else
            cout<<"NO"<<endl;
    }
    return 0;
}