CT359

Palindrome Number Check

MediumAcceptance: 0.0%

In the ancient kingdom of Numeria, where rivers are carved from flowing digits and the great library holds every equation ever written, a young scholar named Lyra has been summoned before the Grand Archivist. The Archivist's eyes gleam with urgency as he unrolls a weathered parchment before her. The kingdom's legendary Codex of Truth has begun to unravel, and only a true master of logic can stitch it back together. The challenge before you, brave coder, is known as "Palindrome Number Check". It is whispered to be a trial of the Recursion Renegade tier — a difficulty level reserved for those who have proven their worth in the lower halls of the academy. Lyra must solve it to unlock the next chamber of the Codex. In the ancient kingdom of Numeria, where rivers are carved from flowing digits and the great library holds every equation ever written, a young scholar named Lyra has been summoned before the Grand Archivist. The Archivist's eyes gleam with urgency as he unrolls a weathered parchment before her. The kingdom's legendary Codex of Truth has begun to unravel, and only a true master of logic can stitch it back together. The challenge before you, brave coder, is known as "Palindrome Number Check". It is whispered to be a trial of the Recursion Renegade tier — a difficulty level reserved for those who have proven their worth in the lower halls of the academy. Lyra must solve it to unlock the next chamber of the Codex. Read a non-negative integer N from standard input and print "Yes" if it is a palindrome, otherwise "No". The Archivist's scroll bears the following inscriptions, which define the boundaries of the challenge: 0 <= N <= 10^9 To guide Lyra's quill, the elders have provided these sacred examples: Input: 1331 Output: Yes Time is short. The candles in the Grand Library are burning low, and the Codex grows more fragile with every passing moment. Write your solution with care, for the fate of Numeria's knowledge rests upon your code. Every line must be correct, every edge case considered. Show the Grand Archivist that you are worthy of the Recursion Renegade rank. The Archivist's scroll bears the following inscriptions, which define the boundaries of the challenge: 0 <= N <= 10^9 To guide Lyra's quill, the elders have provided these sacred examples: Input: 1331 Output: Yes Time is short. The candles in the Grand Library are burning low, and the Codex grows more fragile with every passing moment. Write your solution with care, for the fate of Numeria's knowledge rests upon your code. Every line must be correct, every edge case considered. Show the Grand Archivist that you are worthy of the Recursion Renegade rank. The path to mastering Palindrome Number Check is not one that can be walked in a single step. It demands patience, precision, and a deep respect for the boundaries that shape the problem. Many adventurers before you have attempted this trial and failed, their code crashing against the very constraints that the elders inscribed. But you have the tools. You have the training. You have reached the Recursion Renegade tier, and that alone means the council believes in your potential. Look once more at the examples above. Trace the logic with your finger if you must. Consider the time and memory limits carefully, for they are not suggestions but strict laws of the arena. When you are ready, commit your solution. Let the compiler run. Let the test cases judge your work. If your code is true, the gates will open and you will move closer to the ultimate rank. If not, study the failure, sharpen your algorithm, and try again. For in the halls of CodeTikki, the only thing more important than success is the wisdom gained from the attempt. Remember that the Recursion Renegade challenge is designed to test not just knowledge, but character. Every edge case is a lesson. Every time limit is a teacher. Every hidden test is a guardian at the gate. Do not rush. Let your code breathe. Let it be as clean as a mountain stream. When the final test passes, you will know that you have earned the title. Until then, code with courage, test with care, and never stop learning.

Constraints:

0 <= N <= 10^9

Loading...
Test Cases:No test cases
No test cases available.