https://icpc.njust.edu.cn/Contest/749/rank/、
a偷吃糖果
思路：读入的时候相同的字母合并成一个字母。最后比较一下。
/* *********************************************** Author :guanjun Created Time :2016/4/17 12:37:02 File Name :njusta.cpp ************************************************ */ #include <iostream> #include <cstring> #include <cstdlib> #include <stdio.h> #include <algorithm> #include <vector> #include <queue> #include <set> #include <map> #include <string> #include <math.h> #include <stdlib.h> #include <iomanip> #include <list> #include <deque> #include <stack> #define ull unsigned long long #define ll long long #define mod 90001 #define INF 0x3f3f3f3f #define maxn 10010 #define cle(a) memset(a,0,sizeof(a)) const ull inf = 1LL << 61; const double eps=1e-5; using namespace std; priority_queue<int,vector<int>,greater<int> >pq; struct Node{ int x,y; }; int main() { #ifndef ONLINE_JUDGE freopen("in.txt","r",stdin); #endif //freopen("out.txt","w",stdout); int T; string s,t; cin>>T; while(T--){ cin>>s>>t; string ss=""; ss+=s[0]; string tt=""; tt+=t[0]; int tmp=0; for(int i=1;i<s.size();i++){ if(s[i]==ss[tmp])continue; tmp++; ss+=s[i]; } tmp=0; for(int i=1;i<t.size();i++){ if(t[i]==tt[tmp])continue; tmp++; tt+=t[i]; } //cout<<ss<<" "<<tt<<endl; if(ss==tt)puts("Yes"); else puts("No"); } return 0; }