poj_1936 串

水题。给定串s1,s2,看s2减去若干字符是否可以构成s1。

code:

<span style="font-size:18px;">#include <iostream>#include <fstream>using namespace std;int main(){//ifstream in("input.txt");char s1[100000], s2[100000];long i, j;while (cin >> s1 >> s2){long lens1 = strlen(s1);long lens2 = strlen(s2);i = 0;j = 0;while (true){if (i == lens1){cout << "Yes" << endl;break;}else if (i < lens1 && j == lens2){cout << "No" << endl;break;}if (s1[i] == s2[j]){i++;j++;}elsej++;}memset(s1,'\0',sizeof(s1));memset(s2,'\0',sizeof(s2));}//system("pause");return 0;}</span>