Tontti

#!/usr/bin/python3
from collections import Counter
n, m, x = map(int, input().split())
#print(n,m,x)
a=[]
for i in range(0,n):
	a.append(list(map(int, list(input().replace('.','0').replace('*','1')))))
#a=a.replace('.','0').replace('*','1')

#print(a)


#for i in range(1, limit+1):
#	pass

def countTrees(x,y,size):
	trees=0
	for i in range(0,size):
		#for j in range(0,size):
		trees+=Counter(a[y+i][x:x+size])[1]
	return trees

def possibleSquares(x,y):
	if n-y<m-x:
		limit=n-y
	else:
		limit=m-x
	return list(range(1,limit+1))

#print(countTrees(2,0,3))
answer=0

for i in range(0, m):
	for j in range(0,n):
		for k in possibleSquares(i,j):
			if countTrees(i,j,k) == x:
				answer+=1
print(answer)

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED