nskybytskyi's blog

Binary and Ternary Search Training [Theory + Walkthrough]
By nskybytskyi, history, 3 years ago, In English

Codeforces has an excellent archive of training contests, named gyms!

But it is very well possible that you do not know about the one beginner-friendly gym that I want to cover today, and the reason is that it is only available in Russian :|

I translated the statements to English for you, and recorded a problem walkthrough with theoretical material included, in case you ever get stuck or want to refresh the theory.

We will cover more gyms from this old but gold series by Saint Petersburg State University in the future, so stay tuned!

  • Vote: I like it
  • +88
  • Vote: I do not like it

»
3 years ago, # |
  Vote: I like it +16 Vote: I do not like it

Great work! Maybe, need to contact someone like MikeMirzayanov to add a new attachment to contest itself?

→ Reply
»
3 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Wonderful work and thanks a lot sincerely for this, Arigato senpai

→ Reply
»
3 years ago, # |
  Vote: I like it +9 Vote: I do not like it

How are the problems in this problemset by Saint Petersburg State University different from codeforces problem? Are they more tough or revolving around different ideas?

→ Reply
  • »
    »
    3 years ago, # ^ |
    ← Rev. 3   Vote: I like it 0 Vote: I do not like it

    I would say that these problems are a bit more standard, in the sense that participants with more experience can recognize them. Ideas remain more or less the same for all levels below ~ GM and only then you have to learn new ideas that were not around 5 or 10 years ago.

    → Reply
»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Is there an easy way to prove that the function for the time in C is unimodal?

→ Reply
»
3 years ago, # |
  Vote: I like it +8 Vote: I do not like it

great work brother,add more topics

→ Reply