#include <stdio.h>
 
int isPalindrome(char s[]) {
    int left = 0;
    int right = 0;
 
    // 文字列の長さを計算
    while (s[right] != '\0') {
        right++;
    }
    right--;  // 最後の文字のインデックス
 
    // 左右から中央に向かって比較
    while (left < right) {
        if (s[left] != s[right]) {
            return 0;  // 一致しない場合は回文ではない
        }
        left++;
        right--;
    }
 
    return 1;  // 全部一致したら回文
}
 
// メイン関数：書き換えなくてよい
int main() {
    char s[100];
    scanf("%s", s);
    printf("%s -> %d\n", s, isPalindrome(s));
    return 0;
}
 

I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgaXNQYWxpbmRyb21lKGNoYXIgc1tdKSB7CiAgICBpbnQgbGVmdCA9IDA7CiAgICBpbnQgcmlnaHQgPSAwOwoKICAgIC8vIOaWh+Wtl+WIl+OBrumVt+OBleOCkuioiOeulwogICAgd2hpbGUgKHNbcmlnaHRdICE9ICdcMCcpIHsKICAgICAgICByaWdodCsrOwogICAgfQogICAgcmlnaHQtLTsgIC8vIOacgOW+jOOBruaWh+Wtl+OBruOCpOODs+ODh+ODg+OCr+OCuQoKICAgIC8vIOW3puWPs+OBi+OCieS4reWkruOBq+WQkeOBi+OBo+OBpuavlOi8gwogICAgd2hpbGUgKGxlZnQgPCByaWdodCkgewogICAgICAgIGlmIChzW2xlZnRdICE9IHNbcmlnaHRdKSB7CiAgICAgICAgICAgIHJldHVybiAwOyAgLy8g5LiA6Ie044GX44Gq44GE5aC05ZCI44Gv5Zue5paH44Gn44Gv44Gq44GECiAgICAgICAgfQogICAgICAgIGxlZnQrKzsKICAgICAgICByaWdodC0tOwogICAgfQoKICAgIHJldHVybiAxOyAgLy8g5YWo6YOo5LiA6Ie044GX44Gf44KJ5Zue5paHCn0KCi8vIOODoeOCpOODs+mWouaVsO+8muabuOOBjeaPm+OBiOOBquOBj+OBpuOCiOOBhAppbnQgbWFpbigpIHsKICAgIGNoYXIgc1sxMDBdOwogICAgc2NhbmYoIiVzIiwgcyk7CiAgICBwcmludGYoIiVzIC0+ICVkXG4iLCBzLCBpc1BhbGluZHJvbWUocykpOwogICAgcmV0dXJuIDA7Cn0K

c2hpbmJ1bnNoaQ==

shinbunshi