欢迎来到起遇信息学
起遇信息学正处于上线筹建阶段,以下功能已全部开放免费体验: ✅ 完整题库浏览与代码提交评测(C / C++ / Python / Java 等) ✅ 入门到进阶的系列课程试读、作业与考试 ✅ AI 提示、AI 作业分析等智能助教功能 ✅ 赛事模拟与个人能力报告 ✅ 邮箱注册开放 ⏳ 付费课程订阅与微信/支付宝支付通道 ⏳ 手机号登录,微信扫码登录、微信公众号绑定 使用中如遇任何问题,欢迎通过页面底部 **"联系我们"** 与我们沟通。
CF1485A.Add and Divide
Add and Divide
You have two positive integers and .
You can perform two kinds of operations:
- (replace with the integer part of the division between and )
- (increase by )
Find the minimum number of operations required to make .
Input
The first line contains a single integer () — the number of test cases.
The only line of the description of each test case contains two integers , ().
Output
For each test case, print a single integer: the minimum number of operations required to make .
Note
In the first test case, one of the optimal solutions is:
- Divide by . After this operation and .
- Divide by . After this operation and .
- Increase . After this operation and .
- Divide by . After this operation and .
Samples
6
9 2
1337 1
1 1
50000000 4
991026972 997
1234 5678
4
9
2
12
3
1
在线编程 IDE
建议全屏模式获得最佳体验
键盘快捷键
| 进入全屏编程 | Alt+E |
| 递交评测 | Ctrl+Enter |
| 注释/取消注释 | Ctrl+/ |
| 缩放字体 | Ctrl+滚轮 |
第 1 行,第 1 列
0 字符
-
最近自测结果
暂未运行
最近递交结果
暂无递交记录