Language: C++

#include <bits/stdc++.h>
#include <algorithm>
using namespace std; 
  
typedef long long LL; 
typedef pair<int, int> pii; 
typedef pair<LL, LL> pll; 
typedef pair<string, string> pss; 
typedef vector<int> vi; 
typedef vector<string> vs;
typedef vector<vi> vvi; 
typedef vector<pii> vii; 
typedef vector<LL> vl; 
typedef vector<vl> vvl; 
  
double EPS = 1e-9; 
int INF = 100005; 
long long int mod=1000000007;
long long TES=1000007;
long long INFF = 1000000000000000005LL; 
double PI = acos(-1); 
int dirx[8] = { -1, 0, 0, 1, -1, -1, 1, 1 }; 
int diry[8] = { 0, 1, -1, 0, -1, 1, -1, 1 }; 
  
#ifdef TESTING 
#define DEBUG fprintf(stderr, "====TESTING====\n") 
#define VALUE(x) cerr << "The value of " << #x << " is " << x << endl 
#define debug(...) fprintf(stderr, __VA_ARGS__) 
#else 
#define DEBUG 
#define VALUE(x) 
#define debug(...) 
#endif 
  
#define FOR(a, b, c) for (int(a) = (b); (a) < (c); ++(a)) 
#define FORN(a, b, c) for (int(a) = (b); (a) <= (c); ++(a)) 
#define FORD(a, b, c) for (int(a) = (b); (a) >= (c); --(a)) 
#define FORSQ(a, b, c) for (int(a) = (b); (a) * (a) <= (c); ++(a)) 
#define FORC(a, b, c) for (char(a) = (b); (a) <= (c); ++(a)) 
#define FOREACH(a, b) for (auto&(a) : (b)) 
#define REP(i, n) FOR(i, 0, n) 
#define REPN(i, n) FORN(i, 1, n) 
#define MAX(a, b) a = max(a, b) 
#define MIN(a, b) a = min(a, b) 
#define SQR(x) ((LL)(x) * (x)) 
#define RESET(a, b) memset(a, b, sizeof(a)) 
#define fi first 
#define se second 
#define mp make_pair 
#define pb push_back 
#define ALL(v) v.begin(), v.end() 
#define ALLA(arr, sz) arr, arr + sz 
#define SIZE(v) (int)v.size() 
#define SORT(v) sort(ALL(v)) 
#define REVERSE(v) reverse(ALL(v)) 
#define SORTA(arr, sz) sort(ALLA(arr, sz)) 
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz)) 
#define PERMUTE next_permutation 
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define TC(t) while (t--)

int main()
{
  int  a,b,c,d,s=0;
  cin>>a>>b>>c>>d;
  int amd=a%d,cmb=c%b,acd=a/d,ccb=c/b;
  if(!amd && !cmb)
  {
      if(acd<=ccb)
      s=1;
  }
  else
  if(!amd && cmb)
  {
      if(acd>=ccb+1)
      s=1;
 
  }
  else
  if(!cmb && amd)
  {
      if(ccb<=acd+1)
      s=1;
  }
  else
  if(cmb & amd)
  {
      if(acd<=cmb)
      s=1;
  }
   if(s==1) cout<<"YES\n";
   else
   cout<<"NO\n";
   return 0;
}






#include <bits/stdc++.h>
#include <algorithm>
using namespace std; 
  
typedef long long LL; 
typedef pair<int, int> pii; 
typedef pair<LL, LL> pll; 
typedef pair<string, string> pss; 
typedef vector<int> vi; 
typedef vector<string> vs;
typedef vector<vi> vvi; 
typedef vector<pii> vii; 
typedef vector<LL> vl; 
typedef vector<vl> vvl; 
  
double EPS = 1e-9; 
int INF = 100005; 
long long int mod=1000000007;
long long TES=1000007;
long long INFF = 1000000000000000005LL; 
double PI = acos(-1); 
int dirx[8] = { -1, 0, 0, 1, -1, -1, 1, 1 }; 
int diry[8] = { 0, 1, -1, 0, -1, 1, -1, 1 }; 
  
#ifdef TESTING 
#define DEBUG fprintf(stderr, "====TESTING====\n") 
#define VALUE(x) cerr << "The value of " << #x << " is " << x << endl 
#define debug(...) fprintf(stderr, __VA_ARGS__) 
#else 
#define DEBUG 
#define VALUE(x) 
#define debug(...) 
#endif 
  
