习题3-9 子序列（All in All，UVa 10340)

原题链接：https://vjudge.net/problem/UVA-10340
分类：字符串
备注：水题
代码如下：

#include<stdio.h>
#include<string.h>
int main(void)
{
	char s[100000], t[100000];
	while (scanf("%s%s", s, t) == 2)
	{
		int len1 = strlen(s), len2 = strlen(t), j = 0, flag = 1;
		for (int i = 0; i < len1; i++)
		{
			for (; j < len2; j++)
				if (t[j] == s[i])break;
			if (j == len2) { flag = 0; break; }
			j++;
		}
		if (flag)printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}