Comments
+2

I'm not him, but he may consider his rating range problems too boring (even though he is not consistent at them) and so he decided to master his rating range by knowning how to solve a lot harder problems.
+1

Can somebody add this blog to the catalog? I think this is useful enough.

On sigma_g → Codeforces dark theme, 4 years ago
0

create an issue on github, if you want him to solve that problem.

+8

try to migrate to dark reader extension on google, it works better

edit : initially it enables dark mode everywhere in chrome, but in settings you can specify that you want only dark mode on some specific websites (like codeforces.com)
On flavius_nebunu → Your country’s NOI, 4 years ago
+5

It is only a hypothesis, because I don't talk to any of the current strong moldavian competitive programmers like SlavicG, mesanu, TimDee, Vanilla.

They simply don't practice specifically for this olympiad. The reason is that it is not a very hard (let's simply put it in that way) contest, in comparison with other OIs such as ROI.

For example in 2017 for grades 10 — 12 there was proposed a problem that asked you to calculate the size of the condensation of the original directed graph (which is a fairly basic task for this kind of competition).

By solving problems for harder contests, like CEOI, COI, ROI and so on — they prepare themselves automatically for it.

On flavius_nebunu → Your country’s NOI, 4 years ago
0

You can check out Republic of Moldova final stage olympiads on this site and for informatics only years 2017 — 2019 are currently available on site. If you will use google, you can find maybe 2014 — 2016 by accessing old minister of education website.

for example : this is the page for 2019 olympiad in informatics
+6

1)It depends on your definition of dp: whichever definition is more convenient for you to calculate, that's the one you'll continue to use. As an example can serve this problem from atcoder dp contest. You can define there theoretically 2D recurrent function, but with 1D it is easier to calculate (I don't know a solution which passes the test cases with a 2D dp, only 1D).

2)Another situation could be when the MLE / TLE is tight and you need to reduce the number of parameters to pass the test cases. As an example can serve this problem from USACO december contest 2018, where 2D precomputation / dp throws MLE.

0

sweet <3
0

This problem was also in dynamic programming course, on informatics.msk.ru. If you know russian and want to learn classic dp problems, check the course out.

On JanchoMath → EJOI 2019, 4 years ago
0

No problems, https://web.archive.org/web/20191214222245/https://www.ejoi2019.si/competition/results/
On kinnikuma → Syllabus for EJOI, 4 years ago
0

I also couldn't find the EJOI syllabus, but at the end of that link, they said that tasks from JBOI can serve as a Curriculum.
0

Can Problem E div.2 be solved using some kind of DSU ?
On Marinush → How to become Master., 4 years ago
0

I'm sold, can you make me a Botswana passport please?
On Marinush → How to become Master., 4 years ago
+8

the most probably this is some Moldavian Esoteric Unorthodox technique to arouse the interest around the blog, by writting comments asking what is "Rudy's trick".
+3

For problem E: is there some binary search solution?
0

Heroes of the Storm
0

This is a good approach , thank you!
0

This is a very good editorial , orz to the author! Well written explanations + liked the idea of "problem note".
On Hudayar → Let's grow!, 5 years ago
0

I'm in , good luck everyone.

my goal : blue or purple till the end of the year , this will be rough

0

Thank you SO MUCH for your help, after your explanation I started experimenting and finally understood what they meant in the editorial. Sorry for my late response.

0

Can somebody explain why in div.2 E the observation that "$$$i$$$ is ill when minimal value in our segment tree on interval $$$[l + 1; i]$$$ is smaller than $$$r$$$" is working?
0

It remembers me the problem "Jelly", from IOI 2020 practice set

0

Where can we find the editorial to the problems from the last qualificational round?
0

Also, on Moldavian Republican Olympiad in Informatics from 2018 , problem 2 from the second day appeared on MOSH 2006 (moscow olympiad in informatics).

mosh problem mroi2018
+1

WOW,SO COOL! Thank you for this and HAPPY NEW YEAR EVERYONE!
0

Moldovan Santa Barbara
0

I love you, author!
+5

I love democracy.
0

Is it possible to add this blog in "To Practice Problems" category?
-56

MIKE! BAN HIM!!!!!!!!!!!

EDIT : JUST LOOK AT HIS PFP
0

thank you for you reply!