Codeforces--842A--Kirill And The Game

题目描述：
Kirill plays a new computer game. He came to the potion store where he can buy any potion. Each potion is characterized by two integers — amount of experience and cost. The efficiency of a potion is the ratio of the amount of experience to the cost. Efficiency may be a non-integer number.

For each two integer numbers a and b such that l ≤ a ≤ r and x ≤ b ≤ y there is a potion with experience a and cost b in the store (that is, there are (r - l + 1)·(y - x + 1) potions).

Kirill wants to buy a potion which has efficiency k. Will he be able to do this?
输入描述:
First string contains five integer numbers l, r, x, y, k (1 ≤ l ≤ r ≤ 107, 1 ≤ x ≤ y ≤ 107, 1 ≤ k ≤ 107).
输出描述:
Print “YES” without quotes if a potion with efficiency exactly k can be bought in the store and “NO” without quotes otherwise.

You can output each of the letters in any register.
输入：
1 10 1 10 1
1 5 6 10 1
输出：
YES
NO
题意：
给你两个区间[L,R].[X,Y]，，和一个整数k。求是否能从第一个区间中取一个整数a，第二个区间取一个整数b，使得a/b恰好等于k。
题解：
暴力，从x,y区间中遍历，判断b * k的和是不是在l，r内就好了
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

typedef long long ll;

int main(){
    int l,r,x,y,k;
    while(scanf("%d%d%d%d%d",&l,&r,&x,&y,&k)!=EOF){
        bool flag = false;
        for(int i = x; i <= y; i ++){
            ll sum = 1ll*i * k;
            if(sum >= l && sum <= r){
                flag = true;
                break;
            }
        }
        if(flag) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}