304402: CF842A. Kirill And The Game

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Kirill And The Game

题意翻译

输入五个整数 $l$, $r$, $x$, $y$, $k$, 问是否存在一个整数 $i$ ($i \in [x,y]$) , 使得 $i×k\in[l,r]$

题目描述

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<=10^{7} $ , $ 1<=x<=y<=10^{7} $ , $ 1<=k<=10^{7} $ ).

输出格式


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

1 10 1 10 1

输出样例 #1

YES

输入样例 #2

1 5 6 10 1

输出样例 #2

NO

Input

题意翻译

输入五个整数 $l$, $r$, $x$, $y$, $k$, 问是否存在一个整数 $i$ ($i \in [x,y]$) , 使得 $i×k\in[l,r]$

加入题单

算法标签: