#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 #272 (Div. 2)-B. Dreamoon and WiFi
- Codeforces Round #272 (Div. 2) B. Dreamoon and WiFi dp
- Codeforces Round #198 (Div. 2)A,B题解
- Codeforces Round #505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) B. Weakened Common Divis
- 字符串处理 Codeforces Round #296 (Div. 2) B. Error Correct System
- Codeforces Round #374 (Div. 2) A , B , C 水,水,拓扑dp
- Codeforces Round #527 (Div. 3) 总结 A B C D1 D2 F
- Codeforces Round #303 (Div. 2) B. Equidistant String 水题
- Codeforces Round #285 (Div. 2) A, B , C 水, map ,拓扑
- Codeforces Round #373 (Div. 2) B. Anatoly and Cockroaches 水题