Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance. ×

Best use of binary search in real life

Revision en5, by nkamzabek, 2019-10-26 16:30:48

Yesterday, when I was writing virtual contest in GYM, I found some interesting feature. From status I could find number of tests, I guess it works for any problem. However, I have not tested it for official round, but at all it's worth for a new blog. In the status-filter bar, you maybe have seen a section "test", but you probably dont know the magic, which can be done with it.

By changing sign to $$$\geq$$$(is greater than or equal to) and giving number to this empty space you can find number of test. If you found that maximal $$$x$$$, that all submissions are accepted and no submissions at $$$x + 1$$$, $$$x$$$ is the number of test. You may ask, why binary search is written in the title. It's the most optimal and the fastest way to find this number, less than 10 steps)

P.S. Sorry for my poor English

UPD: It works in Official Rounds.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English nkamzabek 2019-10-26 16:30:48 42 Tiny change: ' English ' -> ' English \n\n**UPD:** It works in Official Rounds. '
en4 English nkamzabek 2019-10-26 13:14:33 18 Tiny change: 'r of tests for any ' -> 'r of tests, I guess it works for any '
en3 English nkamzabek 2019-10-26 13:02:08 34 Tiny change: ' 10 steps) ' -> ' 10 steps)\n\nP.S. Sorry for my poor English '
en2 English nkamzabek 2019-10-26 12:59:42 620 Tiny change: 'sign to $\me$(more or ' -> 'sign to $\geq$(more or ' (published)
en1 English nkamzabek 2019-10-26 07:27:31 254 Initial revision (saved to drafts)