Tontti

#!/usr/bin/python3
import math
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, expand):
	trees=0
	if expand==0:
		for i in range(0,size):
			for j in range(0,size):
				trees+=a[y+i][x+j]
	else:
		for i in range(0,size):
			trees+=a[y+i][x+size-1]
		for i in range(0,size-1):
			trees+=a[y+size-1][x+i]
		#trees-=a[y+size-1][x+size-1]
	return trees

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

#print(countTrees(2,0,3))
answer=0
sqrt=int(math.sqrt(x))
for i in range(0, m):
	for j in range(0,n):
		expand = 0
		trees = 0
		for k in possibleSquares(i,j, sqrt):
			trees += countTrees(i,j,k,expand)
			if trees > x:
				break
			elif trees == x:
				answer+=1
				break
			else:
				expand=1
print(answer)

Test 1

Group: 1

Verdict: WRONG ANSWER

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