Counting Squares

AtCoder
IDabc275_c
Time2000ms
Memory256MB
Difficulty
There is a two-dimensional plane. For integers $r$ and $c$ between $1$ and $9$, there is a pawn at the coordinates $(r,c)$ if the $c$\-th character of $S_{r}$ is `#`, and nothing if the $c$\-th character of $S_{r}$ is `.`. Find the number of squares in this plane with pawns placed at all four vertices. ## Constraints * Each of $S_1,\ldots,S_9$ is a string of length $9$ consisting of `#` and `.`. ## Input The input is given from Standard Input in the following format: $S_1$ $S_2$ $\vdots$ $S_9$ [samples]
Samples
Input #1
##.......
##.......
.........
.......#.
.....#...
........#
......#..
.........
.........
Output #1
2

The square with vertices $(1,1)$, $(1,2)$, $(2,2)$, and $(2,1)$ have pawns placed at all four vertices.
The square with vertices $(4,8)$, $(5,6)$, $(7,7)$, and $(6,9)$ also have pawns placed at all four vertices.
Thus, the answer is $2$.
Input #2
.#.......
#.#......
.#.......
.........
....#.#.#
.........
....#.#.#
........#
.........
Output #2
3
API Response (JSON)
{
  "problem": {
    "name": "Counting Squares",
    "description": {
      "content": "There is a two-dimensional plane. For integers $r$ and $c$ between $1$ and $9$, there is a pawn at the coordinates $(r,c)$ if the $c$\\-th character of $S_{r}$ is `#`, and nothing if the $c$\\-th charac",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc275_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "There is a two-dimensional plane. For integers $r$ and $c$ between $1$ and $9$, there is a pawn at the coordinates $(r,c)$ if the $c$\\-th character of $S_{r}$ is `#`, and nothing if the $c$\\-th charac...",
      "is_translate": false,
      "language": "English"
    }
  ]
}
Full JSON Raw Segments