#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<set>
#include<stack>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int maxn = 100000 + 7, INF = 0x3f3f3f3f, mod = 1e9+7;
int p, n, x;
char s[maxn], t[maxn];
int main() {
while(scanf("%s %s", s, t) != EOF ) {
int n1 = strlen(s), n2 = strlen(t);
int j = 0;
for(int i = 0; i < n2; ++i) {
if(t[i] == s[j]) {
j++;
if(j >= n1) break;
}
}
if(j >= n1) puts("Yes");
else puts("No");
}
return 0;
}
UVA - 10340 All in All
最新推荐文章于 2019-07-03 07:20:18 发布