Tontti

arr = []

def countTrees(x, y, s):
    ret = 0
    for y1 in range(y, y + s):
        ret += sum(arr[y1][x:x+s])
        #print(arr[y1][x:x+s])
    #print("\n")
    return ret

def main():
    data = str.split(input())
    arrY = int(data[0])
    arrX = int(data[1])
    n = int(data[2])
    startS = min(arrX, arrY)
    out = 0

    #initialize array
    for y in range(arrY):
        arr.append([])
        for x in range(arrX):
            arr[y].append(False)

    for y in range(arrY):
        row = input()
        for x in range(arrX):
            if row[x] == ".":
                arr[y][x] = False
            else:
                arr[y][x] = True

    for s in range(startS, 1, -1):
        #print("s: "+str(s))
        for x in range(arrX - s + 1):
            #print("x: "+str(x))
            for y in range(arrY - s + 1):
                #print("y: "+str(y))
                if countTrees(x, y, s) == n:
                    #print("found")
                    out += 1
    
    print(out)
        
if __name__ == "__main__":
    main()

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