Codeforces 560D Equivalent Strings（暴力递归）

题面

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 b into 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".

题目链接

Codeforces_560D

题目简述

暴力搜索一遍，等效条件有三种情况

1、完全相等

2、a1 is equivalent to b1, and a2 is equivalent to b2

3、a1 is equivalent to b2, and a2 is equivalent to b1

当先判断情况2，再判断情况3时，会获得“Time limit exceeded on test 91”（坑）

当先判断情况3，再判断情况2时，会获得“Accepted”

AC程序

#include<stdio.h>
#include<string.h>
#define maxn 200005
char up[maxn],down[maxn];

bool judge(int up_w,int down_w,int length)
{
    if(length%2==1)
    {
        if(strncmp(up+up_w,down+down_w,length)==0)
            return true;
        else
            return false;
    }
    else/**length%2==0**/
    {
        if(judge(up_w,down_w+length/2,length/2)&&judge(up_w+length/2,down_w,length/2))
            return true;
        if(judge(up_w,down_w,length/2)&&judge(up_w+length/2,down_w+length/2,length/2))
            return true;
        else
            return false;
    }
}

int main()
{
    scanf("%s",up);
    scanf("%s",down);
    int length=strlen(up);
    bool answer=judge(0,0,length);
    if(answer)
        printf("YES\n");
    else
        printf("NO\n");
    return 0;
}

 Time limit exceeded on test 91程序

#include<stdio.h>
#include<string.h>
#define maxn 200005
char up[maxn],down[maxn];

bool judge(int up_w,int down_w,int length)
{
    if(length%2==1)
    {
        if(strncmp(up+up_w,down+down_w,length)==0)
            return true;
        else
            return false;
    }
    else/**length%2==0**/
    {
        if(judge(up_w,down_w,length/2)&&judge(up_w+length/2,down_w+length/2,length/2))
            return true;
        else if(judge(up_w,down_w+length/2,length/2)&&judge(up_w+length/2,down_w,length/2))
            return true;
        else
            return false;
    }
}

int main()
{
    scanf("%s",up);
    scanf("%s",down);
    int length=strlen(up);
    bool answer=judge(0,0,length);
    if(answer)
        printf("YES\n");
    else
        printf("NO\n");
    return 0;
}