Codeforces Round #313 (Div. 2) D. Equivalent Strings 解题心得

原题:

Description

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 sizeb1 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 to200 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 Input

Input
aaba
abaa
Output
YES
Input
aabb
abab
Output
NO

Hint

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<cstdio>
#include<cstring>
int const Max = 250000;
char a[Max], b[Max];

bool isequal(char *a, char *b, int length)
{
    if (!strncmp(a, b, length))
        return true;
    if (length % 2)
        return false; 
    int mid = length / 2;
    if (isequal(a, b + mid, mid) && isequal(a + mid, b, mid))
        return true;
    if (isequal(a, b, mid) && isequal(a + mid, b + mid, mid))
        return true;
    return false;

}

int main()
{
    scanf("%s%s", a, b);
    printf("%s\n", isequal(a, b, strlen(a)) ? "YES" : "NO");

}
View Code

 

转载于:https://www.cnblogs.com/shawn-ji/p/4696560.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值