题目
解题思路:
我们的oj数据比较水,暴力模拟能过
于是,本来想拿部分分的我A了
用map库
就比较简单了
Accepted code:
#include<map>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
map <char, char> a_z, az;
char c[100001];
bool find(int sct) {
for (int i = 1; i <= sct; i++) {
if (c[i + sct] > 'z' || c[i + sct] <'a')
return true;
if (c[i] != a_z[c[i + sct]])
return false;
}
return true;
}
int main() {
int lenc = 0;
while ((a_z[(char)(lenc + 97)] = getchar()) != '\n')
lenc++, az[a_z[(char)(lenc + 96)]] = (char)(lenc+96);
lenc = 0;
while ((c[++lenc] = getchar()) != '\n');
int i = (lenc) >> 1;
for (; i <= lenc; i++) {
if (find(i)) {
for (int j = 1; j <= i; j++)
putchar(c[j]);
for (int j = 1; j <= i; j++)
putchar(az[c[j]]);
return 0;
}
}
}