842A - Kirill And The Game - CodeForces Solution

//jeet boro teejorob
//refer bottom for tips
//
#include <bits/stdc++.h>
 
using namespace std;

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma") 
#define pb push_back
#define endl '\n'
#define MOD 1000000007
//1e9+7 is a double
#define int long long //may have to comment this line if some errors arise
#define N 1000000007L; // prime modulo value
#define F first
#define S second

//TIP: USE CODING BRUTE FORCE TO GENERATE INTERMEDIATE SOLUTIONS FOR SMALL EXAMPLES
//(subsequence master good array example)
//always run a testcase before official submission
void solve(){
	
} 
//d2c is observation so keep observing, make cases and you are done with the problem
 
// Recursive function to return 
// gcd of a and b 
   
signed main()
{
	ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int l,r,x,y,k;
    cin>>l>>r>>x>>y>>k;
    bool ok = false;
	for(int i = x;i<=y;i++){
		if(i*k>=l && i*k<=r){
			ok = true;
		}
	}
	cout<<(ok? "YES" : "NO");
}
/*
do everything with every variable and its constraints 
 stuff you should look for
try out a few custom exampldes if stuck to figure out some patterns
1. prefer vector over arrays
2. common variable names: 
	max : mx
	min: mn
	vector : v
3. take care of edge cases (n==1?)
4. take care of overflow (intger to long?)
5. take care of array bounds, (n, negative index)?
6. do smth instead of nothing and stay organized
7. write stuff down on real paper, to get a more organized idea, this actually saves time
*/