palindromes Batch , stdin/stdout

Registered Users Only

Please login to utilize this feature.

Do note that this website only supports submissions in C++.

palindromes.html

Palindromes are awesome. Today we are going to code a palindrome checker.

Palindromes

A palindrome is a word that will be the same when read from backwards. For example: did is a palindrome but cat is not. For more information, refer to Wikipedia.

Input

The input will be a single word, without spaces, to check whether its palindrome.
The word provided in the test cases will be less than or equal to 1000000 characters long.

Output

Print "Yes" or "No" depending whether the word is a palindrome, case insensistive.

Sample Input 1

Did

Sample Output 1

Yes

Sample Input 2

MoOn

Sample Output 2

Sample Input 3

Gug

Sample Output 3

Yes

Sample Input 4

Hannah

Sample Output 4

Yes

Subtasks and Limits

Subtask	Score	#TC	Time	Memory	Scoring
1	100	10	1s	32MB	Average
2	0	2	1s	32MB	Average

Judge Compile Command

g++-7 ans.cpp -o palindromes -Wall -static -O2 -lm -m64 -s -w -std=gnu++17 -fmax-errors=512