ZOJ Problem Set - 1970 All in All

来源:互联网 发布:淘宝ebay代购靠谱吗 编辑:程序博客网 时间:2024/06/15 13:32

水!

#include <iostream>using namespace std;int main(){    string str1,str2;    int len1,len2,i,cnt,j;    while(cin>>str1>>str2)    {          len1 = str1.size();          len2 = str2.size();          j = 0;          i = 0;          cnt = 0;          if(len1 > len2) {cout<<"No"<<endl;continue;}          while(i <= len1&&j <= len2)          {                if(str1[i] == str2[j])                {cnt ++;i ++;j ++;}                else                j ++;          }          //cout<<cnt<<endl;          if(cnt == len1+1)  cout<<"Yes"<<endl;          else cout<<"No"<<endl;    }    return 0;}


原创粉丝点击