Lehmät

from itertools import chain


hw = input().split(" ")
h = int(hw[0])
w = int(hw[1])

cowmap = [""] * h

for i in range(h):
    cowmap[i] = input()


#first the upper bound:
startX = -1
startY = -1

endX = -1
endY = -1


for row in range(len(cowmap)):
    found = cowmap[row].find('*')
    if found == -1:
        continue
    else:
        startX = found
        startY = row
        break
    
cowmap = cowmap[startY+1:]


for row in range(len(cowmap)):
    cowmap[row] = cowmap[row][startX+1:]
    #the ooperation on the next line 
    #only needs to be done one time, optimization?
    endX = cowmap[0].find('*')-1
    cowmap[row] = cowmap[row][:endX]





#finally, endY

for row in range(len(cowmap)-1,-1,-1):
    if cowmap[row].find('*')==-1:
        
        cowmap = cowmap[:row+1]
        break



#TODO probably slow??
cowmap1d = list(chain.from_iterable(cowmap))


count = 0
for tile in cowmap1d:
    if tile == '@':
        count += 1

print(count)

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: WRONG ANSWER

Test 5

Group: 1, 2

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER