CodeForces 282C XOR and OR

B - XOR and OR

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 282C

Description

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 10⁶.

Output

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

Sample Input

Input

11
10

Output

YES

Input

1
01

Output

NO

Input

000
101

Output

NO

题意：给你两个串，然后给你一个转换规则：1+1→0+1→1+0→1+1.问你A串能不能通过这种转换最后转换成B串。

思路：写了写，仔细想想可以发现，一个串里只要有1就可以随意转换的。

注意：

1.B串可能也是全为0的，有1只能转换成存在至少含有1个1的串的。

2.长度开始可能不一样的，不一样直接NO就可以了。

最后总结，只要长度一样，两个串都存在1就可以转换~

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int MAXN=1000000+5;
char a[MAXN],b[MAXN];
int main()
{
    int i;
    scanf("%s%s",a,b);
    int l1=strlen(a),l2=strlen(b);
   if(!strcmp(a,b))puts("YES");
   else
   {
       if(l1!=l2)puts("NO");
       else
       {
           int flag1=0,flag2=0;
           for(i=0;i<l1;++i)
           {
               if(a[i]=='1')
               {
                   flag1=1;
                   break;
               }
           }
           for(i=0;i<l1;++i)
           {
               if(b[i]=='1')
               {
                   flag2=1;
                   break;
               }
           }
           if(flag1&&flag2)puts("YES");
           else puts("NO");
       }
   }
    return 0;
}