判断奇数和偶数的个数是否合法。
#include<bits/stdc++.h> #define int long long #define double long double #define x first #define y second using namespace std; typedef long long LL; typedef long long ll; typedef pair<int, int> PII; const int N = 3e5 + 10; const int M = 1e3 + 10; int mod = 1e9 + 7; int a[N]; void solve() { int c1 = 0, c2 = 0; int n; cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> x; if (x % 2) c1++; else c2++; } if (c1 >= 3 || (c1 >= 1 && c2 >= 2)) cout << "YES\n"; else cout << "NO\n"; } signed main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); int _; _ = 1; //cin>>_; while (_--) { solve(); } }