forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB.cpp
More file actions
54 lines (46 loc) · 1.37 KB
/
B.cpp
File metadata and controls
54 lines (46 loc) · 1.37 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
#define SZ(X) ((int) ((X).size()))
using namespace std;
const int MN = 100111;
int n;
string a[MN];
string has, need;
int main() {
ios :: sync_with_stdio(false);
while (cin >> n) {
FOR(i,1,n) cin >> a[i];
cin >> has;
need = "";
FOR(i,1,n) {
need += "<3";
need += a[i];
}
need += "<3";
int j = 0;
bool bad = false;
REP(i,SZ(need)) {
char c = need[i];
while (j < SZ(has) && has[j] != c) {
++j;
}
if (j == SZ(has) || has[j] != c) {
bad = true;
cout << "no" << endl;
break;
}
++j;
}
if (!bad) {
cout << "yes" << endl;
}
}
}