← 返回题目

题库练习 Right Triangles

← 上一题下一题 →

A8033 | $Right Triangles$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You are given a $n×m$ field consisting only of periods ('.') and asterisks ('\*'). Your task is to count all right triangles with two sides parallel to the square sides, whose vertices are in the centers of '\*'-cells. A right triangle is a triangle in which one angle is a right angle (that is, a 90 degree angle).

输入格式

The first line contains two positive integer numbers $n$ and $m$ ( $1<=n,m<=1000$ ). The following $n$ lines consist of $m$ characters each, describing the field. Only '.' and '\*' are allowed.

输出格式

Output a single number — total number of square triangles in the field. Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cout (also you may use %I64d).

输入输出样例

输入 #1

2 2
**
*.

输出 #1

输入 #2

3 4
*..*
.**.
*.**

输出 #2

C++ 编辑器

输入

输出