CF1542A.Odd Set

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

You are given a multiset (i. e. a set that can contain multiple equal integers) containing $2n$ integers. Determine if you can split it into exactly $n$ pairs (i. e. each element should be in exactly one pair) so that the sum of the two elements in each pair is odd (i. e. when divided by $2$ , the remainder is $1$ ).

输入格式

The input consists of multiple test cases. The first line contains an integer $t$ ( $1\leq t\leq 100$ ) — the number of test cases. The description of the test cases follows.

The first line of each test case contains an integer $n$ ( $1\leq n\leq 100$ ).

The second line of each test case contains $2n$ integers $a_1,a_2,\dots, a_{2n}$ ( $0\leq a_i\leq 100$ ) — the numbers in the set.

输出格式

For each test case, print "Yes" if it can be split into exactly $n$ pairs so that the sum of the two elements in each pair is odd, and "No" otherwise. You can print each letter in any case.

输入输出样例

输入#1

5
2
2 3 4 5
3
2 3 4 5 5 5
1
2 4
1
2 3
4
1 5 3 2 6 7 3 4

输出#1

Yes
No
No
Yes
No

说明/提示

In the first test case, a possible way of splitting the set is $(2,3)$ , $(4,5)$ .

In the second, third and fifth test case, we can prove that there isn't any possible way.

In the fourth test case, a possible way of splitting the set is $(2,3)$ .

首页