poj 1936-串处理用for的模板

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <sstream>
#include <fstream>
#define debug puts("-----")
#define pi (acos(-1.0))
#define eps (1e-8)
#define inf 1<<28
using namespace std;

int main() {
	string s1, s2;
	while (cin >> s1 >> s2) {
		int pos1 = 0;
		int pos2 = 0;
		while (pos1 < s1.length()) {
			if (pos2 >= s2.length()) {
				break;
			}
			for (; pos1 < s1.length() && pos2 < s2.length() && s1[pos1] == s2[pos2]; pos1++, pos2++);
			pos2++;
		}
		if (pos1 == s1.length()) {
			cout << "Yes" << endl;
		} else {
			cout << "No" << endl;
		}
	}
	//system("pause");
	return 0;
}