영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
You are given an n × n grid whose each square is either black or white. A subgrid is called beautiful if its height and width is at least two and all of its corners are black. How many beautiful subgrids are there within the given grid?
Input
The first input line has an integer n: the size of the grid.
Then there are n lines describing the grid: 1 means that a square is black and 0 means it is white.
Output
Print the number of beautiful subgrids.
Constraints
- 1 ≤ n ≤ 3000
예제
예제 1
5 00010 11111 00110 11001 00010
4