CF1130A.Be Positive

入门

通过率:0%

时间限制:1.00s

内存限制:256MB

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You are given an array of nn integers: a1,a2,…,ana_1, a_2, \ldots, a_n. Your task is to find some non-zero integer dd (−103≤d≤103-10^3 \leq d \leq 10^3) such that, after each number in the array is divided by dd, 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 ⌈n2⌉\lceil\frac{n}{2}\rceil). Note that those positive numbers do not need to be an integer (e.g., a 2.52.5 counts as a positive number). If there are multiple values of dd that satisfy the condition, you may print any of them. In case that there is no such dd, print a single integer 00.

Recall that ⌈x⌉\lceil x \rceil represents the smallest integer that is not less than xx and that zero (00) is neither positive nor negative.

给你一个包含 nn 个整数的数组:a1,a2,…,ana_1, a_2, \ldots, a_n。你的任务是找出某个非零整数 dd(满足 −103≤d≤103-10^3 \leq d \leq 10^3),使得将数组中每个数都除以 dd 后,结果中正数的个数不少于数组长度的一半(即至少为 ⌈n2⌉\lceil\frac{n}{2}\rceil)。注意:这些正数无需为整数(例如,2.52.5 算作一个正数)。若存在多个满足条件的 dd,输出其中任意一个即可。若不存在这样的 dd,则输出单个整数 00。

注意:⌈x⌉\lceil x \rceil 表示不小于 xx 的最小整数;而零(00)既不是正数,也不是负数。

输入格式

The first line contains one integer nn (1≤n≤1001 \le n \le 100) — the number of elements in the array.

The second line contains nn space-separated integers a1,a2,…,ana_1, a_2, \ldots, a_n (−103≤ai≤103-10^3 \le a_i \le 10^3).

第一行包含一个整数 nn(1≤n≤1001 \le n \le 100)—— 表示数组中元素的个数。

第二行包含 nn 个以空格分隔的整数 a1,a2,…,ana_1, a_2, \ldots, a_n(−103≤ai≤103-10^3 \le a_i \le 10^3)。

输出格式

Print one integer dd (−103≤d≤103-10^3 \leq d \leq 10^3 and d≠0d \neq 0) that satisfies the given condition. If there are multiple values of dd that satisfy the condition, you may print any of them. In case that there is no such dd, print a single integer 00.

输出一个整数 dd(满足 −103≤d≤103-10^3 \leq d \leq 10^3 且 d≠0d \neq 0),使其满足给定条件。若存在多个满足条件的 dd,可任选其一输出。若不存在满足条件的 dd,则输出单个整数 00。

输入输出样例

  • 输入#1

    5
    10 0 -7 2 6

    输出#1

    4
  • 输入#2

    7
    0 0 1 -1 0 0 2

    输出#2

    0

说明/提示

In the first sample, n=5n = 5, so we need at least ⌈52⌉=3\lceil\frac{5}{2}\rceil = 3 positive numbers after division. If d=4d = 4, the array after division is [2.5,0,−1.75,0.5,1.5][2.5, 0, -1.75, 0.5, 1.5], in which there are 33 positive numbers (namely: 2.52.5, 0.50.5, and 1.51.5).

In the second sample, there is no valid dd, so 00 should be printed.

在第一个样例中,n=5n = 5,因此除法运算后至少需要 ⌈52⌉=3\lceil\frac{5}{2}\rceil = 3 个正数。若 d=4d = 4,则除法后的数组为 [2.5,0,−1.75,0.5,1.5][2.5, 0, -1.75, 0.5, 1.5],其中包含 33 个正数(即:2.52.5、0.50.5 和 1.51.5)。

在第二个样例中,不存在满足条件的 dd,因此应输出 00。

输入解题思路,AI测评打分。不知道怎么写?

首页