As some of you might already know, this blog is inspired by my very good friend tibinyte's post, which you can find here.
The golden problems are my personal favourites, the green problems are pretty good and the red problems are not worth your time in my opinion.
Problem difficulty legend:
- 1600? : the rating shown is just my estimate, and most likely innacurate
- 2100* : the rating shown is the average of all the votes cast on the editorial regarding the difficulty of the problem
- 2500 : the problem has this exact rating on codeforces
Infoleague problems
Peppers++ and Moisil++
Without going into much detail, these are contests for middle and high school students from Romania.
The following problems are available in this group. The statements are unfortunately only in Romanian, in the contest materials section of each problem.
Brief summary of the statement: Split an array $$$a_1,a_2,\ldots,a_n$$$ into $$$k$$$ subsequences such that their total cost is minimal. The cost of a subsequence is equal to: $$$\text{Max(subsequence)}-\text{Min(subsequence)}$$$. $$$1 \le k \le n \le 5 \cdot 10^5$$$, $$$1 \le a_i \le 10^9$$$ | |||||||
FIICode
TL;DR: Given $$$n,m$$$ and $$$s$$$, check whether an array $$$a_1,a_2,\ldots,a_n$$$ exists such that $$$1 \le a_i \le m$$$ and $$$\sum_{i=1}^n i \cdot a_i = s$$$. | |||||||
Codeforces Rounds
This is the problem that I hate the most out of everything I've ever written. |
will be a bit irrelevant but I want to ask how do you add grid/spreadsheet to your blog
You can inject basic HTML into blogs.
Code: https://pastebin.com/yVVKw7wF
Codeforces supports markdown.