Submission #2388164

---

Source Code Expand

#include<iostream>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<cstdio>
#include<utility>
#include<algorithm>
using std::cout;
using std::cin;
using std::endl;

int main(void){
    std::string s;
    cin >> s;
    int answer = s.size() * (s.size() - 1) / 2 + 1;
    //cout << "first answer:" << answer << endl;

    for (int begin = 1; begin < s.size();begin++){
        int search_l = begin - 1;
        int search_r = begin + 1;
        while(search_l>=0&&search_r<s.size()){
            if(s[search_l]==s[search_r]){
                answer--;
            }
            search_l--;
            search_r++;
        }
    }
    for (int begin = 0; begin < s.size();begin++){
        int search_l = begin;
        int search_r = begin+1;
        while (search_l >= 0 && search_r < s.size())
        {
            if (s[search_l] == s[search_r])
            {
                answer--;
            }
            search_l--;
            search_r++;
        }
    }
    cout << answer << endl;

    return 0;
}

Submission Info

Judge Result