[Codeforces] Round #754 (Div. 2) C. Dominant CharacterRead more
[Codeforces] Educational Codeforces Round 116 (Rated for Div. 2) C. BanknotesRead more
[Codeforces] Round #763 (Div. 2) C. Balanced Stone HeapsRead more
[Codeforces] Beta Round #2 A. WinnerRead more
[Codeforces] Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) C. Complex Market AnalysisRead more
[LeetCode] Number of Submatrices That Sum to Target

1074. Number of Submatrices That Sum to Target

Given a matrix and a target, return the number of non-empty submatrices that sum to target.

A submatrix x1, y1, x2, y2 is the set of all cells matrix[x][y] with x1 <= x <= x2 and y1 <= y <= y2.

Two submatrices (x1, y1, x2, y2) and (x1’, y1’, x2’, y2’) are different if they have some coordinate that is different: for example, if x1 != x1’.

Read more
[Codeforces] Round #764 (Div. 3) D. Palindromes ColoringRead more
[Codeforces] Round #766 (Div. 2) C. Not AssigningRead more
[Codeforces] Round #767 (Div. 1) A. Meximum ArrayRead more
[Codeforces] Round #767 (Div. 2) B. GCD ArraysRead more