Codeforces 282C XOR and OR

The Bitlandians are quite weird people. They do everything differently. They have a different alphabet so they have a different definition for a string.

A Bitlandish string is a string made only of characters "0" and "1".

BitHaval (the mayor of Bitland) loves to play with Bitlandish strings. He takes some Bitlandish string a, and applies several (possibly zero) operations to it. In one operation the mayor may take any two adjacent characters of a string, define one of them as x and the other one as y. Then he calculates two values p and q: p = x xor y, q = x or y. Then he replaces one of the two taken characters by p and the other one by q.

The xor operation means the bitwise excluding OR operation. The or operation is the bitwise OR operation.

So for example one operation can transform string 11 to string 10 or to string 01. String 1 cannot be transformed into any other string.

You've got two Bitlandish strings a and b. Your task is to check if it is possible for BitHaval to transform string a to string b in several (possibly zero) described operations.

Input

The first line contains Bitlandish string a, the second line contains Bitlandish string b. The strings can have different lengths.

It is guaranteed that the given strings only consist of characters "0" and "1". The strings are not empty, their length doesn't exceed 106.

Output

Print "YES" if a can be transformed into b, otherwise print "NO". Please do not print the quotes.

Sample test(s)

input

11
10

output

YES

input

1
01

output

NO

input

000
101

output

NO

解题思路：首先我们应该弄清楚转换规则，有题目描述可以知道相邻两个01串之间的转换关系, 0+0->0+0, 0+1->1+1,1+0->1+1,1+1->0+1，由转换规则我们不难知道不能转换只有这一种情况就是（1）两个字符串的长度不相等（2）两个字符串的长度相等，一个字符串是全0，另一个字符串中含有1，这种情况含1的字符串是无法消除1的，除了这两种情况外其余两种情况均是yes。因为只要含有1，则01,10,11这三种状态都是可以转换而来的，因此唯一不能构成的情况便是全是0的情况。

#include <ctime>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <utility>
#include <algorithm>
#include <functional>
using namespace std;
const int maxn = 1000010;
char s1[maxn], s2[maxn];
bool ok[maxn];

int main() {

    int n1, n2;
    scanf("%s", s1+1);
    scanf("%s", s2+1);
    n1 = strlen(s1+1);
    n2 = strlen(s2+1);
    if(n1 != n2) {
        printf("NO\n");
    } else {
        int c1 = 0, c2 = 0;
        for(int i = 0; i <= n1; ++i) {
            if(s1[i] == '1') c1++;
        }
        for(int i = 0; i <= n2; ++i) {
            if(s2[i] == '1') c2++;
        }
        if((c1 > 0 && c2 == 0) || (c2 > 0 && c1 == 0)) {
            printf("NO\n");
        } else {
            printf("YES\n");
        }
    }
    return 0;
}