Count of rectangles with sum = k, in a N*N matrix full of zeroes and ones.

Правка en1, от Impostor_Syndrome, 2022-02-08 14:37:40

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.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Impostor_Syndrome 2022-02-08 14:37:40 459 Initial revision (published)