Filtering hard "algorithmic" problems without heavy math element

Revision en2, by soda_bottle, 2023-05-25 05:40:02

After solving a couple hundred of codeforces (at coder) problems I have noticed that these problems usually have one or more mathematical properties which is the main "puzzle" and once that is identified/cracked, implementing the solution is relatively straightforward. I do find such kind of problems really fun to solve and admire the writers who come up with such great ideas.

However, looking at other platforms like Google Kickstart, CS Academy etc. I noticed that the difficult problems there are less math heavy but are more "algorithmic" and have nuances that are less straightforward to observe as they don't have any sort of "elegant" math property. To understand more clearly, look at the editorial of this problem — https://csacademy.com/contest/fii-code-2020-round-2/task/escaping-courses/statement/ Ideas like "defining a node as (cell,time-interval)" and "using two queues to remove log factor" etc, are pretty difficult to come up with in my opinion.

After solving numerous cf problems my math/induction/greedy intuitions have improved drastically, but I lack skill to solve problems of the category described above. I'm sure such problems are present in CF too, since CF contestants do well on all sorts of problems. But I'm unable to find the right filters to find such problems.

I hope I can get some help!

Thanks All!

Tags algorithms

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English soda_bottle 2023-05-25 05:40:02 19
en1 English soda_bottle 2023-05-25 04:30:39 1403 Initial revision (published)