/*problem:poj1636
如果s中的每个字母在t中都有则输出Yes(注意是Yes,不是YES)
代码很简单,就不解释了*/
#include <stdio.h>
char s[100010], t[100010];
int main()
{
while(~scanf("%s%s", s, t))
{
int i = 0, j;
for(j = 0; t[j] != 0; ++j)
if(s[i] == t[j])
++i;
printf("%s\n", s[i] == 0 ? "Yes" : "No");
}
return 0;
}
标签:北大,100010,No,int,ACM,++,poj1636,Yes From: https://blog.51cto.com/u_10101161/7177255