Un-ek

CodeChefOpen on judge ↗

You will be given an $N$ X $M$ binary matrix made up entirely of $0$s and $1$s, count the number of continuous $1$s of length $K$ present in the matrix. These continuous sequences of $1$ can be present either horizontally, vertically or diagonally. Find all the possible sequences of $K$ number of $1$s in the matrix and print the total number of such sequences. ###Input: - First-line will co

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