-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCounting Problem.cpp
70 lines (57 loc) · 946 Bytes
/
Counting Problem.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/*
***** !!!!! JAI SHREE KRISHNA !!!!! *****
Date - 3rd March 2023
Code by - Abhinav Anand
Problem link -> https://www.codechef.com/problems/COUNTP
*/
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#define ll long long int
#define endl "\n"
using namespace std;
bool isprime(int n)
{
for(int i=2;i<=sqrt(n);i++)
{
if(n%i==0)
return false;
}
return true;
}
bool checkparity(int n)
{
if(n%2==0)
return true;
else
return false;
}
void solve()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
int e=0,o=0;
for(int i=0;i<n;i++)
{
if(a[i]%2==0)
e++;
else if(a[i]%2!=0)
o++;
}
if((o%2==0 && o!=0))
cout << "YES" << endl;
else
cout << "NO" << endl;
}
int main() {
ll t;
cin>>t;
while(t--)
{
solve();
}
return 0;
}