欢迎来到起遇信息学
起遇信息学正处于上线筹建阶段,以下功能已全部开放免费体验: ✅ 完整题库浏览与代码提交评测(C / C++ / Python / Java 等) ✅ 入门到进阶的系列课程试读、作业与考试 ✅ AI 提示、AI 作业分析等智能助教功能 ✅ 赛事模拟与个人能力报告 ✅ 邮箱注册开放 ⏳ 付费课程订阅与微信/支付宝支付通道 ⏳ 手机号登录,微信扫码登录、微信公众号绑定 使用中如遇任何问题,欢迎通过页面底部 **"联系我们"** 与我们沟通。
CF2137C.Maximum Even Sum
Maximum Even Sum
You are given two integers and . You are to perform the following procedure:
First, you choose an integer such that is divisible by . Then, you simultaneously multiply by and divide by .
Find the greatest possible even value of . If it is impossible to make even, output instead.
Input
Each test contains multiple test cases. The first line contains the number of test cases (). The description of the test cases follows.
The first line of each test case contains two integers and (.
Output
For each test case, output the maximum even value of on a new line.
Note
In the first test case, it can be shown it is impossible for to be even.
In the second test case, the optimal is . The sum is .
Samples
7
8 1
1 8
7 7
2 6
9 16
1 6
4 6
-1
6
50
8
74
-1
14
在线编程 IDE
建议全屏模式获得最佳体验
| 进入全屏编程 | Alt+E |
| 递交评测 | Ctrl+Enter |
| 注释/取消注释 | Ctrl+/ |
| 缩放字体 | Ctrl+滚轮 |