SPJ by Hdh

该SPJ用于判断输入的两个字符串是否为回文串（即正读和反读相同）。

#include <iostream>
#include <string>
using namespace std;

int main() {
    string s;
    cin >> s;
    int n = s.size();
    bool is_palindrome = true;
    for (int i = 0; i < n / 2; ++i) {
        if (s[i] != s[n - 1 - i]) {
            is_palindrome = false;
            break;
        }
    }
    cout << (is_palindrome ? "YES" : "NO") << endl;
    return 0;
}

spj by Hdh