codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

842A.md (1310B)


      1 Source: https://codeforces.com/problemset/problem/842/A
      2 
      3 A. Kirill And The Game
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 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.
     22 
     23 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).
     24 
     25 Kirill wants to buy a potion which has efficiency *k*. Will he be able to do this?
     26 
     27 Input
     28 
     29 First string contains five integer numbers *l*, *r*, *x*, *y*, *k* (1 ≤ *l* ≤ *r* ≤ 107, 1 ≤ *x* ≤ *y* ≤ 107, 1 ≤ *k* ≤ 107).
     30 
     31 Output
     32 
     33 Print "YES" without quotes if a potion with efficiency exactly *k* can be bought in the store and "NO" without quotes otherwise.
     34 
     35 You can output each of the letters in any register.
     36 
     37 Examples
     38 
     39 Input
     40 
     41 ```
     42 1 10 1 10 1
     43 ```
     44 
     45 Output
     46 
     47 ```
     48 YES
     49 ```
     50 
     51 Input
     52 
     53 ```
     54 1 5 6 10 1
     55 ```
     56 
     57 Output
     58 
     59 ```
     60 NO
     61 ```