#define FOR(a, b, c) for (int(a) = (b); (a) < (c); ++(a)) 
#define FORN(a, b, c) for (int(a) = (b); (a) <= (c); ++(a)) 
#define FORD(a, b, c) for (int(a) = (b); (a) >= (c); --(a)) 
#define FORSQ(a, b, c) for (int(a) = (b); (a) * (a) <= (c); ++(a)) 
#define FORC(a, b, c) for (char(a) = (b); (a) <= (c); ++(a)) 
#define FOREACH(a, b) for (auto&(a) : (b)) 
#define REP(i, n) FOR(i, 0, n) 
#define REPN(i, n) FORN(i, 1, n) 
#define MAX(a, b) a = max(a, b) 
#define MIN(a, b) a = min(a, b) 
#define SQR(x) ((LL)(x) * (x)) 
#define RESET(a, b) memset(a, b, sizeof(a)) 
#define fi first 
#define se second 
#define mp make_pair 
#define pb push_back 
#define ALL(v) v.begin(), v.end() 
#define ALLA(arr, sz) arr, arr + sz 
#define SIZE(v) (int)v.size() 
#define SORT(v) sort(ALL(v)) 
#define REVERSE(v) reverse(ALL(v)) 
#define SORTA(arr, sz) sort(ALLA(arr, sz)) 
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz)) 
#define PERMUTE next_permutation 
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define TC(t) while (t--)

int main()
{
  int  a,b,c,d,s=0;
  cin>>a>>b>>c>>d;
  int amd=a%d,cmb=c%b,acd=a/d,ccb=c/b;
  if(!amd && !cmb)
  {
      if(acd<=ccb)
      s=1;
  }
  else
  if(!amd && cmb)
  {
      if(acd>=ccb+1)
      s=1;
 
  }
  else
  if(!cmb && amd)
  {
      if(ccb<=acd+1)
      s=1;
  }
  else
  if(cmb & amd)
  {
      if(acd<=cmb)
      s=1;
  }
   if(s==1) cout<<"YES\n";
   else
   cout<<"NO\n";
   return 0;
}






#include <bits/stdc++.h>
#include <algorithm>
using namespace std; 
  
typedef long long LL; 
typedef pair<int, int> pii; 
typedef pair<LL, LL> pll; 
typedef pair<string, string> pss; 
typedef vector<int> vi; 
typedef vector<string> vs;
typedef vector<vi> vvi; 
typedef vector<pii> vii; 
typedef vector<LL> vl; 
typedef vector<vl> vvl; 
  
double EPS = 1e-9; 
int INF = 100005; 
long long int mod=1000000007;
long long TES=1000007;
long long INFF = 1000000000000000005LL; 
double PI = acos(-1); 
int dirx[8] = { -1, 0, 0, 1, -1, -1, 1, 1 }; 
int diry[8] = { 0, 1, -1, 0, -1, 1, -1, 1 }; 
  
#ifdef TESTING 
#define DEBUG fprintf(stderr, "====TESTING====\n") 
#define VALUE(x) cerr << "The value of " << #x << " is " << x << endl 
#define debug(...) fprintf(stderr, __VA_ARGS__) 
#else 
#define DEBUG 
#define VALUE(x) 
#define debug(...) 
#endif 
  
#define FOR(a, b, c) for (int(a) = (b); (a) < (c); ++(a)) 
#define FORN(a, b, c) for (int(a) = (b); (a) <= (c); ++(a)) 
#define FORD(a, b, c) for (int(a) = (b); (a) >= (c); --(a)) 
#define FORSQ(a, b, c) for (int(a) = (b); (a) * (a) <= (c); ++(a)) 
#define FORC(a, b, c) for (char(a) = (b); (a) <= (c); ++(a)) 
#define FOREACH(a, b) for (auto&(a) : (b)) 
#define REP(i, n) FOR(i, 0, n) 
#define REPN(i, n) FORN(i, 1, n) 
#define MAX(a, b) a = max(a, b) 
#define MIN(a, b) a = min(a, b) 
#define SQR(x) ((LL)(x) * (x)) 
#define RESET(a, b) memset(a, b, sizeof(a)) 
#define fi first 
#define se second 
#define mp make_pair 
#define pb push_back 
#define ALL(v) v.begin(), v.end() 
#define ALLA(arr, sz) arr, arr + sz 
#define SIZE(v) (int)v.size() 
#define SORT(v) sort(ALL(v)) 
#define REVERSE(v) reverse(ALL(v)) 
#define SORTA(arr, sz) sort(ALLA(arr, sz)) 
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz)) 
#define PERMUTE next_permutation 
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define TC(t) while (t--)

int main()
{
  int  a,b,c,d,s=0;
  cin>>a>>b>>c>>d;
  int amd=a%d,cmb=c%b,acd=a/d,ccb=c/b;
  if(!amd && !cmb)
  {
      if(acd<=ccb)
      s=1;
  }
  else
  if(!amd && cmb)
  {
      if(acd>=ccb+1)
      s=1;
 
  }
  else
  if(!cmb && amd)
  {
      if(ccb<=acd+1)
      s=1;
  }
  else
  if(cmb & amd)
  {
      if(acd<=cmb)
      s=1;
  }
   if(s==1) cout<<"YES\n";
   else
   cout<<"NO\n";
   return 0;
}








Compiler output:
a.cc:117:8: error: redefinition of 'double EPS'
  117 | double EPS = 1e-9;
      |        ^~~
a.cc:16:8: note: 'double EPS' previously defined here
   16 | double EPS = 1e-9;
      |        ^~~
a.cc:118:5: error: redefinition of 'int INF'
  118 | int INF = 100005;
      |     ^~~
a.cc:17:5: note: 'int INF' previously defined here
   17 | int INF = 100005;
      |     ^~~
a.cc:119:15: error: redefinition of 'long long int mod'
  119 | long long int mod=1000000007;
      |               ^~~
a.cc:18:15: note: 'long long int mod' previously defined here
   18 | long long int mod=1000000007;
      |               ^~~
a.cc:120:11: error: redefinition of 'long long int TES'
  120 | long long TES=1000007;
      |           ^~~
a.cc:19:11: note: 'long long int TES' previously defined here
   19 | long long TES=1000007;
      |           ^~~
a.cc:121:11: error: redefinition of 'long long int INFF'
  121 | long long INFF = 1000000000000000005LL;
      |           ^~~~
a.cc:20:11: note: 'long long int INFF' previously defined here
   20 | long long INFF = 1000000000000000005LL;
      |           ^~~~
a.cc:122:8: error: redefinition of 'double PI'
  122 | double PI = acos(-1);
      |        ^~
a.cc:21:8: note: 'double PI' previously defined here
   21 | double PI = acos(-1);
      |        ^~
a.cc:123:5: error: redefinition of 'int dirx [8]'
  123 | int dirx[8] = { -1, 0, 0, 1, -1, -1, 1, 1 };
      |     ^~~~
a.cc:22:5: note: 'int dirx [8]' previously defined here
   22 | int dirx[8] = { -1, 0, 0, 1, -1, -1, 1, 1 };
      |     ^~~~
a.cc:124:5: error: redefinition of 'int diry [8]'
  124 | int diry[8] = { 0, 1, -1, 0, -1, 1, -1, 1 };
      |     ^~~~
a.cc:23:5: note: 'int diry [8]' previously defined here
   23 | int diry[8] = { 0, 1, -1, 0, -1, 1, -1, 1 };
      |     ^~~~
a.cc:163:5: error: redefinition of 'int main()'
  163 | int main()
      |     ^~~~
a.cc:62:5: note: 'int main()' previously defined here
   62 | int main()
      |     ^~~~
a.cc:218:8: error: redefinition of 'double EPS'
  218 | double EPS = 1e-9;
      |        ^~~
a.cc:16:8: note: 'double EPS' previously defined here
   16 | double EPS = 1e-9;
      |        ^~~
a.cc:219:5: error: redefinition of 'int INF'
  219 | int INF = 100005;
      |     ^~~
a.cc:17:5: note: 'int INF' previously defined here
   17 | int INF = 100005;
      |     ^~~
a.cc:220:15: error: redefinition of 'long long int mod'
  220 | long long int mod=1000000007;
      |               ^~~
a.cc:18:15: note: 'long long int mod' previously defined here
   18 | long long int mod=1000000007;
      |               ^~~
a.cc:221:11: error: redefinition of 'long long int TES'
  221 | long long TES=1000007;
      |           ^~~
a.cc:19:11: note: 'long long int TES' previously defined here
   19 | long long TES=1000007;
      |           ^~~
a.cc:222:11: error: redefinition of 'long long int INFF'
  222 | long long INFF = 1000000000000000005LL;
      |           ^~~~
a.cc:20:11: note: 'long long int INFF' previously defined here
   20 | long long INFF = 1000000000000000005LL;
      |           ^~~~
a.cc:223:8: error: redefinition of 'double PI'
  223 | double PI = acos(-1);
      |        ^~
a.cc:21:8: note: 'double PI' previously defined here
   21 | double PI = acos(-1);
      |        ^~
a.cc:224:5: error: redefinition of 'int dirx [8]'
  224 | int dirx[8] = { -1, 0, 0, 1, -1, -1, 1, 1 };
      |     ^~~~
a.cc:22:5: note: 'int dirx [8]' previously defined here
   22 | int dirx[8] = { -1, 0, 0, 1, -1, -1, 1, 1 };
      |     ^~~~
a.cc:225:5: error: redefinition of 'int diry [8]'
  225 | int diry[8] = { 0, 1, -1, 0, -1, 1, -1, 1 };
      |     ^~~~
a.cc:23:5: note: 'int diry [8]' previously defined here
   23 | int diry[8] = { 0, 1, -1, 0, -1, 1, -1, 1 };
      |     ^~~~
a.cc:264:5: error: redefinition of 'int main()'
  264 | int main()
      |     ^~~~
a.cc:62:5: note: 'int main()' previously defined here
   62 | int main()
      |     ^~~~