欢迎来到起遇信息学
起遇信息学正处于上线筹建阶段,以下功能已全部开放免费体验: ✅ 完整题库浏览与代码提交评测(C / C++ / Python / Java 等) ✅ 入门到进阶的系列课程试读、作业与考试 ✅ AI 提示、AI 作业分析等智能助教功能 ✅ 赛事模拟与个人能力报告 ✅ 邮箱注册开放 ⏳ 付费课程订阅与微信/支付宝支付通道 ⏳ 手机号登录,微信扫码登录、微信公众号绑定 使用中如遇任何问题,欢迎通过页面底部 **"联系我们"** 与我们沟通。
CF2126A.Only One Digit
Only One Digit
You are given an integer . You need to find the smallest non-negative integer such that the numbers and share at least one common digit. In other words, there must exist a decimal digit that appears in both the representation of the number and the number .
Input
The first line contains an integer () — the number of test cases.
The first line of each test case contains one integer ().
Output
For each test case, output one integer — the minimum non-negative number that satisfies the condition.
Note
In the first test case, the numbers and share the common digit '6'. Moreover, there is no natural number smaller than this that shares a common digit.
In the second test case, the numbers and share the common digit '6'.
Samples
5
6
96
78
122
696
6
6
7
1
6
在线编程 IDE
建议全屏模式获得最佳体验
| 进入全屏编程 | Alt+E |
| 递交评测 | Ctrl+Enter |
| 注释/取消注释 | Ctrl+/ |
| 缩放字体 | Ctrl+滚轮 |