fork download
copy 
  1. #include <iostream>
  2. #include<bits/stdc++.h>
  3. #include <vector>
  4. #include <stack>
  5. #include <queue>
  6. #include <deque>
  7. #include <utility>
  8. #include <set>
  9. #include <map>
  10. #include <unordered_set>
  11. #include <unordered_map>
  12. #define IOF ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  13. #define ll long long
  14. #define ld long double
  15. #define cy cout << "YES" << '\n';
  16. #define cn cout << "NO" << '\n';
  17. using namespace std;
  18. vector<bool> prime(1e5+5 , 1);
  19. void is_prime()
  20. { prime[0]=0;
  21.   prime[1]=0;
  22.     for (ll i = 2; i*i <= 1e5+5; i++)
  23.     {   if(prime[i])
  24.         for (ll j = i*i; j < 1e5+5; j+=i)
  25.         prime[j]=0;
  26.     }
  27.  
  28. }
  29. int main()
  30. {IOF
  31. int t ; cin >> t;
  32. while (t--)
  33. {
  34.  int n; cin >> n;
  35. bool one = 0 , zero = 0 , two= 0 , seq = 0;
  36.  ll arr[n];
  37.  for (int i = 0; i < n; i++)
  38.  {
  39.     ll x; cin >> x;
  40.     if(x==1)one = 1;
  41.     if(x==0)zero = 1;
  42.     if(x==2)two = 1;
  43.     arr[i]=x;
  44.  }
  45.  sort(arr, arr+n);
  46.  for (int i = 1; i < n; i++)
  47.     if(arr[i]==arr[i-1]-1)seq=1;
  48.  
  49.  
  50.  if(one && zero || seq)cn
  51.  else if(one && !zero && two)cn
  52.  else cy
  53. }
  54.  
  55.     return 0 ;
  56. }
  57.  
Success #stdin #stdout 0s 5308KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
YES
YES
https://ideone.com/sD0prH
language:
C++ (gcc 8.3)
created:
16 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!