Impostor_Syndrome's blog

Count of rectangles with sum = k, in a N*N matrix full of zeroes and ones.
By Impostor_Syndrome, history, 2 years ago, In English

Problem Link ---> https://mirror.codeforces.com/contest/364/problem/E

I've read the editorial, but I'm unable to understand the algo. Can anyone give a better explanation, or some resources to understand this problem. I need to understand this problem, before applying a similar logic to another problem. A similar problem appeared in one of my divid-and-conquer based test, a while ago.

  • Vote: I like it
  • -6
  • Vote: I do not like it

»
2 years ago, # |
  Vote: I like it +38 Vote: I do not like it

If you're unable to understand a div1. E algorithm, then maybe you should try to solve easier problems.

→ Reply