| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3843 |
| 2 | jiangly | 3705 |
| 3 | Benq | 3628 |
| 4 | orzdevinwang | 3571 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3530 |
| 8 | ecnerwala | 3499 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | nor | 154 |
| 6 | maroonrk | 153 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 9 | orz | 145 |
| 10 | pajenegod | 144 |
Help with Binary Search Problem. 537 Div 2 C
I attempted problem C Contest 537 Div 2. I implemented a modified binary search which seems to cover all the edge cases as well. I don't why I get a time limit exceeded on Testcase 5.
It would be great if someone could look at my code and help me out.
My code is 49673257 .
Any kind of help would be deeply appreciated.
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en1 |
|
dakshgautam1 | 2019-02-10 03:38:52 | 484 | Initial revision (published) |
