Equivalent Strings CodeForces - 559B 递归

Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases:

1. They are equal.
2. If we split string a into two halves of the same size a1 and a2, and string binto two halves of the same size b1 and b2, then one of the following is correct:
   1. a1 is equivalent to b1, and a2 is equivalent to b2
   2. a1 is equivalent to b2, and a2 is equivalent to b1

As a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.

Gerald has already completed this home task. Now it's your turn!

Input

The first two lines of the input contain two strings given by the teacher. Each of them has the length from 1 to 200 000 and consists of lowercase English letters. The strings have the same length.

Output

Print "YES" (without the quotes), if these two strings are equivalent, and "NO" (without the quotes) otherwise.

Examples

Input

aaba
abaa

Output

YES

Input

aabb
abab

Output

NO

Note

In the first sample you should split the first string into strings "aa" and "ba", the second one — into strings "ab" and "aa". "aa" is equivalent to "aa"; "ab" is equivalent to "ba" as "ab" = "a" + "b", "ba" = "b" + "a".

In the second sample the first string can be splitted into strings "aa" and "bb", that are equivalent only to themselves. That's why string "aabb" is equivalent only to itself and to string "bbaa".

 

给出两个字符串问他们是否相等，相等的条件满足其中之一就可以：1.两个字符串直接相等。2.每个字符串分成两部分，a1,a2,b1,b2，如果a1和b1相等，a2和b2相等那就说明相等，另外如果a1和b2相等，a2和b1相等那也可以说明相等。

运用递归的思想，每次分成两部分，当是奇数时就不能再分了这时候我们判断一下两个字符串是否相等。

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=200003;
char a[maxn],b[maxn];
bool cmp(int s1,int e1,int s2,int e2)
{
    for(int i=s1,j=s2;i<=e1;i++,j++)
    {
        if(a[i]!=b[j])
            return false;
    }
    return true;
}
bool solve(int s1,int e1,int s2,int e2)
{
    if((e1-s1+1)%2)//如果不能再分了就判断
    {
        return cmp(s1,e1,s2,e2);
    }
    int m1=(s1+e1)>>1;
    int m2=(s2+e2)>>1;
    return solve(s1,m1,s2,m2)&&solve(m1+1,e1,m2+1,e2)||solve(s1,m1,m2+1,e2)&&solve(m1+1,e1,s2,m2);//两种情况
}
int main()
{
   scanf("%s%s",a,b);
   int len1=strlen(a);
   int len2=strlen(b);
   int flag;
   if(len1!=len2)
    flag=0;
   else
    flag=solve(0,len1-1,0,len2-1);
    if(flag)
        cout<<"YES"<<endl;
    else
        cout<<"NO"<<endl;

}