题解 | #统计回文#

// dfs
#include <iostream>
#include <algorithm>
#include <string>

using namespace std;

bool isCircle(const string& s){
    int begin = 0,end = s.size() - 1;
    while(begin < end){
        if(s[begin] != s[end]) return false;
        begin ++;
        end --;
    }
    return true;
}

int main(){
    string a,b;
    getline(cin,a);
    getline(cin,b);
    int count = 0;
    for(int i = 0; i <= a.size(); i++){
        string temp = a;
        temp.insert(i,b);
        if(isCircle(temp)){
            count ++;
        }
    }
    cout<<count<<endl;
    return 0;
}