Equivalent Strings(Codeforces Round #313 (Div. 2) D)
来源:互联网 发布:sql中select语句实例 编辑:程序博客网 时间:2024/05/19 14:51
此题链接单击这里
=================
#include <iostream>#include <string>#include <vector>using namespace std;string a,b;bool funt(int fa,int la,int fb,int lb){ int i,j; for(i=fa,j=fb;i<la;i++,j++) if(a[i]!=b[j]) break; if(i==la) return true; if((la-fa)%2) return false; int k=(la-fa)/2; if (funt(fa,fa+k,fb+k,lb)&&funt(fa+k,la,fb,fb+k)) return true; if(funt(fa,fa+k,fb,fb+k)&&funt(fa+k,la,fb+k,lb)) return true; return false;}int main(){ cin>>a; cin>>b; if(funt(0,a.size(),0,b.size())) cout<<"YES"<<endl; else cout<<"NO"<<endl; return 0;}
有问题联系企鹅791267032
邮箱地址….wutanrong@Hotmail.com
0 0
- Codeforces Round #313 (Div. 2) D. Equivalent Strings 字符串处理
- Codeforces Round #313 (Div. 2)D. Equivalent Strings(字符串)
- Codeforces Round #313 (Div. 2) D Equivalent Strings
- Codeforces Round #313 (Div. 2) Problem D - Equivalent Strings
- Equivalent Strings(Codeforces Round #313 (Div. 2) D)
- Codeforces Round #313 (Div. 2) 560D Equivalent Strings(dos)
- Codeforces Round #313 (Div. 2)560D. Equivalent Strings
- Codeforces Round #313 (Div. 2) D Equivalent Strings(dfs)
- Codeforces Round #313 (Div. 2) D. Equivalent Strings(简单搜索)
- Round #313 (Div. 2) D. Equivalent Strings-大水题递归
- Codeforces Round #313 (Div. 2) Equivalent Strings(搜索)
- Codeforces Round #313 (Div. 1) B. Equivalent Strings DFS暴力
- Codeforces Round #313 (Div. 1) B. Equivalent Strings
- codeforces Round 313 (Div. 1) B.Equivalent Strings
- Codeforces Round #313 D. Equivalent Strings(DFS)
- CodeForces#313 D. Equivalent Strings
- Codeforces Round #313 Equivalent Strings(递归)
- 规律+DFS Codeforces Round div2 D. Equivalent Strings
- 关于iOS多线程
- POJ - 2348 Euclid's Game
- dbms_sql包的用法
- 为何stop()和suspend()方法不推荐使用
- hdoj 1789 Doing Homework again
- Equivalent Strings(Codeforces Round #313 (Div. 2) D)
- 《汇编语言》第二版 王爽著 第五章 [BX]和loop指令 要点
- HDU - 1875畅通工程再续-最小生成树
- java中注解的使用与实例(一)
- Unity5新的AssetBundle系统使用心得
- Makefile 中:= ?= += =的区别
- 图片加水印
- Django(一)——the first try
- C++模板类与运算符作为友元函数重载