CF 559 B Equivalent Strings（字符串匹配）

B. Equivalent Strings

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are calledequivalent 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.

Sample test(s)

input

aaba
abaa

output

YES

input

aabb
abab

output

NO

给出两个等长的字符串 定义一种判断两个字符串相等的方法 判断两个字符串是否相等 

因为是每次都将字符串分为等长的两个字符串  所以字符串的长度必须是偶数时才能继续划分 奇数时就要一个个的字符进行判断

暴力递归

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string.h>
#include <string>
#include <vector>
#include <queue>

#define MEM(a,x) memset(a,x,sizeof a)
#define eps 1e-8
#define MOD 10009
#define MAXN 10010
#define MAXM 100010
#define INF 99999999
#define ll __int64
#define bug cout<<"here"<<endl
#define fread freopen("ceshi.txt","r",stdin)
#define fwrite freopen("out.txt","w",stdout)

using namespace std;

int Read()
{
    char c = getchar();
    while (c < '0' || c > '9') c = getchar();
    int x = 0;
    while (c >= '0' && c <= '9') {
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x;
}

void Print(int a)
{
     if(a>9)
         Print(a/10);
     putchar(a%10+'0');
}

string a,b;

int dfs(int s1,int t1,int s2,int t2)
{
    int len=t1-s1+1;
    if(len&1)
    {
        for(int i=0;i<len;i++)
        {
            if(a[i+s1]!=b[i+s2])
                return 0;
        }
        return 1;
    }
    len/=2;
    if(dfs(s1,s1+len-1,s2,s2+len-1)&&dfs(s1+len,t1,s2+len,t2))
        return 1;
    if(dfs(s1+len,t1,s2,s2+len-1)&&dfs(s1,s1+len-1,s2+len,t2))
        return 1;
    return 0;
}

int main()
{
    //fread;
    while(cin>>a>>b)
    {
        int len=a.length();
        if(dfs(0,len-1,0,len-1))
            puts("YES");
        else puts("NO");
    }
    return 0;
}