[Solution] All Distinct Codeforces Solution | Codeforces Problem Solution 2022

[Solution] All Distinct Codeforces Solution | Codeforces Problem Solution 2022

B. All Distinct

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Sho has an array a$a$ consisting of n$n$ integers. An operation consists of choosing two distinct indices i$i$ and j$j$ and removing ai$a_i$ and aj$a_j$ from the array.

For example, for the array [2,3,4,2,5]$[2,3,4,2,5]$, Sho can choose to remove indices 1$1$ and 3$3$. After this operation, the array becomes [3,2,5]$[3,2,5]$. Note that after any operation, the length of the array is reduced by two.

After he made some operations, Sho has an array that has only distinct elements. In addition, he made operations such that the resulting array is the longest possible.

More formally, the array after Sho has made his operations respects these criteria:

• No pairs such that (i<j$i<j$) and ai=aj$a_i=a_j$ exist.
• The length of a$a$ is maximized.

Solution Click Below:-  CLICK HERE

Output the length of the final array.

Input

The first line contains a single integer t$t$ (1≤t≤103$1\le t\le {10}^3$) — the number of test cases.

The first line of each test case contains a single integer n$n$ (1≤n≤50$1\le n\le 50$) — the length of the array.

Marathon Codeforces Solution

All Distinct Codeforces Solution

Where's the Bishop? Codeforces Solution

The Clock Codeforces Solution

Binary Deque Codeforces Solution

3SUM Codeforces Solution

2^Sort Codeforces Solution

Gambling Codeforces Solution

The second line of each test case contains n$n$ integers ai$a_i$ (1≤ai≤104$1\le a_i\le {10}^4$) — the elements of the array.

Output

For each test case, output a single integer — the length of the final array. Remember that in the final array, all elements are different, and its length is maximum.