欢迎来到起遇信息学
起遇信息学正处于上线筹建阶段,以下功能已全部开放免费体验: ✅ 完整题库浏览与代码提交评测(C / C++ / Python / Java 等) ✅ 入门到进阶的系列课程试读、作业与考试 ✅ AI 提示、AI 作业分析等智能助教功能 ✅ 赛事模拟与个人能力报告 ✅ 邮箱注册开放 ⏳ 付费课程订阅与微信/支付宝支付通道 ⏳ 手机号登录,微信扫码登录、微信公众号绑定 使用中如遇任何问题,欢迎通过页面底部 **"联系我们"** 与我们沟通。
CF1385A.Three Pairwise Maximums
Three Pairwise Maximums
You are given three positive (i.e. strictly greater than zero) integers , and .
Your task is to find positive integers , and such that , and , or determine that it is impossible to find such , and .
You have to answer independent test cases. Print required , and in any (arbitrary) order.
Input
The first line of the input contains one integer () — the number of test cases. Then test cases follow.
The only line of the test case contains three integers , , and ().
Output
For each test case, print the answer:
- "
NO" in the only line of the output if a solution doesn't exist; - or "
YES" in the first line and any valid triple of positive integers , and () in the second line. You can print , and in any order.
Samples
5
3 2 3
100 100 100
50 49 49
10 30 20
1 1000000000 1000000000
YES
3 2 1
YES
100 100 100
NO
NO
YES
1 1 1000000000
在线编程 IDE
建议全屏模式获得最佳体验
| 进入全屏编程 | Alt+E |
| 递交评测 | Ctrl+Enter |
| 注释/取消注释 | Ctrl+/ |
| 缩放字体 | Ctrl+滚轮 |