UVA10340 - All in All

Posted 2020-09-28 Roni

 1 #include <stdio.h>
 2 #include <algorithm>
 3 #include <cstring>
 4 using namespace std;
 5 char s[100005],t[100005];
 6 int cmp(char *s1,char *s2)
 7 {
 8      int i,j,l1,l2;
 9      l1=strlen(s1),l2=strlen(s2);
10      for(i=0,j=0;i<l1,j<l2; ) //s1是子串（赋值语句有条件，故在for内省略
11      {
12          if(s1[i]==s2[j]) i++,j++;
13          else j++;
14      }
15      return l1==i; //若在主串中找到的相同字符长度和子串相同，匹配成功
16 }
17 
18     int main()
19     {
20         while(~scanf("%s%s",s,t))
21         {
22             printf(cmp(s,t)?"Yes\\n":"No\\n");
23         }
24 
25     return 0;
26     }