欢迎来到起遇信息学
起遇信息学正处于上线筹建阶段,以下功能已全部开放免费体验: ✅ 完整题库浏览与代码提交评测(C / C++ / Python / Java 等) ✅ 入门到进阶的系列课程试读、作业与考试 ✅ AI 提示、AI 作业分析等智能助教功能 ✅ 赛事模拟与个人能力报告 ✅ 邮箱注册开放 ⏳ 付费课程订阅与微信/支付宝支付通道 ⏳ 手机号登录,微信扫码登录、微信公众号绑定 使用中如遇任何问题,欢迎通过页面底部 **"联系我们"** 与我们沟通。
CF1130A.Be Positive
Be Positive
You are given an array of integers: . Your task is to find some non-zero integer () such that, after each number in the array is divided by , the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least ). Note that those positive numbers do not need to be an integer (e.g., a counts as a positive number). If there are multiple values of that satisfy the condition, you may print any of them. In case that there is no such , print a single integer .
Recall that represents the smallest integer that is not less than and that zero () is neither positive nor negative.
Input
The first line contains one integer () — the number of elements in the array.
The second line contains space-separated integers ().
Output
Print one integer ( and ) that satisfies the given condition. If there are multiple values of that satisfy the condition, you may print any of them. In case that there is no such , print a single integer .
Note
In the first sample, , so we need at least positive numbers after division. If , the array after division is , in which there are positive numbers (namely: , , and ).
In the second sample, there is no valid , so should be printed.
Samples
5
10 0 -7 2 6
4
7
0 0 1 -1 0 0 2
0
在线编程 IDE
建议全屏模式获得最佳体验
| 进入全屏编程 | Alt+E |
| 递交评测 | Ctrl+Enter |
| 注释/取消注释 | Ctrl+/ |
| 缩放字体 | Ctrl+滚轮 |