Codeforces Round #313 (Div. 2)560D. Equivalent Strings

最新推荐文章于 2022-12-12 12:13:54 发布

原创最新推荐文章于 2022-12-12 12:13:54 发布 · 921 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#codeforces #dfs

codeforces 同时被 2 个专栏收录

43 篇文章

订阅专栏

dfs

12 篇文章

订阅专栏

本文介绍了一种新的字符串等价性定义及判断方法，并通过一个具体的编程实现来演示如何确定两个字符串是否等价。该方法考虑了字符串可以被分为两半的情况，并允许这两半在一定条件下交换位置。

开发板推荐：天空星STM32F407VET6开发板

超高性价比 STM32主控 | 超高主频 | 一板兼容百芯 | 比赛神器 | 沉金彩色丝印

点击查看

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:

They are equal.
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".

#include <bits/stdc++.h>
using namespace std;
#define maxn 200010
char a[maxn], b[maxn];
bool dfs(char s1[], char s2[], int len){
    if(!strncmp(s1, s2, len)) return 1;
    if(len % 2 == 1) return 0;
    int m = len/2;
    if(dfs(s1+m, s2, m)&&dfs(s1, s2+m, m)) return 1;
    if(dfs(s1, s2, m)&&dfs(s1+m, s2+m, m)) return 1;
}
int main(){
    scanf("%s %s", a, b);
    int len = strlen(a);
    if(dfs(a, b, len)) printf("YES\n");
    else printf("NO\n");
}

开发板推荐：天空星STM32F407VET6开发板

超高性价比 STM32主控 | 超高主频 | 一板兼容百芯 | 比赛神器 | 沉金彩色丝印

点击查看