Codeforces Round #313 (Div. 2) Problem D - Equivalent Strings
来源:互联网 发布:手机淘宝快速秒杀器 编辑:程序博客网 时间:2024/05/06 23:46
93 ms 396 KB#include <iostream>#include <cstring>using namespace std;char A[200010];char B[200010];void fun(char C[], int N) { if(N % 2 == 0) { int nN = N/2; fun(C,nN); fun(C+nN,nN); if(strncmp(C,C+nN,nN) > 0) for(int i=0;i<nN;i++) swap(C[i],C[nN+i]); }}int main() { cin >> A >> B; int N = strlen(A); fun(A,N); fun(B,N); if(strncmp(A,B,N) == 0) cout << "YES" << endl; else cout << "NO" << endl; return 0;}
0 0
- Codeforces Round #313 (Div. 2) Problem D - Equivalent Strings
- Codeforces Round #313 (Div. 2) D. Equivalent Strings 字符串处理
- Codeforces Round #313 (Div. 2)D. Equivalent Strings(字符串)
- Codeforces Round #313 (Div. 2) 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
- 在RadioGroup中实现RadioButton的多行多列线性布局
- android ViewDragHelper完全解析 自定义ViewGroup神器
- Codeforces Round #313 (Div. 2) Problem B. Gerald is into Art
- 【线段树II:区间修改+点查询】hdu 1556 Color the ball
- Tautology(POJ--3295
- Codeforces Round #313 (Div. 2) Problem D - Equivalent Strings
- ASP.NET MVC - html.beginForm在javascript中获取form信息
- HorizontalDragLayout-模仿QQ客户端的Item滑动删除
- Hadoop中HDFS写入文件的原理剖析
- 算法竞赛入门经典(刘汝佳)1
- Android中Handler的简单应用(一)
- 对线程的深入学习(二)
- Codeforces Round #313 (Div. 2) Problem E - Gerald and Giant Chess
- 如何使能一个RF card