Submission #143555

---

Source Code Expand

#include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
 
#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
 
using namespace std;
 
typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;
 
const double EPS=1e-9;
 
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

int main(){
	string s;
	cin >> s;
	if(s.size() == 1){
		cout << 0 << endl;
		return 0;
	}

	int idx = s.size()-1;
	int cnt = 0;
	rep(i,s.size()/2){
		if(s[i] != s[idx]){
			cnt++;
		}
		idx--;
	}

	if(cnt==0){
		cout << 25*s.size() << endl;
	}else if(cnt==1){
		cout << 24*2+25*(s.size()-2) << endl;
	}else{
		cout << 25*s.size() << endl;
	}
}

Submission Info

Judge Result