Hi guys!↵
↵
[Problem G](https://mirror.codeforces.com/contest/2149/problem/G) on [round 1054](https://mirror.codeforces.com/contest/2149) is a repeated problem. It's an easier version of problem [840D. Density](https://mirror.codeforces.com/problemset/problem/840/D).↵
↵
The problems are effectively the same, with the only difference being in Density there's a number k (2 <= k <= 5) and you must print values that occur more than (R — L + 1) / k times. This problem also appears in USACO Platinum Divide And Conquer as the last problem.↵
↵
This may have allowed many people to solve it, even if they didn't know the solution.↵
↵
In problem G, I also don't like that they didn't add the -1 case in the sample tests causing many correct solutions to achieve Wrong Answer on test 3.↵
↵
Thanks for reading this blog :), Bye!
↵
[Problem G](https://mirror.codeforces.com/contest/2149/problem/G) on [round 1054](https://mirror.codeforces.com/contest/2149) is a repeated problem. It's an easier version of problem [840D. Density](https://mirror.codeforces.com/problemset/problem/840/D).↵
↵
The problems are effectively the same, with the only difference being in Density there's a number k (2 <= k <= 5) and you must print values that occur more than (R — L + 1) / k times. This problem also appears in USACO Platinum Divide And Conquer as the last problem.↵
↵
This may have allowed many people to solve it, even if they didn't know the solution.↵
↵
In problem G, I also don't like that they didn't add the -1 case in the sample tests causing many correct solutions to achieve Wrong Answer on test 3.↵
↵
Thanks for reading this blog :), Bye!
