【打CF，学算法——二星级】CodeForces 282C XOR and OR （观察）

【CF简介】

提交链接：CF 282C

题面：

C. XOR and OR

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 stringa, 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 asx and the other one as y. Then he calculates two values p andq: p = x xor y,q = x or y. Then he replaces one of the two taken characters byp and the other one by q.

The xor operation means the bitwise excluding OR operation. Theor 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 andb. Your task is to check if it is possible for BitHaval to transform stringa to string b in several (possibly zero) described operations.

Input

The first line contains Bitlandish string a, the second line contains Bitlandish stringb. 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 exceed10⁶.

Output

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

Examples

Input

11
10

Output

YES

Input

1
01

Output

NO

Input

000
101

Output

NO

题意：

     给定两个01串，问A是否可以通过异或和或操作得到B串。

     异或：选取相邻两位进行异或，如10/01可得到11,11可得到10/01，00还是00。

     或    ：选取相邻两位进行或，如10/01可得到11，11还是11,00还是00。

 

解题：

    结合两种操作可以得到

                                      11->10/01

                                      01/10->11

                                      00->00

     综上，可以得出以下几点：

            1.全0状态只能停留在全0状态无法转换。

            2.有1状态不可能到全0状态。

            3.长度为1时，需特判。

代码：

#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
	int len1,len2;
	string a,b;
	cin>>a>>b;
    len1=a.length();
	len2=b.length();
	if(len1!=len2)
		cout<<"NO\n";
	else
	{
		int a0=0,a1=0,b0=0,b1=0;
		for(int i=0;i<len1;i++)
			if(a[i]=='0')
				a0++;
		a1=len1-a0;
		for(int i=0;i<len2;i++)
			if(b[i]=='0')
				b0++;
		b1=len2-b0;
		if(len1==1&&a1!=b1)
			cout<<"NO\n";
		else if(a0==len1&&a!=b)
			cout<<"NO\n";
		else if(b0==len2&&a!=b)
			cout<<"NO\n";
		else 
			cout<<"YES\n";
	}
	return 0;
}