欢迎来到起遇信息学
起遇信息学正处于上线筹建阶段,以下功能已全部开放免费体验: ✅ 完整题库浏览与代码提交评测(C / C++ / Python / Java 等) ✅ 入门到进阶的系列课程试读、作业与考试 ✅ AI 提示、AI 作业分析等智能助教功能 ✅ 赛事模拟与个人能力报告 ✅ 邮箱注册开放 ⏳ 付费课程订阅与微信/支付宝支付通道 ⏳ 手机号登录,微信扫码登录、微信公众号绑定 使用中如遇任何问题,欢迎通过页面底部 **"联系我们"** 与我们沟通。
CF1958A.1-3-5
1-3-5
In Berland, coins of worth , and burles are commonly used (burles are local currency).
Eva has to pay exactly burles in a shop. She has an infinite amount of coins of all three types. However, she doesn't like to pay using coins worth burle — she thinks they are the most convenient to use.
Help Eva to calculate the minimum number of coins worth burle she has to use, if she has to pay exactly burles. Note that she can spend any number of coins worth and/or burles.
Input
The first line contains one integer () — the number of test cases.
Each test case consists of one line, containing one integer ().
Output
For each test case, print one integer — the minimum number of -burle coins Eva has to use.
Note
In the first test case, Eva should use coin worth burle, and coins worth burles.
In the second test case, Eva should use coin worth burles and coin worth burles.
In the third test case, Eva should use coins worth burles.
In the fourth test case, Eva should use coins worth burle.
In the fifth test case, Eva should use coins worth burles and coin worth burles.
Samples
5
7
8
42
2
11
1
0
0
2
0
在线编程 IDE
建议全屏模式获得最佳体验
| 进入全屏编程 | Alt+E |
| 递交评测 | Ctrl+Enter |
| 注释/取消注释 | Ctrl+/ |
| 缩放字体 | Ctrl+滚轮 |