Last Div3G was a repeated problem

Правка en3, от Omarr., 2025-09-26 16:06:20

Hi guys!

Problem G on round 1054 is a repeated problem. It's an easier version of problem 840D. Density.

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!

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский Omarr. 2025-09-26 16:06:20 0 Tiny change: 'e than (R &mdash; L + 1) / ' -> 'e than (R - L + 1) / '
en2 Английский Omarr. 2025-09-26 16:06:07 11
en1 Английский Omarr. 2025-09-26 16:05:01 839 Initial revision (published)