시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 | 256 MB | 88 | 46 | 32 | 45.070% |
Troy loves triangles. He especially likes counting triangles. He has an N-by-N grid consisting of either “.
” or “#
” characters. Help him count the number of triangles formed only by “#
” characters in the grid. Triangles are of the form
# # ### #, ###, #####, etc.
More formally, a triangle of height h consists of h rows for some positive integer h. The ith row contains 2i − 1 “#
” characters for i = 1, . . . , h. The rows are centred above each other so that they are symmetrical about a vertical line down their middle.
The first line contains the number N (1 ≤ N ≤ 2000) representing the size of the grid. The next N lines each contain N characters as described above.
Output the number of triangles in the grid.
5 ..... .###. .###. ##### .....
16