欢迎来到起遇信息学
起遇信息学正处于上线筹建阶段,以下功能已全部开放免费体验: ✅ 完整题库浏览与代码提交评测(C / C++ / Python / Java 等) ✅ 入门到进阶的系列课程试读、作业与考试 ✅ AI 提示、AI 作业分析等智能助教功能 ✅ 赛事模拟与个人能力报告 ✅ 邮箱注册开放 ⏳ 付费课程订阅与微信/支付宝支付通道 ⏳ 手机号登录,微信扫码登录、微信公众号绑定 使用中如遇任何问题,欢迎通过页面底部 **"联系我们"** 与我们沟通。
CF2171A.Shizuku Hoshikawa and Farm Legs
Shizuku Hoshikawa and Farm Legs
Nothing's ever been the same since... that summer with her.— Shizuku Hoshikawa
Kaori wants to spend the day with Shizuku! However, the zoo is closed, so they are visiting Farmer John's farm instead.
At Farmer John's farm, Shizuku counts legs. It is known that only chickens and cows live on the farm; a chicken has legs, while a cow has .
Count how many different configurations of Farmer John's farm are possible. Two configurations are considered different if they contain either a different number of chickens, a different number of cows, or both.
Note that Farmer John's farm may contain zero chickens or zero cows.
Input
The first line contains a single integer () — the number of test cases.
The only line of each test case contains a single integer ().
Output
For each test case, output a single integer, the number of different configurations of Farmer John's farm that are possible.
Note
For , there are two possible configurations of Farmer John's farm:
- he can have two chickens and zero cows, or
- he can have zero chickens and one cow.
It can be shown that these are the only possible configurations of Farmer John's farm.
For , it can be shown that there are no possible configurations of Farmer John's farm.
Samples
5
2
3
4
6
100
1
0
2
2
26
在线编程 IDE
建议全屏模式获得最佳体验
| 进入全屏编程 | Alt+E |
| 递交评测 | Ctrl+Enter |
| 注释/取消注释 | Ctrl+/ |
| 缩放字体 | Ctrl+滚轮 |