#include <iostream>
#include <algorithm>
#include <string> using namespace std; int main(){
int n;
cin >> n;
string words = "<3",tmp;
for(int i = ; i < n ; ++ i){
cin >> tmp;
words +=tmp+"<3";
}
string message;
cin >> message;
if(message.length() < words.length()) cout<<"no"<<endl;
else{
int k = ;
for(int i = ; i < words.length();){
while(k< message.length() && message[k]!=words[i]) k++;
if(k >= message.length()){cout<<"no"<<endl; return ;}
else ++i;
}
cout<<"yes"<<endl;
}
}
相关文章
- Codeforces Round #452 (Div. 2) A B C
- 【Codeforces Round #452 (Div. 2) B】Months and Years
- Educational Codeforces Round 78 (Rated for Div. 2) B. A and B
- Educational Codeforces Round 78 (Rated for Div. 2)B. A and B(1~n的分配)
- Codeforces Round #396 (Div. 2) A,B,C,D,E
- Codeforces Round #299 (Div. 2)A B C 水 dfs 二分
- Codeforces Round #299 (Div. 2) B. Tavas and SaDDas 水题
- DFS Codeforces Round #299 (Div. 2) B. Tavas and SaDDas
- Codeforces Round #302 (Div. 2) B. Sea and Islands 构造
- Codeforces Round #321 (Div. 2) B. Kefa and Company 二分