Present to Mom

题意翻译

### 题目描述 求一个 $n\times m$ 的字符矩阵内，有多少个不同的矩形包含不少于 $k$ 个下述图形： ``` 1 111 1 ``` 注意，这些图形可以相互重叠，但是不能完全重叠。 ### 输入格式 第一行三个正整数，$n,m,k$。 接下来 $n$ 行，每行 $m$ 个字符描述矩阵。这些字符只可能是```0```或```1```。 ### 输出格式 一行一个正整数，代表询问的答案。 （提示：本题请用```%I64d```或```cout```输出```long long```）

题目描述

How many stars are there in the sky? A young programmer Polycarpus can't get this question out of his head! He took a photo of the starry sky using his digital camera and now he analyzes the resulting monochrome digital picture. The picture is represented by a rectangular matrix consisting of $ n $ lines each containing $ m $ characters. A character equals '1', if the corresponding photo pixel is white and '0', if it is black. Polycarpus thinks that he has found a star on the photo if he finds a white pixel surrounded by four side-neighboring pixels that are also white: `<br></br> 1 <br></br>111<br></br> 1 <br></br>` a star on the photoPolycarpus whats to cut out a rectangular area from the photo and give his mom as a present. This area should contain no less than $ k $ stars. The stars can intersect, have shared white pixels on the photo. The boy will cut out the rectangular area so that its borders will be parallel to the sides of the photo and the cuts will go straight between the pixel borders. Now Polycarpus keeps wondering how many ways there are to cut an area out of the photo so that it met the conditions given above. Help Polycarpus find this number.

输入输出格式

输入格式

The first line of the input data contains three integers $ n,m $ and $ k $ ( $ 1<=n,m<=500;1<=k<=nm $ ). Then follow $ n $ lines, containing the description of the given photo as a sequence of lines. Each line contains $ m $ characters '0' or '1'.

输出格式

Print the required number of areas on the given photo.

输入输出样例

输入样例 #1

4 6 2
111000
111100
011011
000111

输出样例 #1

6

输入样例 #2

5 5 4
11111
11111
11111
11111
11111

输出样例 #2

9

说明

We'll number the rows and columns below starting from 1, the coordinates $ (p,q) $ will denote a cell in row $ p $ , column $ q $ . In the first sample Polycarpus should cut out any area containing a rectangle whose opposite corners lie in cells $ (1,1) $ and ( $ 3,4 $ ). Only rectangles with opposite corners in $ (1,1) $ and ( $ x,y $ ), where $ x>=3 $ and $ y>=4 $ fit the conditions. In the second sample any rectangle whose each side is no less than four, will do. The possible rectangle sizes are $ 4×4 $ , $ 4×5 $ , $ 5×4 $ and $ 5×5 $ . Such figures can be cut in 4 ways, 2 ways, 2 ways and 1 way correspondingly. Please do not use the %lld specificator to read or write 64-bit integers in C++. It is preferred to use cin, cout streams or the %I64d specificator.

题意翻译

### 题目描述 求一个 $n\times m$ 的字符矩阵内，有多少个不同的矩形包含不少于 $k$ 个下述图形： ``` 1 111 1 ``` 注意，这些图形可以相互重叠，但是不能完全重叠。 ### 输入格式 第一行三个正整数，$n,m,k$。 接下来 $n$ 行，每行 $m$ 个字符描述矩阵。这些字符只可能是```0```或```1```。 ### 输出格式 一行一个正整数，代表询问的答案。 （提示：本题请用```%I64d```或```cout```输出```long long```）