soda_bottle's blog

By soda_bottle, history, 18 months ago, In English

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!

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

»
18 months ago, # |
  Vote: I like it +8 Vote: I do not like it

"Competitive programming has no place for algorithmic problems" — maybe some cf coordinator at some point.

Try looking for problems in older cf rounds, 2xx-5xx rounds are decent for that. ICPC contests also have a fair share of those.

»
18 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by soda_bottle (previous revision, new revision, compare).