B. Substrings Sort
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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
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
Note
In the second example you cannot reorder the strings because the string "abab" is not a substring of the string "abacaba".
题目大意：一步一步找子序列，用string里的find函数，我才刚刚知道还有这种好东西，真香。。。。。。。
代码：
#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<algorithm>
using namespace std;
int cmp(string a,string b)
{
return a.size()<b.size();
}
int main()
{
string a[110];
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n-1;i++)
{
if(a[i+1].find(a[i])==a[i+1].npos)
{
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
for(int i=1;i<=n;i++)
cout<<a[i]<<endl;
return 0;
}