hdu6282（思维）

 

#include<bits/stdc++.h>
using namespace std;
string a, b;
const int maxn = 1e4 +10;
int l[2][maxn];


int transform_s(int x, string s)
{
    int sum = 0, num = 0;
    for(int i = 0; i <= s.size(); i++)
    {
        if(s[i] == 'c' || i == s.size())
        {
            l[x][num++] = sum;
            sum = 0;
        }
        else
            sum ^= s[i];            //
    }
    return num;
}


int main()
{
    while(cin >> a >> b)
    {
        bool flag;
        memset(l, 0, sizeof(l));

        int numa = transform_s(0, a);
        int numb = transform_s(1, b);

        if(numa != numb)
        {
            flag = false;
        }
        else
        {
            int i;
            for( i = 0; i < numa; i++)
            {
                if(l[0][i] != l[1][i])
                {
                    flag = false;
                    break;
                }
            }
            if(i == numa)
                flag = true;
        }
        if(!flag)
            cout << "No" << endl;
        else
            cout << "Yes" << endl;
    }
    return 0;
}