Codeforces-SolutionsA/Codes/1971 C - Clock and Strings/1971C.cpp

30 lines
606 B
C++
Raw Normal View History

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
ll pow(ll x,ll y,ll m=1e9+7){ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;}
void solve()
{
ll a,b,c,d;
cin>>a>>b>>c>>d;
int ct=0;
for(int i=min(a,b); i<=max(a,b); ++i)
{
if(i==c || i==d) ct++;
}
if(ct & 1) cout<<"YES\n";
else cout<<"NO\n";
}
signed main()
{
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int TCS = 1;
cin >> TCS;
for (int TC = 1; TC <= TCS; ++TC)
{
// cout<<"Case "<<TC<<": ";
solve();
}
}