完全十足的水题,只需要判断字符串s在字符串t中是否能完全找到
注意:输入那块
# include <stdio.h>
# include <string.h>
int main()
{
char s[1000000], t[1000000];
while (scanf("%s%s", s, t) != EOF)
{
int p = 0;
int i=0;
for (; i<strlen(t); i++)
{
if (s[p] == t[i])
p++;
}
if (p == strlen(s))
printf("Yes\n");
else
printf("No\n");
memset(s, '0', 1000000*sizeof(char));
memset(t, '0', 1000000*sizeof(char));
}
return 0;
}