CF1616A.Integer Diversity

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

You are given $n$ integers $a_1, a_2, \ldots, a_n$ . You choose any subset of the given numbers (possibly, none or all numbers) and negate these numbers (i. e. change $x \to (-x)$ ). What is the maximum number of different values in the array you can achieve?

输入格式

The first line of input contains one integer $t$ ( $1 \leq t \leq 100$ ): the number of test cases.

The next lines contain the description of the $t$ test cases, two lines per a test case.

In the first line you are given one integer $n$ ( $1 \leq n \leq 100$ ): the number of integers in the array.

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $-100 \leq a_i \leq 100$ ).

输出格式

For each test case, print one integer: the maximum number of different elements in the array that you can achieve negating numbers in the array.

输入输出样例

输入#1
```
3
4
1 1 2 2
3
1 2 3
2
0 0
```
输出#1
```
4
3
1
```

说明/提示

In the first example we can, for example, negate the first and the last numbers, achieving the array $[-1, 1, 2, -2]$ with four different values.

In the second example all three numbers are already different.

In the third example negation does not change anything.

首页