欢迎来到起遇信息学
起遇信息学正处于上线筹建阶段,以下功能已全部开放免费体验: ✅ 完整题库浏览与代码提交评测(C / C++ / Python / Java 等) ✅ 入门到进阶的系列课程试读、作业与考试 ✅ AI 提示、AI 作业分析等智能助教功能 ✅ 赛事模拟与个人能力报告 ✅ 邮箱注册开放 ⏳ 付费课程订阅与微信/支付宝支付通道 ⏳ 手机号登录,微信扫码登录、微信公众号绑定 使用中如遇任何问题,欢迎通过页面底部 **"联系我们"** 与我们沟通。
CF2038N.Fixing the Expression
Fixing the Expression
An expression is a string consisting of three characters, where the first and the last characters are digits (from to ), and the middle character is a comparison symbol (<, = or >).
An expression is true if the comparison symbol matches the digits (for example, if the first digit is strictly less than the last digit, the comparison symbol should be <).
For example, the expressions 1<3, 4>2, 0=0 are true, while 5>5, 7<3 are not.
You are given a string , which is an expression. Change as few characters as possible so that becomes a true expression. Note that if is already true, you should leave it as it is.
Input
The first line contains one integer () — the number of test cases.
Each test case consists of one line containing the string (, the first and the last characters of are digits, the second character is a comparison symbol).
Output
For each test case, print a string consisting of characters — a true expression which can be obtained by changing as few characters as possible in . If there are multiple answers, print any of them.
Samples
5
3<7
3>7
8=9
0=0
5<3
3<7
8>7
8<9
0=0
0<3
在线编程 IDE
建议全屏模式获得最佳体验
| 进入全屏编程 | Alt+E |
| 递交评测 | Ctrl+Enter |
| 注释/取消注释 | Ctrl+/ |
| 缩放字体 | Ctrl+滚轮 |