I want to Know what's the answer for this Problem And What's the technique to solve with ? http://codeforces.me/contest/842/problem/A
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
I want to Know what's the answer for this Problem And What's the technique to solve with ? http://codeforces.me/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