Submission #297991

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>

using namespace std;

#define REP(i,n) for((i)=0;(i)<(int)(n);(i)++)
#define foreach(c,itr) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)

string s;

int solve() {
  int l = 0, r = (s.size() - 1);

  for(;l <= r;) {
    if (s[l] != s[r])  {
      // cout << s[l] << "," << s[r] << endl;
        //printf("[%c,%d] - [%c,%d]\n", s[l], l, s[r], r);
      return 0;
    }
    ++l;
    --r;
  }

  return 1;

}

int main() {
  while (cin >> s) {
    //cout << s << endl;
    printf("%s\n", solve() ? "YES": "NO");
  }

  return 0;
}

Submission Info

Judge Result