Tontti

#!/algorithms/bruteforce
h, w, n = [int(i) for i in raw_input().split()]
m = []
for i in [0]*h:
    m.append([int(q=="*") for q in list(raw_input())])

def csq(x,y,s): return sum([m[yy][xx] for xx in range(x,x+s) for yy in range(y,y+s)])

r=0
for s in range(1,min(h,w)):
    for x in range(w-s):
        for y in range(h-s):
            if csq(x, y, s)==n:
                r+=1
print r

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: WRONG ANSWER

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