I want to Know what's the answer for this Problem And What's the technique to solve with ? http://codeforces.net/contest/842/problem/A
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | adamant | 156 |
5 | cry | 155 |
5 | atcoder_official | 155 |
5 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
I want to Know what's the answer for this Problem And What's the technique to solve with ? http://codeforces.net/contest/842/problem/A
Name |
---|
Just make a for loop from l to r, i for example. Then you should check if i / k is between x and y and also if i / k is an integer (people who didnt check this were hacked). If this statement will be true at least once then answer is "YES", otherwise "NO".
Okay Thanks
Thanks :D
A simple linear search in [x, y] (the given range for the cost)
If, for at least one value
, i * k (where k is the efficiency required) lies in the range of the experience ie. [l, r], the answer is "YES" otherwise "NO". Time complexity of this solution is O(y - x)
I didn't learn linear search , is it the reason that I can't solve the problem ?
Linear search is just loop/search which works in linear time, what to learn here? :D
Okay , I thought it as binary search that need to learn