← All problemsSign in

Border Subgrid Count II

CSESCounting ProblemsOpen on judge ↗

You are given a grid of letters. Your task is to calculate, for each letter, the number of rectangular subgrids whose border consists of that letter. Input The first line has two integers n and k: the size of the grid and the number of letters. The letters are the first k uppercase letters. After this, there are n lines that describe the grid. Each line has n letters. Output Print k lines: fo

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start