Black Corner
CodeChefOpen on judge ↗
Problem description. Given an n x n grid whose each square is either black(1) or white(0), calculate the number of subgrids whose all corners are black. Input Format - - First line contains an integer n - Each of the next n line contains n space separated integers(either 0 or 1). Output Format - Print a single integer that is the count of the subgrids whose all corner elements are black in
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.
Sign in to chat with the tutor and save your progress.
Sign in to start