CodeForces - 988B Substrings Sort （字符串，一个字符串包含另外一个字符串）

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 a is a substring of string b if it is possible to choose several consecutiveletters 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 nn (1≤n≤100) — the number of strings.

The next nn 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 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”.

解题思路：C语言中strstr(str1,str2) 函数用于判断字符串str2是否是str1的子串。如果是，则该函数返回str2在str1中首次出现的地址；否则，返回NULL。了解了这个函数，这道题就非常简单。只要将字符串的长度按升序排列，然后从第二个字符串开始依次检查当前字符串是否含有前一个字符串，即如果strstr(str1,str2)都不为NULL，就满足所有条件输出”YES”，否则输出”NO”。

#include<bits/stdc++.h>
#define maxn 10010
#define sf scanf
#define pf printf
using namespace std;
int n;
typedef struct Node{
    char ss[110];
    int len;
}node; 
node A[110];
bool cmp(node a,node b){
    return a.len<b.len;
}
bool flag=true;
int main(){
    sf("%d",&n);
    for(int i=0;i<n;i++){
        cin>>A[i].ss;
        A[i].len=strlen(A[i].ss);
    }
    sort(A,A+n,cmp);

    //判断前一个是不是后一个的字串
    //strstr判断是否是包含的字串 
    for(int i=0;i<=n-2;i++){
        if(strstr(A[i+1].ss,A[i].ss)==NULL){
            flag=false;
            break;
        }
    }

    if(flag){
        cout<<"YES"<<endl;
        for(int i=0;i<n;i++){
            cout<<A[i].ss<<endl;
        }
    }
    else{
        cout<<"NO"<<endl;
    }
    return 0;
}