Hello Codeforces!
I decided to write a blog today because I haven't done much in the past 2 days. Today I completed one set of problems on the topics of arrays, maps, sets, pairs, etc (16 problems). I really liked the tasks, if anyone is interested, all links to sources will be in the comments. The difficulties in this set ranged from 800 to 1400. I also decided to make a mashup today to prepare for the upcoming Div1+2, I wrote it quite well. By the way, this mashup made me understand that to solve greedy problems, you need to look for several solutions and try the optimal ones. In problem B, after thinking of several possible solutions, I was able to find the correct one. The mashup is still not finished, but according to preliminary results, 1st place is still occupied by a user with the nickname terracottalite (10 solved problems). To my surprise, despite the fact that this is my first mashup, 10 people took part in it. Thank you for supporting me!
Plans for tomorrow:
Don’t fail Div1+2 (like the last time), continue solving problems from the archive, try to finish a set of problems about Prefixes and Suffixes).
