回文数 - Problem

#254. 回文数

Statistics

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

如果一个单词从左向右读和从右向左读是一样的，那么它被称为回文。对于本题，如果一个正整数的十进制表示从左向右读和从右向左读是一样的，则称其为回文数。对于给定的每个数字，请找出大于或等于该数字的最小回文数。与纳斯卡赛车编号不同，前导零没有意义，且本题的输入或输出中的任何数字都不会包含前导零。

输入格式

输入的第一行包含测试用例的数量 $T$ ($1 \leq T \leq 50$)。接下来的 $T$ 行中，每行包含一个长度不超过 $80$ 位的正整数 $N$。

输出格式

对于每个测试用例，输出一行，包含大于或等于输入数字的最小回文数。

样例

输入格式 1

2
42
321

输出格式 1

44
323

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0